QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#246909#7678. The Gameucup-team052#RE 0ms0kbC++23983b2023-11-11 11:52:572023-11-11 11:52:58

Judging History

你现在查看的是最新测评结果

  • [2023-11-11 11:52:58]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:0kb
  • [2023-11-11 11:52:57]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int Rnd(int l,int r) {return rnd()%(r-l+1)+l;}
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
int a[2000005];
signed main()
{
	freopen("j.in","w",stdout);
	int n=1000000;
	cout<<"1\n";
	printf("%d %d\n",n/2,2);
	for(int i=1;i<=n;i++) a[i]=Rnd('a','z');
	for(int i=1;i<=n;i++) a[i+n]=a[i];
	for(int i=1;i<=n;i+=2) printf("%c%c\n",a[i],a[i+1]);
	for(int i=2;i<=n;i+=2) printf("%c%c\n",a[i],a[i+1]);
	return 0;
}



詳細信息

Test #1:

score: 0
Dangerous Syscalls

input:

6
5 3
1 2 2 3 3
2 3 4
4 2
1 2 2 4
2 4
5 2
2 3 3 4 4
5 5
6 1
1 1 1 1 1 1
4
4 2
1 1 1 2
2 2
4 1
1 1 1 1
2

output:


result: