QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#539843 | #8934. Challenge NPC | ucup-team022# | WA | 24ms | 7728kb | C++17 | 850b | 2024-08-31 15:48:57 | 2024-08-31 15:49:00 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pr;
const int n = 252;
vector<pr> e;
int main() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j < i; j++) {
e.push_back(pr(i, j));
e.push_back(pr(i + n, j));
e.push_back(pr(i + n + n, j + n + n));
e.push_back(pr(i + n + n + n, j + n + n + n));
}
for (int j = 1; j <= n; j++) {
e.push_back(pr(i + n + n, j + n));
e.push_back(pr(i + n + n + n, j + n + n));
e.push_back(pr(i + n + n + n, j));
}
}
cout << 4 * n << ' ' << e.size() << ' ' << n + 1 << '\n';
for (int i = 1; i <= n; i++) cout << i << ' ';
for (int i = 1; i <= n; i++) cout << n + 1 << ' ';
for (int i = 1; i <= n; i++) cout << i << ' ';
for (int i = 1; i <= n; i++) cout << i << ' ';
cout << '\n';
for (auto [x, y] : e) cout << x << ' ' << y << '\n';
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 24ms
memory: 7728kb
input:
1
output:
1008 317016 253 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98...
result:
wrong answer The graph is not correct