QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #577740 | #8934. Challenge NPC | skip2004 | WA | 13ms | 3704kb | C++20 | 499b | 2024-09-20 14:28:21 | 2024-09-20 14:28:21 |
Judging History
answer
#include<bits/stdc++.h>
namespace rgs = std::ranges;
using std::cin, std::cout;
using ll = long long;
using u64 = unsigned long long;
using db = double;
int main() {
std::ios::sync_with_stdio(false), cin.tie(0);
int n = 1024, m = (n / 2) * (n / 2), c = 2;
cout << n << ' ' << m << ' ' << c << '\n';
for(int i = 1;i <= n;++i) {
cout << i % 2 + 1 << " \n"[i == n];
}
for(int i = 1;i <= n;i += 2) {
for(int j = 2;j <= n;j += 2) {
cout << i << ' ' << j << '\n';
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 13ms
memory: 3704kb
input:
1
output:
1024 262144 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:
wrong answer The graph is not correct