QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#691311#9519. Build a ComputerIllusionaryDominanceAC ✓0ms3708kbC++201.8kb2024-10-31 10:54:332024-10-31 10:54:35

Judging History

This is the latest submission verdict.

  • [2024-10-31 10:54:35]
  • Judged
  • Verdict: AC
  • Time: 0ms
  • Memory: 3708kb
  • [2024-10-31 10:54:33]
  • Submitted

answer

#include <bits/stdc++.h>

using namespace std;
using vi = vector <int>;
using pii = pair <int, int>;
using vp = vector <pii>;

const int MAX_N = 100 + 5;

int N, M, t;
vi todo[MAX_N];
vp edge[MAX_N];

void segment_build(int i, int l, int r, int ql, int qr, int k, int gr, int b) {
    int u = -1;
    if (k && l < r)  {
        u = ++ N;
        edge[gr].emplace_back(u, i & 1);
        gr = u;
    }
    if (l < ql || r > qr) {
        int mid = l + r >> 1;
        if (ql <= mid) segment_build(i << 1, l, mid, ql, qr, k, gr, b - 1);
        if (mid < qr) segment_build(i << 1 | 1, mid + 1, r, ql, qr, 1, gr, b - 1);
    }else {
        assert(k && b >= 0);
        M = max(M, b);
        if (b) {
            todo[b].push_back(u);
        }else {
            assert(l == r);
            edge[gr].emplace_back(t, i & 1);
        }
        return ;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int l, r;
    cin >> l >> r;
    segment_build(t = 1, 0, (1 << 20) - 1, l, r, 0, N = 2, 20);
    for (int i = 1; i < M - 1; i ++) {
        edge[N + i].emplace_back(N + i + 1, 0);
        edge[N + i].emplace_back(N + i + 1, 1);
    }
    if (M > 1) {
        int x = N + M - 1;
        edge[x].emplace_back(t, 0);
        edge[x].emplace_back(t, 1);
    }
    for (auto x : todo[1]) {
        edge[x].emplace_back(t, 0);
        edge[x].emplace_back(t, 1);
    }
    for (int i = 2; i <= M; i ++) {
        for (auto x : todo[i]) {
            edge[x].emplace_back(N + M + 1 - i, 0);
            edge[x].emplace_back(N + M + 1 - i, 1);
        }
    }
    int n = N + max(0, M - 1);
    cout << n << '\n';
    for (int i = 1; i <= n; i ++) {
        cout << edge[i].size();
        for (auto [x, y] : edge[i]) cout << ' ' << x << ' ' << y;
        cout << '\n';
    }
    return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

5 7

output:

5
0
1 3 1
2 4 0 5 1
1 1 1
2 1 0 1 1

result:

ok ok

Test #2:

score: 0
Accepted
time: 0ms
memory: 3656kb

input:

10 27

output:

12
0
2 3 1 7 1
2 4 0 6 1
1 5 1
2 1 0 1 1
2 12 0 12 1
2 8 0 9 1
2 11 0 11 1
1 10 0
2 12 0 12 1
2 12 0 12 1
2 1 0 1 1

result:

ok ok

Test #3:

score: 0
Accepted
time: 0ms
memory: 3592kb

input:

5 13

output:

10
0
2 3 1 6 1
2 4 0 5 1
1 1 1
2 1 0 1 1
2 7 0 8 1
2 10 0 10 1
1 9 0
2 1 0 1 1
2 1 0 1 1

result:

ok ok

Test #4:

score: 0
Accepted
time: 0ms
memory: 3652kb

input:

1 1000000

output:

62
0
20 1 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1
2 1 0 1 1
2 62 0 62 1
2 61 0 61 1
2 60 0 60 1
2 59 0 59 1
2 58 0 58 1
2 57 0 57 1
2 56 0 56 1
2 55 0 55 1
2 54 0 54 1
2 53 0 53 1
2 52 0 52 1
2 51 0 51 1
2 50 0 50 1
2 49 0 49 1
2 48 0 48 1
2 47 0 47 ...

result:

ok ok

Test #5:

score: 0
Accepted
time: 0ms
memory: 3592kb

input:

1 1

output:

2
0
1 1 1

result:

ok ok

Test #6:

score: 0
Accepted
time: 0ms
memory: 3652kb

input:

7 9

output:

7
0
2 3 1 5 1
1 4 1
1 1 1
1 6 0
1 7 0
2 1 0 1 1

result:

ok ok

Test #7:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

3 7

output:

5
0
2 3 1 4 1
1 1 1
2 5 0 5 1
2 1 0 1 1

result:

ok ok

Test #8:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

1 5

output:

5
0
3 1 1 3 1 4 1
2 1 0 1 1
1 5 0
2 1 0 1 1

result:

ok ok

Test #9:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

1 4

output:

5
0
3 1 1 3 1 4 1
2 1 0 1 1
1 5 0
1 1 0

result:

ok ok

Test #10:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

8 9

output:

5
0
1 3 1
1 4 0
1 5 0
2 1 0 1 1

result:

ok ok

Test #11:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

7 51

output:

14
0
4 3 1 5 1 6 1 7 1
1 4 1
1 1 1
2 13 0 13 1
2 12 0 12 1
2 8 0 9 1
2 12 0 12 1
1 10 0
1 11 0
2 14 0 14 1
2 13 0 13 1
2 14 0 14 1
2 1 0 1 1

result:

ok ok

Test #12:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

51 79

output:

15
0
2 3 1 10 1
1 4 1
2 5 0 9 1
2 6 0 8 1
1 7 1
1 1 1
2 15 0 15 1
2 14 0 14 1
1 11 0
1 12 0
2 13 0 13 1
2 14 0 14 1
2 15 0 15 1
2 1 0 1 1

result:

ok ok

Test #13:

score: 0
Accepted
time: 0ms
memory: 3644kb

input:

92 99

output:

12
0
1 3 1
2 4 0 8 1
1 5 1
1 6 1
1 7 1
2 12 0 12 1
1 9 0
1 10 0
1 11 0
2 12 0 12 1
2 1 0 1 1

result:

ok ok

Test #14:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

27 36

output:

14
0
2 3 1 8 1
1 4 1
2 5 0 7 1
1 6 1
1 1 1
2 14 0 14 1
1 9 0
1 10 0
2 11 0 12 1
2 14 0 14 1
1 13 0
1 1 0
2 1 0 1 1

result:

ok ok

Test #15:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

55 84

output:

19
0
2 3 1 9 1
1 4 1
2 5 0 8 1
1 6 1
1 7 1
1 1 1
2 18 0 18 1
1 10 0
2 11 0 12 1
2 17 0 17 1
1 13 0
2 14 0 15 1
2 19 0 19 1
1 16 0
1 1 0
2 18 0 18 1
2 19 0 19 1
2 1 0 1 1

result:

ok ok

Test #16:

score: 0
Accepted
time: 0ms
memory: 3592kb

input:

297208 929600

output:

70
0
2 3 1 27 1
2 4 0 26 1
2 5 0 25 1
1 6 1
2 7 0 24 1
2 8 0 23 1
2 9 0 22 1
1 10 1
2 11 0 21 1
2 12 0 20 1
2 13 0 19 1
1 14 1
1 15 1
1 16 1
1 17 1
1 18 1
2 69 0 69 1
2 64 0 64 1
2 63 0 63 1
2 62 0 62 1
2 60 0 60 1
2 59 0 59 1
2 58 0 58 1
2 56 0 56 1
2 55 0 55 1
2 28 0 29 1
2 54 0 54 1
2 30 0 31 1
2...

result:

ok ok

Test #17:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

45728 589156

output:

67
0
5 3 1 19 1 20 1 21 1 22 1
2 4 0 18 1
1 5 1
1 6 1
2 7 0 17 1
2 8 0 16 1
1 9 1
2 10 0 15 1
1 11 1
2 12 0 14 1
1 13 1
2 64 0 64 1
2 63 0 63 1
2 61 0 61 1
2 59 0 59 1
2 58 0 58 1
2 55 0 55 1
2 53 0 53 1
2 52 0 52 1
2 51 0 51 1
1 23 0
1 24 0
1 25 0
2 26 0 27 1
2 54 0 54 1
2 28 0 29 1
2 55 0 55 1
2 3...

result:

ok ok

Test #18:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

129152 138000

output:

48
0
2 3 1 16 1
1 4 1
1 5 1
1 6 1
1 7 1
1 8 1
2 9 0 15 1
2 10 0 14 1
2 11 0 13 1
1 12 1
2 43 0 43 1
2 42 0 42 1
2 41 0 41 1
2 40 0 40 1
1 17 0
1 18 0
1 19 0
1 20 0
2 21 0 22 1
2 38 0 38 1
2 23 0 24 1
2 39 0 39 1
1 25 0
2 26 0 27 1
2 41 0 41 1
2 28 0 29 1
2 42 0 42 1
1 30 0
1 31 0
1 32 0
2 33 0 34 1
...

result:

ok ok

Test #19:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

245280 654141

output:

68
0
3 3 1 20 1 21 1
1 4 1
1 5 1
2 6 0 19 1
1 7 1
1 8 1
1 9 1
1 10 1
1 11 1
2 12 0 18 1
2 13 0 17 1
2 14 0 16 1
1 15 1
2 65 0 65 1
2 64 0 64 1
2 63 0 63 1
2 62 0 62 1
2 56 0 56 1
2 52 0 52 1
1 22 0
1 23 0
2 24 0 25 1
2 54 0 54 1
2 26 0 27 1
2 55 0 55 1
2 28 0 29 1
2 56 0 56 1
2 30 0 31 1
2 57 0 57 1...

result:

ok ok

Test #20:

score: 0
Accepted
time: 0ms
memory: 3644kb

input:

202985 296000

output:

63
0
2 3 1 29 1
1 4 1
2 5 0 28 1
2 6 0 27 1
2 7 0 26 1
1 8 1
1 9 1
2 10 0 25 1
2 11 0 24 1
2 12 0 23 1
1 13 1
1 14 1
1 15 1
2 16 0 22 1
1 17 1
2 18 0 21 1
2 19 0 20 1
1 1 1
2 1 0 1 1
2 63 0 63 1
2 61 0 61 1
2 57 0 57 1
2 56 0 56 1
2 55 0 55 1
2 52 0 52 1
2 51 0 51 1
2 50 0 50 1
1 30 0
1 31 0
2 32 0 ...

result:

ok ok

Test #21:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

438671 951305

output:

69
0
2 3 1 29 1
1 4 1
2 5 0 28 1
1 6 1
2 7 0 27 1
1 8 1
1 9 1
2 10 0 26 1
2 11 0 25 1
2 12 0 24 1
1 13 1
1 14 1
2 15 0 23 1
2 16 0 22 1
2 17 0 21 1
1 18 1
1 19 1
1 20 1
1 1 1
2 67 0 67 1
2 66 0 66 1
2 65 0 65 1
2 62 0 62 1
2 61 0 61 1
2 60 0 60 1
2 57 0 57 1
2 55 0 55 1
2 30 0 31 1
2 53 0 53 1
2 32 ...

result:

ok ok

Test #22:

score: 0
Accepted
time: 0ms
memory: 3708kb

input:

425249 739633

output:

71
0
2 3 1 30 1
1 4 1
2 5 0 29 1
2 6 0 28 1
1 7 1
1 8 1
1 9 1
1 10 1
1 11 1
2 12 0 27 1
1 13 1
2 14 0 26 1
2 15 0 25 1
1 16 1
2 17 0 24 1
2 18 0 23 1
2 19 0 22 1
2 20 0 21 1
1 1 1
2 1 0 1 1
2 71 0 71 1
2 70 0 70 1
2 69 0 69 1
2 67 0 67 1
2 66 0 66 1
2 64 0 64 1
2 58 0 58 1
2 57 0 57 1
1 31 0
2 32 0 ...

result:

ok ok

Test #23:

score: 0
Accepted
time: 0ms
memory: 3560kb

input:

551207 961718

output:

75
0
1 3 1
2 4 0 32 1
2 5 0 31 1
2 6 0 30 1
2 7 0 29 1
1 8 1
1 9 1
2 10 0 28 1
1 11 1
2 12 0 27 1
2 13 0 26 1
1 14 1
2 15 0 25 1
2 16 0 24 1
1 17 1
2 18 0 23 1
2 19 0 22 1
1 20 1
1 21 1
1 1 1
2 74 0 74 1
2 73 0 73 1
2 71 0 71 1
2 70 0 70 1
2 68 0 68 1
2 67 0 67 1
2 65 0 65 1
2 62 0 62 1
2 61 0 61 1
...

result:

ok ok

Test #24:

score: 0
Accepted
time: 0ms
memory: 3708kb

input:

114691 598186

output:

74
0
4 3 1 31 1 32 1 33 1
1 4 1
1 5 1
2 6 0 30 1
2 7 0 29 1
2 8 0 28 1
2 9 0 27 1
2 10 0 26 1
2 11 0 25 1
2 12 0 24 1
2 13 0 23 1
2 14 0 22 1
2 15 0 21 1
2 16 0 20 1
2 17 0 19 1
1 18 1
1 1 1
2 74 0 74 1
2 73 0 73 1
2 72 0 72 1
2 71 0 71 1
2 70 0 70 1
2 69 0 69 1
2 68 0 68 1
2 67 0 67 1
2 66 0 66 1
2...

result:

ok ok

Test #25:

score: 0
Accepted
time: 0ms
memory: 3656kb

input:

234654 253129

output:

57
0
1 3 1
1 4 1
1 5 1
2 6 0 26 1
2 7 0 25 1
1 8 1
2 9 0 24 1
1 10 1
2 11 0 23 1
2 12 0 22 1
1 13 1
2 14 0 21 1
2 15 0 20 1
1 16 1
1 17 1
1 18 1
1 19 1
2 1 0 1 1
2 54 0 54 1
2 53 0 53 1
2 51 0 51 1
2 50 0 50 1
2 48 0 48 1
2 46 0 46 1
1 27 0
2 28 0 29 1
2 47 0 47 1
2 30 0 31 1
2 48 0 48 1
2 32 0 33 1...

result:

ok ok

Test #26:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

554090 608599

output:

61
0
1 3 1
1 4 0
1 5 0
2 6 0 29 1
2 7 0 28 1
1 8 1
1 9 1
1 10 1
2 11 0 27 1
1 12 1
2 13 0 26 1
2 14 0 25 1
2 15 0 24 1
1 16 1
1 17 1
2 18 0 23 1
1 19 1
2 20 0 22 1
1 21 1
2 1 0 1 1
2 61 0 61 1
2 59 0 59 1
2 56 0 56 1
2 55 0 55 1
2 54 0 54 1
2 52 0 52 1
2 48 0 48 1
1 30 0
2 31 0 32 1
2 49 0 49 1
1 33...

result:

ok ok

Extra Test:

score: 0
Extra Test Passed