QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#755111#9519. Build a ComputerANIG#AC ✓1ms3744kbC++142.3kb2024-11-16 16:29:312024-11-16 16:29:32

Judging History

This is the latest submission verdict.

  • [2024-11-16 16:29:32]
  • Judged
  • Verdict: AC
  • Time: 1ms
  • Memory: 3744kb
  • [2024-11-16 16:29:31]
  • Submitted

answer

#include<bits/stdc++.h>

using namespace std;

int L,R;

int k,idx=1;
vector<int> rec[1111];
vector<pair<int,int>> ver[1111];

vector<pair<int,int>> tmp;

void solve(int l,int r,int dep=0,int now=1){
    if(L<=l&&r<=R){
        //cerr<<"at "<<l<<' '<<r<<' '<<dep<<endl;
        if(l!=r) rec[dep].emplace_back(now);
        return ;
    }
    int mid=(l+r)>>1;
    if(L<=mid){
        if(!l){
            if(l!=mid) solve(l,mid,dep+1,now);
            else tmp.emplace_back(now,0);
        }
        else{
            if(l!=mid){
                idx++;
                ver[now].emplace_back(idx,0);
            }else tmp.emplace_back(now,0);
            solve(l,mid,dep+1,idx);
        }
    }
    if(mid<R){
        if(mid+1!=r){
            idx++;
            ver[now].emplace_back(idx,1);
        }else tmp.emplace_back(now,1);
        solve(mid+1,r,dep+1,idx);
    }
}

int main(){

    cin>>L>>R;

    int mx=R+1;
    while((mx&-mx)!=mx) mx++;
    k=__lg(mx);
    cerr<<k<<endl;
    solve(0,mx-1);

    mx=-1;
    for(int i=0; i<1000; i++){
        if(rec[i].size()){
            mx=i;
            break;
        }
    }

    int Lim=-1;
    if(mx==-1){
        Lim=1;
        for(auto pt:tmp){
            ver[pt.first].emplace_back(idx+1,pt.second);
        }
    }
    else{
        Lim=k-mx;
        for(int i=idx+1; i<idx+Lim; i++){
            ver[i].emplace_back(i+1,0);
            ver[i].emplace_back(i+1,1);
        }

        for(int i=0; i<1000; i++){
            for(auto pt:rec[i]){
                ver[pt].emplace_back(idx+i-mx+1,0);
                ver[pt].emplace_back(idx+i-mx+1,1);
            }
        }

        for(auto pt:tmp){
            ver[pt.first].emplace_back(idx+Lim,pt.second);
        }
    }

    int T=0;
    for(int i=1; i<1000; i++){
        if(ver[i].size()){
            T=i;
            for(auto p:ver[i]) T=max(T,p.first);
        }
    }
    assert(T==idx+Lim);

    cout<<T<<'\n';
    for(int i=1; i<=T; i++){
        cout<<ver[i].size()<<' ';
        for(auto pt:ver[i]){
            cout<<pt.first<<' '<<pt.second<<' ';
        }
        cout<<'\n';
    }

    return 0;
}
/*
6 13
4
9
2 2 1 4 1 
1 3 1 
2 9 0 9 1 
2 5 0 6 1 
2 8 0 8 1 
1 7 0 
2 9 0 9 1 
2 9 0 9 1 
0 
*/

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

详细

Test #1:

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

input:

5 7

output:

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

result:

ok ok

Test #2:

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

input:

10 27

output:

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

result:

ok ok

Test #3:

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

input:

5 13

output:

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

result:

ok ok

Test #4:

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

input:

1 1000000

output:

62
20 2 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 62 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...

result:

ok ok

Test #5:

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

input:

1 1

output:

2
1 2 1 
0 

result:

ok ok

Test #6:

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

input:

7 9

output:

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

result:

ok ok

Test #7:

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

input:

3 7

output:

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

result:

ok ok

Test #8:

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

input:

1 5

output:

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

result:

ok ok

Test #9:

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

input:

1 4

output:

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

result:

ok ok

Test #10:

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

input:

8 9

output:

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

result:

ok ok

Test #11:

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

input:

7 51

output:

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

result:

ok ok

Test #12:

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

input:

51 79

output:

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

result:

ok ok

Test #13:

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

input:

92 99

output:

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

result:

ok ok

Test #14:

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

input:

27 36

output:

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

result:

ok ok

Test #15:

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

input:

55 84

output:

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

result:

ok ok

Test #16:

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

input:

