QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#614228 | #8934. Challenge NPC | m107239# | WA | 18ms | 5368kb | C++20 | 817b | 2024-10-05 15:56:52 | 2024-10-05 15:56:54 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int k;
std::cin >> k;
int n = 1024;
std::vector<std::pair<int, int>> ed;
for (int i = 1; i <= n; i++) {
int p = (i % 2);
for (int j = 1; j < i; j++) {
if (j % 2 == p)
continue;
ed.emplace_back(i, j);
}
}
int m = ed.size();
std::cout << n << " " << m << " " << 2 << '\n';
for (int i = 1; i <= n; i++) {
if (i & 1) {
std::cout << 1 << ' ';
} else {
std::cout << 2 << ' ';
}
}
std::cout << '\n';
for (const auto &[x, y] : ed) {
std::cout << x << " " << y << '\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 18ms
memory: 5368kb
input:
1
output:
1024 262144 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 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:
wrong answer The graph is not correct