QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#755797#9519. Build a ComputerGrand_ElfAC ✓1ms3716kbC++142.7kb2024-11-16 18:03:272024-11-16 18:03:28

Judging History

This is the latest submission verdict.

  • [2024-11-16 18:03:28]
  • Judged
  • Verdict: AC
  • Time: 1ms
  • Memory: 3716kb
  • [2024-11-16 18:03:27]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;

const int N = 105;

int s = 1, t = 2, tot = 2, l, r, now_lv, node[N] = {2};
vector<pair<int, bool> > ans[N];

int create_new(int u, int c) {
    int v = ++tot;
    ans[u].emplace_back(make_pair(v, c));
    return v;
}

int build_st(int lv) {
    if (lv <= now_lv) {
        return node[lv];
    }
    while (now_lv < lv) {
        int u = ++tot;
        ans[u].emplace_back(make_pair(node[now_lv], 0));
        ans[u].emplace_back(make_pair(node[now_lv], 1));
        now_lv++;
        node[now_lv] = u;
    }
    return node[lv];
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> l >> r;
    int hbit = 31 - __builtin_clz(r);
    if (l == r) {
        for (int i = hbit; i > 0; i--) {
            s = create_new(s, r >> i & 1);
        }
        ans[s].emplace_back(make_pair(t, r & 1));
    } else {
        int dbit = hbit;
        while ((l >> dbit & 1) == (r >> dbit & 1)) {
            s = create_new(s, r >> dbit-- & 1);
        }
        if (dbit > 0) {
            int u = create_new(s, 1);
            for (int i = dbit - 1; i > 0; i--) {
                if (r >> i & 1) {
                    ans[u].emplace_back(make_pair(build_st(i), 0));
                    u = create_new(u, 1);
                } else {
                    u = create_new(u, 0);
                }
            }
            if (r & 1) {
                ans[u].emplace_back(make_pair(t, 0));
                ans[u].emplace_back(make_pair(t, 1));
            } else {
                ans[u].emplace_back(make_pair(t, 0));            
            }
            u = s;
            bool ok = dbit < hbit;
            if (ok) {
                u = create_new(u, 0);
            }
            for (int i = dbit - 1; i > 0; i--) {
                if (l >> i & 1) {
                    ok = 1;
                    u = create_new(u, 1);
                } else {
                    ans[u].emplace_back(make_pair(build_st(i), 1));
                    if (ok) {
                        u = create_new(u, 0);
                    }
                }
            }
            if (l & 1) {
                ans[u].emplace_back(make_pair(t, 1));
            } else {
                ans[u].emplace_back(make_pair(t, 0));
                ans[u].emplace_back(make_pair(t, 1));
            }
        } else if (dbit == 0) {
            ans[s].emplace_back(make_pair(t, 0));
            ans[s].emplace_back(make_pair(t, 1));
        }
    }
    cout << tot << '\n';
    for (int i = 1; i <= tot; i++) {
        cout << ans[i].size() << ' ';
        for (auto p : ans[i]) {
            cout << p.first << ' ' << p.second << ' ';
        }
        cout << '\n';
    }

    return 0;
}

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

详细

Test #1:

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

input:

5 7

output:

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

result:

ok ok

Test #2:

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

input:

10 27

output:

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

result:

ok ok

Test #3:

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

input:

5 13

output:

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

result:

ok ok

Test #4:

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

input:

1 1000000

output:

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

result:

ok ok

Test #5:

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

input:

1 1

output:

2
1 2 1 
0 

result:

ok ok

Test #6:

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

input:

7 9

output:

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

result:

ok ok

Test #7:

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

input:

3 7

output:

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

result:

ok ok

Test #8:

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

input:

1 5

output:

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

result:

ok ok

Test #9:

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

input:

1 4

output:

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

result:

ok ok

Test #10:

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

input:

8 9

output:

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

result:

ok ok

Test #11:

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

input:

7 51

output:

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

result:

ok ok

Test #12:

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

input:

51 79

output:

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

result:

ok ok

Test #13:

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

input:

92 99

output:

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

result:

ok ok

Test #14:

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

input:

27 36

output:

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

result:

ok ok

Test #15:

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

input:

55 84

output:

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

result:

ok ok

Test #16:

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

input:

297208 929600

output:

57
2 3 1 40 1 
0 
2 21 0 22 1 
2 2 0 2 1 
2 4 0 4 1 
2 5 0 5 1 
2 6 0 6 1 
2 7 0 7 1 
2 8 0 8 1 
2 9 0 9 1 
2 10 0 10 1 
2 11 0 11 1 
2 12 0 12 1 
2 13 0 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 19 0 19 1 
2 20 0 20 1 
2 20 0 23 1 
1 24 0 
1 25 0 
1 26 0 
2 16 0 27 1 ...

result:

ok ok

Test #17:

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

input:

45728 589156

output:

54
5 3 1 39 1 38 1 37 1 40 1 
0 
1 4 0 
1 5 0 
1 6 0 
2 21 0 22 1 
2 2 0 2 1 
2 7 0 7 1 
2 8 0 8 1 
2 9 0 9 1 
2 10 0 10 1 
2 11 0 11 1 
2 12 0 12 1 
2 13 0 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 19 0 19 1 
2 20 0 20 1 
2 20 0 23 1 
2 19 0 24 1 
2 18 0 25 1 
2 17 0 ...

result:

ok ok

