QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#606563 | #8934. Challenge NPC | UESTC_DECAYALI# | AC ✓ | 19ms | 5460kb | C++20 | 519b | 2024-10-03 10:38:53 | 2024-10-03 10:38:53 |
Judging History
answer
#include<cstdio>
#include<iostream>
#include<vector>
#define RI register int
#define CI const int&
using namespace std;
const int N=1024;
int k,col[N],L[N],R[N]; vector <pair <int,int>> E;
int main()
{
scanf("%d",&k);
for (RI i=2;i<=k+2;++i) for (RI j=1;j<i;++j)
E.push_back({2*i-1,2*j}),E.push_back({2*i,2*j-1});
printf("%d %d %d\n",(k+2)*2,(int)E.size(),2);
for (RI i=1;i<=k+2;++i) printf("%d %d ",1,2); putchar('\n');
for (auto [x,y]:E) printf("%d %d\n",x,y);
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3792kb
input:
1
output:
6 6 2 1 2 1 2 1 2 3 2 4 1 5 2 6 1 5 4 6 3
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3980kb
input:
2
output:
8 12 2 1 2 1 2 1 2 1 2 3 2 4 1 5 2 6 1 5 4 6 3 7 2 8 1 7 4 8 3 7 6 8 5
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3932kb
input:
3
output:
10 20 2 1 2 1 2 1 2 1 2 1 2 3 2 4 1 5 2 6 1 5 4 6 3 7 2 8 1 7 4 8 3 7 6 8 5 9 2 10 1 9 4 10 3 9 6 10 5 9 8 10 7
result:
ok ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3976kb
input:
4
output:
12 30 2 1 2 1 2 1 2 1 2 1 2 1 2 3 2 4 1 5 2 6 1 5 4 6 3 7 2 8 1 7 4 8 3 7 6 8 5 9 2 10 1 9 4 10 3 9 6 10 5 9 8 10 7 11 2 12 1 11 4 12 3 11 6 12 5 11 8 12 7 11 10 12 9
result:
ok ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3840kb
input:
5
output:
14 42 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3 2 4 1 5 2 6 1 5 4 6 3 7 2 8 1 7 4 8 3 7 6 8 5 9 2 10 1 9 4 10 3 9 6 10 5 9 8 10 7 11 2 12 1 11 4 12 3 11 6 12 5 11 8 12 7 11 10 12 9 13 2 14 1 13 4 14 3 13 6 14 5 13 8 14 7 13 10 14 9 13 12 14 11
result:
ok ok
Test #6:
score: 0
Accepted
time: 11ms
memory: 5460kb
input:
433
output:
870 188790 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 2...
result:
ok ok
Test #7:
score: 0
Accepted
time: 19ms
memory: 5412kb
input:
500
output:
1004 251502 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 #8:
score: 0
Accepted
time: 11ms
memory: 5180kb
input:
499
output:
1002 250500 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 #9:
score: 0
Accepted
time: 13ms
memory: 5296kb
input:
457
output:
918 210222 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 2...
result:
ok ok
Test #10:
score: 0
Accepted
time: 15ms
memory: 5272kb
input:
497
output:
998 248502 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 2...
result:
ok ok
Extra Test:
score: 0
Extra Test Passed