QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #541386 | #8934. Challenge NPC | ucup-team4508# | WA | 18ms | 3880kb | C++14 | 462b | 2024-08-31 19:16:32 | 2024-08-31 19:16:32 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define LL long long
LL n,i,j,k,m,t,useless;
LL a[500005];
int main(){
scanf("%lld",&useless);
printf("1004 252003 2\n");
for(i=1;i<=1004;i++){
if(i%2==1) printf("1 ");
else printf("2 ");
}
printf("\n");
for(i=3;i<=1004;i++){
if(i%2==1){
for(j=2;j<=i;j+=2)
printf("%lld %lld\n",i,j);
}
else{
for(j=1;j<=i;j+=2)
printf("%lld %lld\n",i,j);
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 18ms
memory: 3796kb
input:
1
output:
1004 252003 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ...
result:
ok ok
Test #2:
score: -100
Wrong Answer
time: 18ms
memory: 3880kb
input:
2
output:
1004 252003 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ...
result:
wrong answer The graph is not correct