QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#821266 | #8934. Challenge NPC | Suzuranovo# | AC ✓ | 20ms | 6768kb | C++23 | 1.1kb | 2024-12-19 14:50:28 | 2024-12-19 14:50:28 |
Judging History
answer
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <array>
#include <initializer_list>
using namespace std;
void solve() {
int k; cin >> k;
int cur = 1;
vector<int> co = { 0 };
vector<array<int, 2>> side; side.reserve(k * k * 4);
// vector<int> lv = { 0 };
vector<array<int, 2>> pos; pos.push_back({ 0,0 });
for (int i = 1; i <= k + 2; ++i) {
// 每次暴力构造两个点
pos.push_back({ cur,cur + 1 });
co.push_back(0); co.push_back(1);
for (int i = 1; i <= cur / 2; ++i) {
side.push_back({ cur, pos[i][1] });
}
for (int i = 1; i <= cur / 2; ++i) {
side.push_back({ cur + 1,pos[i][0] });
}
cur += 2;
}
cout << cur - 1 << ' ' << side.size() << " 2 \n";
for (int i = 1; i < cur; ++i)
cout << co[i] + 1 << " \n"[i == cur - 1];
for (auto [x, y] : side)
cout << x << " " << y << '\n';
}
int main() {
cin.tie(nullptr)->sync_with_stdio(0);
solve();
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3572kb
input:
1
output:
6 6 2 1 2 1 2 1 2 3 2 4 1 5 2 5 4 6 1 6 3
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3456kb
input:
2
output:
8 12 2 1 2 1 2 1 2 1 2 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: 3492kb
input:
3
output:
10 20 2 1 2 1 2 1 2 1 2 1 2 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: 3548kb
input:
4
output:
12 30 2 1 2 1 2 1 2 1 2 1 2 1 2 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: 3784kb
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 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: 15ms
memory: 5576kb
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 ...
result:
ok ok
Test #7:
score: 0
Accepted
time: 16ms
memory: 5320kb
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: 20ms
memory: 5324kb
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: 17ms
memory: 6768kb
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 ...
result:
ok ok
Test #10:
score: 0
Accepted
time: 16ms
memory: 6116kb
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 ...
result:
ok ok
Extra Test:
score: 0
Extra Test Passed