Test #18:

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

input:

129152 138000

output:

47
2 3 1 32 1 
0 
1 4 0 
1 5 0 
1 6 0 
1 7 0 
2 19 0 20 1 
2 2 0 2 1 
2 8 0 8 1 
2 9 0 9 1 
2 10 0 10 1 
2 11 0 11 1 
2 12 0 12 1 
2 13 0 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 18 0 21 1 
1 22 0 
2 16 0 23 1 
2 15 0 24 1 
1 25 0 
1 26 0 
1 27 0 
2 11 0 28 1 
1 29 0 ...

result:

ok ok

Test #19:

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

input:

245280 654141

output:

56
3 3 1 39 1 40 1 
0 
1 4 0 
1 5 0 
2 21 0 22 1 
2 2 0 2 1 
2 6 0 6 1 
2 7 0 7 1 
2 8 0 8 1 
2 9 0 9 1 
2 10 0 10 1 
2 11 0 11 1 
2 12 0 12 1 
2 13 0 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 19 0 19 1 
2 20 0 20 1 
2 20 0 23 1 
2 19 0 24 1 
2 18 0 25 1 
2 17 0 26 1 
...

result:

ok ok

Test #20:

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

input:

202985 296000

output:

52
2 3 1 36 1 
0 
1 4 0 
1 5 0 
2 20 0 21 1 
2 2 0 2 1 
2 6 0 6 1 
2 7 0 7 1 
2 8 0 8 1 
2 9 0 9 1 
2 10 0 10 1 
2 11 0 11 1 
2 12 0 12 1 
2 13 0 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 19 0 19 1 
1 22 0 
1 23 0 
1 24 0 
1 25 0 
2 15 0 26 1 
1 27 0 
1 28 0 
1 29 0 
2...

result:

ok ok

Test #21:

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

input:

438671 951305

output:

57
2 3 1 40 1 
0 
2 21 0 22 1 
2 2 0 2 1 
2 4 0 4 1 
2 5 0 5 1 
2 6 0 6 1 
2 7 0 7 1 
2 8 0 8 1 
2 9 0 9 1 
2 10 0 10 1 
2 11 0 11 1 
2 12 0 12 1 
2 13 0 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 19 0 19 1 
2 20 0 20 1 
2 20 0 23 1 
1 24 0 
2 18 0 25 1 
1 26 0 
1 27 0 ...

result:

ok ok

Test #22:

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

input:

425249 739633

output:

56
2 3 1 39 1 
0 
1 4 0 
2 21 0 22 1 
2 2 0 2 1 
2 5 0 5 1 
2 6 0 6 1 
2 7 0 7 1 
2 8 0 8 1 
2 9 0 9 1 
2 10 0 10 1 
2 11 0 11 1 
2 12 0 12 1 
2 13 0 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 19 0 19 1 
2 20 0 20 1 
2 20 0 23 1 
1 24 0 
2 18 0 25 1 
1 26 0 
1 27 0 
2 1...

result:

ok ok

Test #23:

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

input:

551207 961718

output:

56
1 3 1 
0 
2 4 1 39 0 
2 21 0 22 1 
2 2 0 2 1 
2 5 0 5 1 
2 6 0 6 1 
2 7 0 7 1 
2 8 0 8 1 
2 9 0 9 1 
2 10 0 10 1 
2 11 0 11 1 
2 12 0 12 1 
2 13 0 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 19 0 19 1 
2 20 0 20 1 
1 23 0 
2 19 0 24 1 
1 25 0 
2 17 0 26 1 
1 27 0 
2 1...

result:

ok ok

Test #24:

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

input:

114691 598186

output:

55
4 3 1 39 1 38 1 40 1 
0 
1 4 0 
1 5 0 
2 21 0 22 1 
2 2 0 2 1 
2 6 0 6 1 
2 7 0 7 1 
2 8 0 8 1 
2 9 0 9 1 
2 10 0 10 1 
2 11 0 11 1 
2 12 0 12 1 
2 13 0 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 19 0 19 1 
2 20 0 20 1 
1 23 0 
1 24 0 
2 18 0 25 1 
1 26 0 
1 27 0 
1 ...

result:

ok ok

Test #25:

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

input:

234654 253129

output:

46
1 3 1 
0 
1 4 1 
1 5 1 
2 6 1 32 0 
1 7 0 
2 19 0 20 1 
2 2 0 2 1 
2 8 0 8 1 
2 9 0 9 1 
2 10 0 10 1 
2 11 0 11 1 
2 12 0 12 1 
2 13 0 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 18 0 21 1 
2 17 0 22 1 
1 23 0 
1 24 0 
2 14 0 25 1 
2 13 0 26 1 
1 27 0 
1 28 0 
2 10 0 ...

result:

ok ok

Test #26:

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

input:

554090 608599

output:

52
1 3 1 
0 
1 4 0 
1 5 0 
2 6 1 36 0 
1 7 0 
2 21 0 22 1 
2 2 0 2 1 
2 8 0 8 1 
2 9 0 9 1 
2 10 0 10 1 
2 11 0 11 1 
2 12 0 12 1 
2 13 0 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 19 0 19 1 
2 20 0 20 1 
1 23 0 
1 24 0 
2 18 0 25 1 
1 26 0 
1 27 0 
2 15 0 28 1 
1 29 0 ...

result:

ok ok

Extra Test:

score: 0
Extra Test Passed