QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#542660 | #8934. Challenge NPC | ucup-team2000# | WA | 18ms | 5364kb | C++23 | 1.3kb | 2024-09-01 03:44:38 | 2024-09-01 03:44:40 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int k;
cin >> k;
vector<int> c(1050, -1);
vector<array<int, 2>> pos(505, {-1, -1});
pos[1][0] = 1;
pos[1][1] = 3;
pos[2][1] = 2;
pos[3][0] = 4;
c[1] = 1;
c[2] = 2;
c[3] = 2;
c[4] = 1;
int cur = 5;
int col = 4;
int par = 1;
vector<pair<int, int>> ed;
ed.push_back({1, 2});
ed.push_back({2, 3});
ed.push_back({3, 4});
while(col < 503){
c[cur + 1] = par + 1;
pos[col][par] = cur + 1;
for(int i = 1; i < col; i++){
if(pos[i][par ^ 1] != -1){
ed.push_back({pos[i][par ^ 1], cur + 1});
}
else{
c[cur] = (par ^ 1) + 1;
pos[i][par ^ 1] = cur;
ed.push_back({pos[i][par ^ 1], cur + 1});
for(int j = 1; j < i; j++){
assert(pos[j][par] != -1);
ed.push_back({pos[j][par], cur});
}
}
}
col++;
par ^= 1;
cur += 2;
}
cout << cur - 1 << ' ' << ed.size() << ' ' << 2 << '\n';
for(int i = 1; i < cur; i++) cout << c[i] << ' ';
cout << '\n';
for(pair<int, int> x : ed){
cout << x.first << ' ' << x.second << '\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 18ms
memory: 5364kb
input:
1
output:
1002 250501 2 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 ...
result:
wrong answer The graph is not correct