QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#788181#8934. Challenge NPC0x3fWA 0ms3560kbC++14909b2024-11-27 16:08:242024-11-27 16:08:24

Judging History

你现在查看的是最新测评结果

  • [2024-11-27 16:08:24]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3560kb
  • [2024-11-27 16:08:24]
  • 提交

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