QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#140128 | #5413. 同构判定鸡 | 1kri# | 5 | 2ms | 3752kb | C++14 | 751b | 2023-08-15 09:38:12 | 2024-07-04 01:42:59 |
answer
#include <iostream>
#include <cstdio>
using namespace std;
int t,sub_id,n,m,N,M;
int tot,sta[1000005][2];
void add(int x,int y){
++tot;
sta[tot][0]=x,sta[tot][1]=y;
return;
}
void out(){
printf("%d %d\n",N,tot);
for (int i=1;i<=tot;i++)printf("%d %d\n",sta[i][0],sta[i][1]);
return;
}
int main(){
scanf("%d%d",&t,&sub_id);
while(t--){
scanf("%d%d",&n,&m);
for (int i=1;i<=m;i++){
int x,y;
scanf("%d%d",&x,&y);
}
scanf("%d%d",&N,&M);
if (sub_id==1){
tot=0;
for (int i=1;i<=N/2;i++)
for (int j=N/2+1;j<=N;j++)
add(i,j);
out();
}
if (sub_id==2){
tot=0;
for (int i=1;i<=N;i++)
for (int j=i+1;j<=N;j++)
if (i%n!=j%n)add(i,j);
out();
}
}
return 0;
}
詳細信息
Test #1:
score: 5
Accepted
time: 2ms
memory: 3744kb
input:
10 1 3 3 1 2 1 3 2 3 33 272 3 3 1 2 1 3 2 3 28 196 3 3 1 2 1 3 2 3 92 2116 3 3 1 2 1 3 2 3 29 210 3 3 1 2 1 3 2 3 62 961 3 3 1 2 1 3 2 3 97 2352 3 3 1 2 1 3 2 3 60 900 3 3 1 2 1 3 2 3 70 1225 3 3 1 2 1 3 2 3 67 1122 3 3 1 2 1 3 2 3 67 1122
output:
33 272 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 2 25 2 26 2 27 2 28 2 29 2 30 2 31 2 32 2 33 3 17 3 18 3 19 3 20 3 21 3 22 3 23 3 24 3 25 3 26 3 27 3 28 3 29 3 30 3 31 3 32 3 33 4 17 4 18 4 19 4 20 4 21 4 22 4 23 4 2...
result:
ok correct! (10 test cases)
Test #2:
score: 0
Wrong Answer
time: 2ms
memory: 3752kb
input:
10 2 5 10 1 2 1 3 1 4 1 5 2 3 2 4 2 5 3 4 3 5 4 5 28 293 8 28 1 2 1 3 1 4 1 5 1 6 1 7 1 8 2 3 2 4 2 5 2 6 2 7 2 8 3 4 3 5 3 6 3 7 3 8 4 5 4 6 4 7 4 8 5 6 5 7 5 8 6 7 6 8 7 8 8 26 4 6 1 2 1 3 1 4 2 3 2 4 3 4 82 2240 3 3 1 2 1 3 2 3 46 528 4 6 1 2 1 3 1 4 2 3 2 4 3 4 42 587 9 36 1 2 1 3 1 4 1 5 1 6 1 ...
output:
28 313 1 2 1 3 1 4 1 5 1 7 1 8 1 9 1 10 1 12 1 13 1 14 1 15 1 17 1 18 1 19 1 20 1 22 1 23 1 24 1 25 1 27 1 28 2 3 2 4 2 5 2 6 2 8 2 9 2 10 2 11 2 13 2 14 2 15 2 16 2 18 2 19 2 20 2 21 2 23 2 24 2 25 2 26 2 28 3 4 3 5 3 6 3 7 3 9 3 10 3 11 3 12 3 14 3 15 3 16 3 17 3 19 3 20 3 21 3 22 3 24 3 25 3 26 3...
result:
wrong answer wrong answer! (test case 1)
Test #3:
score: 0
Wrong Answer
time: 0ms
memory: 3540kb
input:
10 3 4 4 1 2 2 3 3 4 4 1 387 774 4 4 1 2 2 3 3 4 4 1 668 1336 4 4 1 2 2 3 3 4 4 1 1403 2806 4 4 1 2 2 3 3 4 4 1 1516 3032 4 4 1 2 2 3 3 4 4 1 1601 3202 4 4 1 2 2 3 3 4 4 1 1649 3298 4 4 1 2 2 3 3 4 4 1 1722 3444 4 4 1 2 2 3 3 4 4 1 1854 3708 4 4 1 2 2 3 3 4 4 1 1926 3852 4 4 1 2 2 3 3 4 4 1 1989 3978
output:
result:
wrong output format Unexpected end of file - int32 expected (test case 1)
Test #4:
score: 0
Wrong Answer
time: 0ms
memory: 3540kb
input:
10 4 4 4 1 2 2 3 3 4 4 1 169 1014 4 4 1 2 2 3 3 4 4 1 529 5819 4 4 1 2 2 3 3 4 4 1 841 11774 4 4 1 2 2 3 3 4 4 1 961 14415 4 4 1 2 2 3 3 4 4 1 1369 24642 4 4 1 2 2 3 3 4 4 1 1681 33620 4 4 1 2 2 3 3 4 4 1 1849 38829 4 4 1 2 2 3 3 4 4 1 361 3249 4 4 1 2 2 3 3 4 4 1 289 2312 4 4 1 2 2 3 3 4 4 1 9 9
output:
result:
wrong output format Unexpected end of file - int32 expected (test case 1)
Test #5:
score: 0
Wrong Answer
time: 0ms
memory: 3600kb
input:
1 5 4 4 1 2 2 3 3 4 4 1 2850 24300
output:
result:
wrong output format Unexpected end of file - int32 expected
Test #6:
score: 0
Wrong Answer
time: 1ms
memory: 3588kb
input:
1 6 6 9 1 4 1 5 1 6 2 4 2 5 2 6 3 4 3 5 3 6 343 2350
output:
result:
wrong output format Unexpected end of file - int32 expected