QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#695545#9519. Build a ComputercrazymoonAC ✓1ms3884kbC++202.7kb2024-10-31 20:15:182024-10-31 20:15:21

Judging History

This is the latest submission verdict.

  • [2024-10-31 20:15:21]
  • Judged
  • Verdict: AC
  • Time: 1ms
  • Memory: 3884kb
  • [2024-10-31 20:15:18]
  • Submitted

answer

#include <bits/stdc++.h>
#define int long long
using namespace std;
const double eps = 1e-8;

void solve() {
    int L, R, idx = 0;
    cin >> L >> R;
    
    int tot = 1, dep = 0;
    while(tot - 1 < R)  tot <<= 1, dep++;
    vector<vector<pair<int, int>>> res(100);
    vector<int> ind(100);
    for (int i = 1; i < dep; ++i) {
        res[i].push_back({i + 1, 0});
        res[i].push_back({i + 1, 1});
    }
    idx = dep;

    auto build = [&](auto self, int l, int r, int cur, int fa) -> void {
        if(l >= L && r <= R) {
            ind[dep - cur + 1] += 2;
            if(fa == -1)  ++idx;
            res[idx].push_back({dep - cur + 1, 0});
            res[idx].push_back({dep - cur + 1, 1});
            return ;
        }
        if(cur == 1) {
            ind[dep]++;
            if(fa == -1)  ++idx;
            if(l == R)  res[idx].push_back({dep, 0});
            else  res[idx].push_back({dep, 1});
            return ;
        }
        int cid = idx, mid = l + r >> 1;
        if(fa == -1)  ++idx, cid = idx;
        if(mid >= L) {
            if(cur == dep || fa != -1)  self(self, l, mid, cur - 1, idx);
            else {
                res[cid].push_back({idx + 1, 0});
                self(self, l, mid, cur - 1, -1);
            }
        }
        if(mid < R) {
            res[cid].push_back({idx + 1, 1});
            self(self, mid + 1, r, cur - 1, -1);
        }
    };

    vector<vector<pair<int, int>>> e(100);
    build(build, 0, tot - 1, dep, -1);
    
    vector<vector<int>> ans;
    for (int i = 1, cur = 0; i <= idx; ++i) {
        if(i <= dep && !ind[i]) {
            ++cur;
            continue;
        }
        vector<int> tt;
        tt.push_back(res[i].size());
        for (auto [u, w] : res[i]) {
            e[i - cur].push_back({u - cur, w});
            ind[u]++;
            tt.push_back(u - cur);
            tt.push_back(w);
            cerr << i - cur << ' ' << u - cur << ' ' << w << '\n';
            // if(u <= dep) {
            //     if(i <= dep)  cerr << i - cur << ' ' << u - cur << ' ' << w << '\n';
            //     else  cerr << i << ' ' << u - cur << ' ' << w << '\n';
            // }
            // else {
            //     if(i <= dep)  cerr << i - cur << ' ' << u << ' ' << w << '\n';
            //     else  cerr << i << ' ' << u << ' ' << w << '\n';
            // }
        }
        ans.push_back(tt);
    }

    cout << ans.size() << '\n';
    for (auto u : ans) {
        for (auto v : u)  cout << v << ' ';
        cout << '\n';
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);  cout.tie(0);
    int t = 1;
    while(t--) {
        solve();
    }
    return 0;
}

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

詳細信息

Test #1:

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

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: 1ms
memory: 3856kb

input:

10 27

output:

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

result:

ok ok

Test #3:

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

input:

5 13

output:

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

result:

ok ok

Test #4:

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

input:

1 1000000

output:

62
2 2 0 2 1 
2 3 0 3 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 
0 
20 18 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 3...

result:

ok ok

Test #5:

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

input:

1 1

output:

2
0 
1 1 1 

result:

ok ok

Test #6:

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

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: 3852kb

input:

3 7

output:

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

result:

ok ok

Test #8:

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

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: 3508kb

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: 3560kb

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: 1ms
memory: 3820kb

input:

7 51

output:

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

result:

ok ok

Test #12:

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

input:

51 79

output:

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

result:

ok ok

Test #13:

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

input:

92 99

output:

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

result:

ok ok

Test #14:

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

input:

27 36

output:

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

result:

ok ok

Test #15:

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

input:

55 84

output:

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

result:

