QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#788241 | #8934. Challenge NPC | 0x3f | WA | 0ms | 3808kb | C++14 | 877b | 2024-11-27 16:19:46 | 2024-11-27 16:19:48 |
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;
k <<= 1;
for (int i = 1; i <= k; i++)
for (int j = 1 + (i & 1); j < i; j += 2) e.push_back({i, j});
cout << k << " " << e.size() << " " << 2 << "\n";
for (int i = 1; i <= k / 2; i++) cout << "1 2 ";
cout << "\n";
for (auto it : e) cout << it.first << " " << it.second << "\n";
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3808kb
input:
1
output:
6 9 2 1 2 1 2 1 2 2 1 3 2 4 1 4 3 5 2 5 4 6 1 6 3 6 5
result:
wrong answer The graph is not correct