QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #539234 | #8934. Challenge NPC | ucup-team3699# | WA | 17ms | 3616kb | C++14 | 742b | 2024-08-31 14:19:39 | 2024-08-31 14:19:40 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int k;
cin >> k;
LL n = 1006, m = 502 * 503 + 503, c = 2;
cout << n << ' ' << m << ' ' << c << '\n';
int cnt = 0;
for(int i = 1; i <= n; i++){
if(i & 1){
cout << 1 << ' ';
}else{
cout << 2 << ' ';
}
}
cout << '\n';
for(int i = 1; i <= n / 2; i++){
int x = i * 2 - 1, y = i * 2;
cout << x << ' ' << y << '\n';
for(int j = 1; j < i; j++){
int u = j * 2 - 1, v = j * 2;
cout << x << ' ' << v << '\n';
cout << y << ' ' << u << '\n';
}
}
}
详细
Test #1:
score: 0
Wrong Answer
time: 17ms
memory: 3616kb
input:
1
output:
1006 253009 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 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