QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#542553 | #8934. Challenge NPC | ucup-team3695# | WA | 0ms | 3592kb | C++20 | 557b | 2024-09-01 02:34:11 | 2024-09-01 02:34:11 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0)->sync_with_stdio(0);
int k;
cin >> k;
k += 2;
int n = 2 * k;
int m = 0;
vector<vector<int>> G(n);
for (int i = 0; i < k; i++)
for (int j = 0; j < i; j++)
{
G[i * 2].push_back(j * 2 + 1);
G[i * 2 + 1].push_back(j * 2);
m += 2;
}
cout << n << ' ' << m << ' ' << 2 << '\n';
for (int i = 0; i < n; i++)
cout << "1 2 ";
cout << '\n';
for (int i = 0; i < n; i++)
for (int j : G[i])
cout << j + 1 << ' ' << i + 1 << '\n';
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3592kb
input:
1
output:
6 6 2 1 2 1 2 1 2 1 2 1 2 1 2 2 3 1 4 2 5 4 5 1 6 3 6
result:
wrong answer The graph is not correct