提供一份gen
  • 板块P5350 序列
  • 楼主LgxTpre
  • 当前回复1
  • 已保存回复1
  • 发布时间2023/3/12 09:38
  • 上次更新2023/10/23 21:49:18
查看原帖
提供一份gen
66709
LgxTpre楼主2023/3/12 09:38

方便后人对拍,改n和m参数就行,p是值域

#include<bits/stdc++.h>
using namespace std;
int n=10,m=20;
int p=1000;
int main()
{
	freopen("1.in","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	srand(time(NULL));
	cout<<n<<" "<<m<<endl;
	for(int i=1;i<=n;++i)
		cout<<rand()%p+1<<" ";
	cout<<endl;
	for(int i=1;i<=m;++i)
	{
		int op=rand()%6+1;
		int l=rand()%n+1,r=rand()%n+1;
		int k=rand()%p;
		if(l>r) swap(l,r);
		switch(op)
		{
			case 1:cout<<op<<" "<<l<<" "<<r<<endl;break;
			case 2:cout<<op<<" "<<l<<" "<<r<<" "<<k<<endl; break;
			case 3:cout<<op<<" "<<l<<" "<<r<<" "<<k<<endl; break;
			case 4:while(r+k>n||l+k<=r) {l=rand()%n+1,r=rand()%n+1,k=rand()%p+1; if(l>r) swap(l,r);} cout<<op<<" "<<l<<" "<<r<<" "<<l+k<<" "<<r+k<<endl; break;
			case 5:while(r+k>n||l+k<=r) {l=rand()%n+1,r=rand()%n+1,k=rand()%p+1; if(l>r) swap(l,r);} cout<<op<<" "<<l<<" "<<r<<" "<<l+k<<" "<<r+k<<endl; break;
			case 6:cout<<op<<" "<<l<<" "<<r<<endl;break;
		}
	}
}
2023/3/12 09:38
加载中...