297208 929600

output:

70
2 2 1 26 1 
2 3 0 25 1 
2 4 0 24 1 
1 5 1 
2 6 0 23 1 
2 7 0 22 1 
2 8 0 21 1 
1 9 1 
2 10 0 20 1 
2 11 0 19 1 
2 12 0 18 1 
1 13 1 
1 14 1 
1 15 1 
1 16 1 
1 17 1 
2 68 0 68 1 
2 63 0 63 1 
2 62 0 62 1 
2 61 0 61 1 
2 59 0 59 1 
2 58 0 58 1 
2 57 0 57 1 
2 55 0 55 1 
2 54 0 54 1 
2 27 0 28 1 
2 ...

result:

ok ok

Test #17:

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

input:

45728 589156

output:

67
5 2 1 18 1 19 1 20 1 21 1 
2 3 0 17 1 
1 4 1 
1 5 1 
2 6 0 16 1 
2 7 0 15 1 
1 8 1 
2 9 0 14 1 
1 10 1 
2 11 0 13 1 
1 12 1 
2 63 0 63 1 
2 62 0 62 1 
2 60 0 60 1 
2 58 0 58 1 
2 57 0 57 1 
2 54 0 54 1 
2 52 0 52 1 
2 51 0 51 1 
2 50 0 50 1 
1 22 0 
1 23 0 
1 24 0 
2 25 0 26 1 
2 53 0 53 1 
2 27 ...

result:

ok ok

Test #18:

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

input:

129152 138000

output:

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

result:

ok ok

Test #19:

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

input:

245280 654141

output:

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

result:

ok ok

Test #20:

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

input:

202985 296000

output:

63
2 2 1 28 1 
1 3 1 
2 4 0 27 1 
2 5 0 26 1 
2 6 0 25 1 
1 7 1 
1 8 1 
2 9 0 24 1 
2 10 0 23 1 
2 11 0 22 1 
1 12 1 
1 13 1 
1 14 1 
2 15 0 21 1 
1 16 1 
2 17 0 20 1 
2 18 0 19 1 
1 63 1 
2 63 0 63 1 
2 62 0 62 1 
2 60 0 60 1 
2 56 0 56 1 
2 55 0 55 1 
2 54 0 54 1 
2 51 0 51 1 
2 50 0 50 1 
2 49 0 ...

result:

ok ok

Test #21:

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

input:

438671 951305

output:

69
2 2 1 28 1 
1 3 1 
2 4 0 27 1 
1 5 1 
2 6 0 26 1 
1 7 1 
1 8 1 
2 9 0 25 1 
2 10 0 24 1 
2 11 0 23 1 
1 12 1 
1 13 1 
2 14 0 22 1 
2 15 0 21 1 
2 16 0 20 1 
1 17 1 
1 18 1 
1 19 1 
1 69 1 
2 66 0 66 1 
2 65 0 65 1 
2 64 0 64 1 
2 61 0 61 1 
2 60 0 60 1 
2 59 0 59 1 
2 56 0 56 1 
2 54 0 54 1 
2 29...

result:

ok ok

Test #22:

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

input:

425249 739633

output:

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

result:

ok ok

Test #23:

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

input:

551207 961718

output:

75
1 2 1 
2 3 0 31 1 
2 4 0 30 1 
2 5 0 29 1 
2 6 0 28 1 
1 7 1 
1 8 1 
2 9 0 27 1 
1 10 1 
2 11 0 26 1 
2 12 0 25 1 
1 13 1 
2 14 0 24 1 
2 15 0 23 1 
1 16 1 
2 17 0 22 1 
2 18 0 21 1 
1 19 1 
1 20 1 
1 75 1 
2 73 0 73 1 
2 72 0 72 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 ...

result:

ok ok

Test #24:

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

input:

114691 598186

output:

74
4 2 1 30 1 31 1 32 1 
1 3 1 
1 4 1 
2 5 0 29 1 
2 6 0 28 1 
2 7 0 27 1 
2 8 0 26 1 
2 9 0 25 1 
2 10 0 24 1 
2 11 0 23 1 
2 12 0 22 1 
2 13 0 21 1 
2 14 0 20 1 
2 15 0 19 1 
2 16 0 18 1 
1 17 1 
1 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 6...

result:

ok ok

Test #25:

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

input:

234654 253129

output:

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

result:

ok ok

Test #26:

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

input:

554090 608599

output:

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

result:

ok ok

Extra Test:

score: 0
Extra Test Passed