QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#788181 | #8934. Challenge NPC | 0x3f | WA | 0ms | 3560kb | C++14 | 909b | 2024-11-27 16:08:24 | 2024-11-27 16:08:24 |
Judging History
answer
// Problem: C. Challenge NPC
// Contest: The 3rd Universal Cup. Stage 8: Cangqian
// URL: https://qoj.ac/contest/1780/problem/8934
// Author: Fourier_WJY
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// Copyright (c) 2023 Fourier All rights reserved.
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int k;
cin >> k;
vector<pair<int, int>> e;
k += 2;
for (int i = 1; i <= k; i++)
for (int j = 1; j <= i; j++) e.push_back({i, j + k});
cout << k * 2 << " " << e.size() << " " << 2 << "\n";
for (int i = 1; i <= k; i++) cout << 1 << " ";
for (int i = 1; i <= k; i++) cout << 2 << " ";
cout << "\n";
for (auto it : e) cout << it.first << " " << it.second << "\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3560kb
input:
1
output:
6 6 2 1 1 1 2 2 2 1 4 2 4 2 5 3 4 3 5 3 6
result:
wrong answer The graph is not correct