ok ok

Test #16:

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

input:

297208 929600

output:

70
2 2 0 2 1 
2 3 0 3 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 
0 
2 20 1 44 1 
2 21 0 43 1 
2 22 0 42 1 
1 23 1 
2 24 0 41 1 
2 25 0 40 1 
2 26 0 39 1 
1 2...

result:

ok ok

Test #17:

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

input:

45728 589156

output:

67
2 2 0 2 1 
2 3 0 3 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 
0 
5 20 1 36 1 37 1 38 1 39 1 
2 21 0 35 1 
1 22 1 
1 23 1 
2 24 0 34 1 
2 25 0 33 1 
1 26 1...

result:

ok ok

Test #18:

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

input:

129152 138000

output:

48
2 2 0 2 1 
2 3 0 3 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 
0 
2 14 1 27 1 
1 15 1 
1 16 1 
1 17 1 
1 18 1 
1 19 1 
2 20 0 26 1 
2 21 0 25 1 
2 22 0 24 1 
1 23 1 
2 6 0 6 1 
2 5 0 5 1 
2 4 0 4 1 
2 3 0 3 1 
1 28 0 
1 29 0 
1 30 0 ...

result:

ok ok

Test #19:

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

input:

245280 654141

output:

68
2 2 0 2 1 
2 3 0 3 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 
0 
3 20 1 37 1 38 1 
1 21 1 
1 22 1 
2 23 0 36 1 
1 24 1 
1 25 1 
1 26 1 
1 27 1 
1 28 1 
2 ...

result:

ok ok

Test #20:

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

input:

202985 296000

output:

63
2 2 0 2 1 
2 3 0 3 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 
0 
2 17 1 43 1 
1 18 1 
2 19 0 42 1 
2 20 0 41 1 
2 21 0 40 1 
1 22 1 
1 23 1 
2 24 0 39 1 
2 25 0 38 1 
2 26 0 37 1 
1 27 1 
1 28 ...

result:

ok ok

Test #21:

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

input:

438671 951305

output:

69
2 2 0 2 1 
2 3 0 3 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 
0 
2 20 1 46 1 
1 21 1 
2 22 0 45 1 
1 23 1 
2 24 0 44 1 
1 25 1 
1 26 1 
2 27 0 43 1 
2 28 ...

result:

ok ok

Test #22:

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

input:

425249 739633

output:

71
2 2 0 2 1 
2 3 0 3 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 
0 
2 19 1 46 1 
1 20 1 
2 21 0 45 1 
2 22 0 44 1 
1 23 1 
1 24 1 
1 25 1 
1 26 1 
1 27 1 
2 28 0 43 1 
1 ...

result:

ok ok

Test #23:

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

input:

551207 961718

output:

75
2 2 0 2 1 
2 3 0 3 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 
0 
1 19 1 
2 20 0 48 1 
2 21 0 47 1 
2 22 0 46 1 
2 23 0 45 1 
1 24 1 
1 25 1 
2 26 0 44 1 
1 27 1 
2 28 ...

result:

ok ok

Test #24:

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

input:

114691 598186

output:

74
2 2 0 2 1 
2 3 0 3 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 
0 
4 20 1 48 1 49 1 50 1 
1 21 1 
1 22 1 
2 23 0 47 1 
2 24 0 46 1 
2 25 0 45 1 
2 26 0 44 1...

result:

ok ok

Test #25:

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

input:

234654 253129

output:

57
2 2 0 2 1 
2 3 0 3 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 
0 
1 15 1 
1 16 1 
1 17 1 
2 18 0 38 1 
2 19 0 37 1 
1 20 1 
2 21 0 36 1 
1 22 1 
2 23 0 35 1 
2 24 0 34 1 
1 25 1 
2 26 0 33 1 
2 27 0 32 1 
1 28 1 
1 29 1 ...

result:

ok ok

Test #26:

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

input:

554090 608599

output:

61
2 2 0 2 1 
2 3 0 3 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 
0 
1 17 1 
1 18 0 
1 19 0 
2 20 0 43 1 
2 21 0 42 1 
1 22 1 
1 23 1 
1 24 1 
2 25 0 41 1 
1 26 1 
2 27 0 40 1 
2 28 0 39 1 
2 29 0 ...

result:

ok ok

Extra Test:

score: 0
Extra Test Passed