QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#100125#6319. Parallel Processing (Easy)tikhon#WA 2ms3436kbC++172.9kb2023-04-24 19:00:342023-04-24 19:00:38

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-04-24 19:00:38]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3436kb
  • [2023-04-24 19:00:34]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;

    if (n <= 2) {
        cout << "1\n"\
                "2 1 2\n"\
                "3 3 3\n"\
                "3 3 3\n"\
                "3 3 3\n";
    } else if (n <= 4) {
        cout << "2\n"\
                "2 1 2"\
                "4 3 4"\
                "5 5 5"\
                "5 5 5"\
                "3 2 3"\
                "4 2 4"\
                "5 5 5"\
                "5 5 5";
    } else if (n <= 8) {
        cout << "3\n"\
                "2 1 2\n"\
                "4 3 4\n"\
                "6 5 6\n"\
                "8 7 8\n"\

                "4 2 4\n"\
                "8 6 8\n"\
                "7 6 7\n"\
                "3 2 3\n"\
                
                "8 4 8\n"\
                "7 4 7\n"\
                "6 4 6\n"\
                "5 4 5\n";
    } else if (n <= 11) {
        cout << "4\n"\
                "2 1 2\n"\
                "4 3 4\n"\
                "6 5 6\n"\
                "8 7 8\n"\

                "4 2 4\n"\
                "8 6 8\n"\
                "3 2 3\n"\
                "10 9 10\n"\

                "5 4 5\n"\
                "6 4 6\n"\
                "11 10 11\n"\
                "8 4 8\n"\

                "7 6 7\n"\
                "9 8 9\n"\
                "10 8 10\n"\
                "11 8 11\n";            
    } else if (n <= 13) {
        cout << "5\n"\
                "2 1 2\n"\
                "4 3 4\n"\
                "6 5 6\n"\
                "8 7 8\n"\

                "4 2 4\n"\
                "8 6 8\n"\
                "10 9 10\n"\
                "12 11 12\n"\

                "8 4 8\n"\
                "12 10 12\n"\
                "5 4 5\n"\
                "3 2 3\n"\

                "9 8 9\n"\
                "10 8 10\n"\
                "12 8 12\n"\
                "6 4 6\n"\

                "11 10 11\n"\
                "13 12 13\n"\
                "7 6 7\n"\
                "20 20 20\n";
    } else if (n <= 16) {
        cout << "6\n"\
                "2 1 2\n"\
                "4 3 4\n"\
                "6 5 6\n"\
                "8 7 8\n"\

                "4 2 4\n"\
                "8 6 8\n"\
                "10 9 10\n"\
                "12 11 12\n"\

                "8 4 8\n"\
                "5 4 5\n"\
                "6 4 6\n"\
                "12 10 12\n"\

                "9 8 9\n"\
                "7 6 7\n"\
                "14 13 14\n"\
                "12 8 12\n"\

                "10 8 10\n"\
                "16 15 16\n"\
                "13 12 13\n"\
                "14 12 14\n"\

                "11 10 11\n"\
                "3 2 3\n"\
                "15 14 15\n"\
                "16 14 16\n";
    }

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3436kb

input:

2

output:

1
2 1 2
3 3 3
3 3 3
3 3 3

result:

ok AC

Test #2:

score: -100
Wrong Answer
time: 2ms
memory: 3384kb

input:

4

output:

2
2 1 24 3 45 5 55 5 53 2 34 2 45 5 55 5 5

result:

wrong output format Unexpected end of file - int32 expected