QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#542645#8934. Challenge NPCucup-team1766#WA 0ms3748kbC++17708b2024-09-01 03:31:362024-09-01 03:31:37

Judging History

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

  • [2024-09-01 03:31:37]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3748kb
  • [2024-09-01 03:31:36]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int k;
    cin >> k;

    int n = 2 * (k + 2);
    vector<pair<int, int>> edges;
    for (int i = 0; i < k + 2; i++) {
        for (int j = 0; j < i; j++) {
            edges.emplace_back(i, k + 2 + j);
            edges.emplace_back(j, k + 2 + i);
        }
    }
    cout << n << " " << edges.size() << " 2\n";
    for (int i = 0; i < k + 2; i++) {
        cout << 1 << " ";
    }
    for (int i = 0; i < k + 2; i++) {
        cout << 2 << " ";
    }
    cout << "\n";
    for (auto [u, v] : edges) {
        cout << u + 1 << " " << v + 1 << "\n";
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3748kb

input:

1

output:

6 6 2
1 1 1 2 2 2 
2 4
1 5
3 4
1 6
3 5
2 6

result:

wrong answer The graph is not correct