QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#606550 | #8934. Challenge NPC | ucup-team902# | AC ✓ | 63ms | 5336kb | C++23 | 514b | 2024-10-03 10:31:54 | 2024-10-03 10:31:54 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
int n = 2 * (k + 2);
vector<pair<int, int>> p;
for (int i = 1; i <= k + 2; ++i) {
for (int j = 1; j <= k + 2; ++j) {
if (i != j) p.push_back({i * 2 - 1, j * 2});
}
}
cout << n << " " << (int)p.size() << " " << 2 << endl;
for (int i = 1; i <= n; ++i) cout << (i % 2 == 1 ? 1 : 2) << (i == n ? '\n' : ' ');
for (auto [x, y] : p) cout << x << " " << y << endl;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3628kb
input:
1
output:
6 6 2 1 2 1 2 1 2 1 4 1 6 3 2 3 6 5 2 5 4
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
2
output:
8 12 2 1 2 1 2 1 2 1 2 1 4 1 6 1 8 3 2 3 6 3 8 5 2 5 4 5 8 7 2 7 4 7 6
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
3
output:
10 20 2 1 2 1 2 1 2 1 2 1 2 1 4 1 6 1 8 1 10 3 2 3 6 3 8 3 10 5 2 5 4 5 8 5 10 7 2 7 4 7 6 7 10 9 2 9 4 9 6 9 8
result:
ok ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3528kb
input:
4
output:
12 30 2 1 2 1 2 1 2 1 2 1 2 1 2 1 4 1 6 1 8 1 10 1 12 3 2 3 6 3 8 3 10 3 12 5 2 5 4 5 8 5 10 5 12 7 2 7 4 7 6 7 10 7 12 9 2 9 4 9 6 9 8 9 12 11 2 11 4 11 6 11 8 11 10
result:
ok ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
5
output:
14 42 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 4 1 6 1 8 1 10 1 12 1 14 3 2 3 6 3 8 3 10 3 12 3 14 5 2 5 4 5 8 5 10 5 12 5 14 7 2 7 4 7 6 7 10 7 12 7 14 9 2 9 4 9 6 9 8 9 12 9 14 11 2 11 4 11 6 11 8 11 10 11 14 13 2 13 4 13 6 13 8 13 10 13 12
result:
ok ok
Test #6:
score: 0
Accepted
time: 44ms
memory: 5312kb
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: 63ms
memory: 5336kb
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: 40ms
memory: 5252kb
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: 59ms
memory: 5208kb
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: 55ms
memory: 5264kb
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