QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#614228#8934. Challenge NPCm107239#WA 18ms5368kbC++20817b2024-10-05 15:56:522024-10-05 15:56:54

Judging History

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

  • [2024-10-05 15:56:54]
  • 评测
  • 测评结果:WA
  • 用时:18ms
  • 内存:5368kb
  • [2024-10-05 15:56:52]
  • 提交

answer

#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int k;
    std::cin >> k;
    int n = 1024;
    std::vector<std::pair<int, int>> ed;
    for (int i = 1; i <= n; i++) {
        int p = (i % 2);
        for (int j = 1; j < i; j++) {
            if (j % 2 == p)
                continue;
            ed.emplace_back(i, j);
        }
    }

    int m = ed.size();
    std::cout << n << " " << m << " " << 2 << '\n';
    for (int i = 1; i <= n; i++) {
        if (i & 1) {
            std::cout << 1 << ' ';
        } else {
            std::cout << 2 << ' ';
        }
    }
    std::cout << '\n';
    for (const auto &[x, y] : ed) {
        std::cout << x << " " << y << '\n';
    }

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 18ms
memory: 5368kb

input:

1

output:

1024 262144 2
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ...

result:

wrong answer The graph is not correct