QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#606685#8934. Challenge NPCUESTC_NLNS#WA 20ms3632kbC++141.3kb2024-10-03 11:29:292024-10-03 11:29:29

Judging History

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

  • [2024-10-03 11:29:29]
  • 评测
  • 测评结果:WA
  • 用时:20ms
  • 内存:3632kb
  • [2024-10-03 11:29:29]
  • 提交

answer

#include <iostream>
#include <vector>
using namespace std;

const int N = 2e3 + 5;
int cnt = 0;
using pii = pair<int, int>;

void out(int i, int j) {
    cout << i << " " << j << '\n';
    cnt++;
}

int main() {
    int k;
    // freopen("a.out", "w", stdout);
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
    cin >> k;
    int n = 1024;
    vector<int> c1;
    vector<int> c2;
    c1.reserve(n);
    c2.reserve(n);

    cout << n << " 261634 2\n";
    for (int i = 0; i < n; i += 4) {
        cout << "1 2 2 1 ";
        c1.push_back(i + 1);
        c1.push_back(i + 4);
        c2.push_back(i + 2);
        c2.push_back(i + 3);
    }
    cout << '\n';

    for (int i = 1; i <= n; i += 2) {
        int m = n - 1;
        for (int j = i; j > 0; j -= 4) {
            cout << i + 1 << " " << j << '\n';
            cnt++;
            if (j - 1 > 0) {
                cout << i + 1 << " " << j - 1 << '\n';
                cnt++;
            }
        }

        for (int j = i - 2; j > 0; j -= 4) {
            if (j == i - 3) continue;
            cout << i << " " << j << '\n';
            cnt++;
            if (j - 1 > 0) {
                if (j - 1 == i - 3) continue;
                cout << i << " " << j - 1 << '\n';
                cnt++;
            }
        }
    }

    // cout << cnt << '\n';
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 20ms
memory: 3632kb

input:

1

output:

1024 261634 2
1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 1 1 2 2 ...

result:

wrong answer The graph is not correct