QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#253116#6319. Parallel Processing (Easy)std_absWA 1ms3560kbC++203.1kb2023-11-16 18:13:342023-11-16 18:13:34

Judging History

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

  • [2023-11-16 18:13:34]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3560kb
  • [2023-11-16 18:13:34]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 200005;

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int n;
    cin >> n;
    cout << n << endl;
    if (n <= 2) {
        cout << "1\n";
        cout << "2 1 2\n";
        cout << "2000 2000 2000\n";
        cout << "2000 2000 2000\n";
        cout << "2000 2000 2000\n";
    } else if (n <= 4) {
        cout << "2\n";
        cout << "2 1 2\n";
        cout << "4 3 4\n";
        cout << "2000 2000 2000\n";
        cout << "2000 2000 2000\n";
        cout << "3 2 3\n";
        cout << "4 2 4\n";
        cout << "2000 2000 2000\n";
        cout << "2000 2000 2000\n";
    } else if (n <= 8) {
        cout << "3\n";
        cout << "2 1 2\n";
        cout << "4 3 4\n";
        cout << "6 5 6\n";
        cout << "8 7 8\n";
        cout << "3 2 3\n";
        cout << "4 2 4\n";
        cout << "7 6 7\n";
        cout << "8 6 8\n";
        cout << "5 4 5\n";
        cout << "6 4 6\n";
        cout << "7 4 7\n";
        cout << "8 4 8\n";
    } else if (n <= 11) {
        cout << "4\n";
        cout << "2 1 2\n";
        cout << "4 3 4\n";
        cout << "6 5 6\n";
        cout << "9 8 9\n";
        cout << "3 2 3\n";
        cout << "4 2 4\n";
        cout << "7 6 7\n";
        cout << "10 9 10\n";
        cout << "5 4 5\n";
        cout << "6 4 6\n";
        cout << "7 4 7\n";
        cout << "11 10 11\n";
        cout << "8 7 8\n";
        cout << "9 7 9\n";
        cout << "10 7 10\n";
        cout << "11 7 11\n";
    } else if (n <= 13) {
        cout << "5\n";
        cout << "2 1 2\n";
        cout << "5 4 5\n";
        cout << "7 6 7\n";
        cout << "11 10 11\n";
        cout << "3 2 3\n";
        cout << "8 7 8\n";
        cout << "12 11 12\n";
        cout << "2000 2000 2000\n";
        cout << "4 3 4\n";
        cout << "5 3 5\n";
        cout << "9 8 9\n";
        cout << "13 12 13\n";
        cout << "6 5 6\n";
        cout << "7 5 7\n";
        cout << "8 5 8\n";
        cout << "9 5 9\n";
        cout << "10 9 10\n";
        cout << "11 9 11\n";
        cout << "12 9 12\n";
        cout << "13 9 13\n";
    } else if (n <= 16) {
        cout << "6\n";
        cout << "2 1 2\n";
        cout << "6 5 6\n";
        cout << "10 9 10\n";
        cout << "14 13 14\n";
        cout << "3 2 3\n";
        cout << "7 6 7\n";
        cout << "11 10 11\n";
        cout << "15 14 15\n";
        cout << "4 3 4\n";
        cout << "8 7 8\n";
        cout << "12 11 12\n";
        cout << "16 15 16\n";
        cout << "5 4 5\n";
        cout << "6 4 6\n";
        cout << "7 4 7\n";
        cout << "8 4 8\n";
        cout << "9 8 9\n";
        cout << "10 8 10\n";
        cout << "11 8 11\n";
        cout << "12 8 12\n";
        cout << "13 12 13\n";
        cout << "14 12 14\n";
        cout << "15 12 15\n";
        cout << "16 12 16\n";
    }
}

详细

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3560kb

input:

2

output:

2
1
2 1 2
2000 2000 2000
2000 2000 2000
2000 2000 2000

result:

wrong answer L = 2 is larger than 1