QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #540157 | #8934. Challenge NPC | ucup-team3510# | AC ✓ | 17ms | 3944kb | C++20 | 495b | 2024-08-31 16:31:54 | 2024-08-31 16:31:55 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int pos[505][2];
int main()
{
int k, i, j, c = 0;
scanf("%d", &k);
printf("%d %d 2\n", 2 * k + 4, (k + 1) * (k + 2));
for(i = 1; i <= 2 * k + 4; i++)
printf("%d ", 1 + (i & 1));
printf("\n");
for(i = 1; i <= k + 2; i++)
{
pos[i][0] = ++c;
pos[i][1] = ++c;
for(j = 1; j < i; j++)
printf("%d %d\n", pos[i][0], pos[j][1]);
for(j = 1; j < i; j++)
printf("%d %d\n", pos[i][1], pos[j][0]);
}
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3872kb
input:
1
output:
6 6 2 2 1 2 1 2 1 3 2 4 1 5 2 5 4 6 1 6 3
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3784kb
input:
2
output:
8 12 2 2 1 2 1 2 1 2 1 3 2 4 1 5 2 5 4 6 1 6 3 7 2 7 4 7 6 8 1 8 3 8 5
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3944kb
input:
3
output:
10 20 2 2 1 2 1 2 1 2 1 2 1 3 2 4 1 5 2 5 4 6 1 6 3 7 2 7 4 7 6 8 1 8 3 8 5 9 2 9 4 9 6 9 8 10 1 10 3 10 5 10 7
result:
ok ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3748kb
input:
4
output:
12 30 2 2 1 2 1 2 1 2 1 2 1 2 1 3 2 4 1 5 2 5 4 6 1 6 3 7 2 7 4 7 6 8 1 8 3 8 5 9 2 9 4 9 6 9 8 10 1 10 3 10 5 10 7 11 2 11 4 11 6 11 8 11 10 12 1 12 3 12 5 12 7 12 9
result:
ok ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
5
output:
14 42 2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 3 2 4 1 5 2 5 4 6 1 6 3 7 2 7 4 7 6 8 1 8 3 8 5 9 2 9 4 9 6 9 8 10 1 10 3 10 5 10 7 11 2 11 4 11 6 11 8 11 10 12 1 12 3 12 5 12 7 12 9 13 2 13 4 13 6 13 8 13 10 13 12 14 1 14 3 14 5 14 7 14 9 14 11
result:
ok ok
Test #6:
score: 0
Accepted
time: 13ms
memory: 3880kb
input:
433
output:
870 188790 2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 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 #7:
score: 0
Accepted
time: 17ms
memory: 3944kb
input:
500
output:
1004 251502 2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 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 #8:
score: 0
Accepted
time: 17ms
memory: 3868kb
input:
499
output:
1002 250500 2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 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 #9:
score: 0
Accepted
time: 15ms
memory: 3796kb
input:
457
output:
918 210222 2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 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 #10:
score: 0
Accepted
time: 17ms
memory: 3752kb
input:
497
output:
998 248502 2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 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
Extra Test:
score: 0
Extra Test Passed