QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #693349 | #9519. Build a Computer | 000226# | AC ✓ | 1ms | 3716kb | C++17 | 2.3kb | 2024-10-31 16:00:16 | 2024-10-31 16:00:20 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int l, r, tot=1, vis[105];
vector<pair<int,int> > g[105];
int main() {
ios :: sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>l>>r;
if(l==r) {
int ok=0;
for(int i=20;i>=0;i--) {
if(l&(1<<i)) {
ok=1;
g[tot].push_back({tot+1, 1});
tot++;
}
else if(ok) {
g[tot].push_back({tot+1, 0});
tot++;
}
}
cout<<tot<<endl;
for(int i=1;i<=tot;i++) {
cout<<g[i].size()<<" ";
for(auto tmp:g[i]) {
cout<<tmp.first<<" "<<tmp.second<<" ";
}
cout<<endl;
}
return 0;
}
tot=50;
int ok=0, dif;
for(int i=20;i>=0;i--) {
int x=(l>>i)&1, y=(r>>i)&1;
if(x!=y) {
dif=i;
break;
}
}
for(int i=20;i>dif;i--) {
if(l&(1<<i)) {
ok=1;
g[tot].push_back({tot+1, 1});
tot++;
}
else if(ok) {
g[tot].push_back({tot+1, 0});
tot++;
}
}
int now=tot, flag=tot, flagok=ok, T=100;
int maxn=0;
for(int i=dif;i>=0;i--) {
if(l&(1<<i)) {
if(i) g[now].push_back({tot+1, 1});
else g[now].push_back({T, 1});
ok=1;
tot++;
}
else if(ok) {
if(i) g[now].push_back({tot+1, 0});
else g[now].push_back({T, 0});
if(i<dif) {
maxn=max(maxn, i);
if(i) g[now].push_back({i, 1});
else g[now].push_back({T, 1});
}
tot++;
}
else if(i<dif) {
maxn=max(maxn, i);
if(i) g[now].push_back({i, 1});
else g[now].push_back({T, 1});
}
now=tot;
}
now=flag, ok=flagok;
for(int i=dif;i>=0;i--) {
if(r&(1<<i)) {
if(i) g[now].push_back({tot+1, 1});
else g[now].push_back({T, 1});
ok=1;
if(i<dif) {
maxn=max(maxn, i);
if(i) g[now].push_back({i, 0});
else g[now].push_back({T, 0});
}
tot++;
}
else if(ok) {
if(i) g[now].push_back({tot+1, 0});
else g[now].push_back({T, 0});
tot++;
}
now=tot;
}
for(int i=maxn;i>1;i--) {
g[i].push_back({i-1, 0});
g[i].push_back({i-1, 1});
}
if(maxn) {
g[1].push_back({T,0});
g[1].push_back({T,1});
}
int cnt=0;
for(int i=1;i<=T;i++) {
if(g[i].size()) vis[i]=++cnt;
}
vis[T]=++cnt;
//cout<<vis[T]<<endl;
//cout<<"##"<<endl;
cout<<cnt<<endl;
for(int i=1;i<=T;i++) {
if(!g[i].size()) continue;
cout<<g[i].size()<<" ";
for(auto tmp:g[i]) cout<<vis[tmp.first]<<" "<<tmp.second<<" ";
cout<<endl;
}
cout<<0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3652kb
input:
5 7
output:
5 1 2 1 2 3 0 4 1 1 5 1 2 5 1 5 0 0
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
10 27
output:
12 2 12 0 12 1 2 1 0 1 1 2 2 0 2 1 2 5 1 8 1 2 6 0 2 1 1 7 1 2 12 0 12 1 2 9 1 3 0 1 10 0 2 11 1 1 0 2 12 1 12 0 0
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
5 13
output:
9 2 9 0 9 1 2 1 0 1 1 2 4 1 6 1 2 5 0 1 1 1 9 1 2 7 1 2 0 1 8 0 2 9 1 9 0 0
result:
ok ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
1 1000000
output:
39 2 39 0 39 1 2 1 0 1 1 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 20 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 3 1 2 1 1...
result:
ok ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
1 1
output:
2 1 2 1 0
result:
ok ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
7 9
output:
7 2 2 1 4 1 1 3 1 1 7 1 1 5 0 1 6 0 2 7 1 7 0 0
result:
ok ok
Test #7:
score: 0
Accepted
time: 1ms
memory: 3580kb
input:
3 7
output:
6 2 6 0 6 1 2 3 1 4 1 1 6 1 2 5 1 1 0 2 6 1 6 0 0
result:
ok ok
Test #8:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
1 5
output:
5 2 5 0 5 1 3 1 1 5 1 3 1 1 4 0 2 5 1 5 0 0
result:
ok ok
Test #9:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
1 4
output:
5 2 5 0 5 1 3 1 1 5 1 3 1 1 4 0 1 5 0 0
result:
ok ok
Test #10:
score: 0
Accepted
time: 0ms
memory: 3588kb
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: 3592kb
input:
7 51
output:
13 2 13 0 13 1 2 1 0 1 1 2 2 0 2 1 2 3 0 3 1 4 4 1 3 1 6 1 8 1 1 7 1 1 13 1 2 9 1 4 0 1 10 0 1 11 0 2 12 1 1 0 2 13 1 13 0 0
result:
ok ok
Test #12:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
51 79
output:
16 2 16 0 16 1 2 1 0 1 1 2 2 0 2 1 2 5 1 10 1 1 6 1 2 7 0 3 1 2 8 0 2 1 1 9 1 1 16 1 1 11 0 1 12 0 2 13 1 3 0 2 14 1 2 0 2 15 1 1 0 2 16 1 16 0 0
result:
ok ok
Test #13:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
92 99
output:
14 2 14 0 14 1 1 3 1 2 4 0 9 1 1 5 1 1 6 1 1 7 1 2 8 0 1 1 2 14 0 14 1 1 10 0 1 11 0 1 12 0 2 13 1 1 0 2 14 1 14 0 0
result:
ok ok
Test #14:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
27 36
output:
13 2 13 0 13 1 2 1 0 1 1 2 4 1 8 1 1 5 1 2 6 0 2 1 1 7 1 1 13 1 1 9 0 1 10 0 2 11 1 2 0 1 12 0 1 13 0 0
result:
ok ok
Test #15:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
55 84
output:
17 2 17 0 17 1 2 1 0 1 1 2 2 0 2 1 2 3 0 3 1 2 6 1 11 1 1 7 1 2 8 0 3 1 1 9 1 1 10 1 1 17 1 1 12 0 2 13 1 4 0 1 14 0 2 15 1 2 0 1 16 0 1 17 0 0
result:
ok ok
Test #16:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
297208 929600
output:
57 2 57 0 57 1 2 1 0 1 1 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 20 1 38 1 2 21 0 17 1 2 22 0 16 1 1 23 1 2 24 0 14 1 2 25 0 13 1 2 26 0 1...
result:
ok ok
Test #17:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
45728 589156
output:
54 2 54 0 54 1 2 1 0 1 1 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 5 18 1 17 1 16 1 20 1 35 1 2 21 0 14 1 1 22 1 1 23 1 2 24 0 11 1 2 25 0 10 1...
result:
ok ok
Test #18:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
129152 138000
output:
47 2 47 0 47 1 2 1 0 1 1 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 14 1 30 1 1 15 1 1 16 1 1 17 1 1 18 1 1 19 1 2 20 0 10 1 2 21 0 9 1 2 22 0 8 1 1 23 1 2 24 0 6 1 2 25 0 5 1 2 26 0 4 1 2 27 0 3 1 2 28 0 2 1 2...
result:
ok ok
Test #19:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
245280 654141
output:
56 2 56 0 56 1 2 1 0 1 1 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 3 18 1 20 1 37 1 1 21 1 1 22 1 2 23 0 14 1 1 24 1 1 25 1 1 26 1 1 27 1 1 ...
result:
ok ok
Test #20:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
202985 296000
output:
52 2 52 0 52 1 2 1 0 1 1 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 17 1 34 1 1 18 1 2 19 0 15 1 2 20 0 14 1 2 21 0 13 1 1 22 1 1 23 1 2 24 0 10 1 2 25 0 9 1 2 26 0 8 1 1 27 1 ...
result:
ok ok
Test #21:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
438671 951305
output:
57 2 57 0 57 1 2 1 0 1 1 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 20 1 38 1 1 21 1 2 22 0 16 1 1 23 1 2 24 0 14 1 1 25 1 1 26 1 2 27 0 11 ...
result:
ok ok
Test #22:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
425249 739633
output:
56 2 56 0 56 1 2 1 0 1 1 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 19 1 37 1 1 20 1 2 21 0 16 1 2 22 0 15 1 1 23 1 1 24 1 1 25 1 1 26 1 1 27 1 2 28 0 ...
result:
ok ok
Test #23:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
551207 961718
output:
56 2 56 0 56 1 2 1 0 1 1 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 1 19 1 2 20 0 38 1 2 21 0 17 1 2 22 0 16 1 2 23 0 15 1 1 24 1 1 25 1 2 26 0 12 1 1 27 ...
result:
ok ok
Test #24:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
114691 598186
output:
55 2 55 0 55 1 2 1 0 1 1 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 4 18 1 17 1 20 1 36 1 1 21 1 1 22 1 2 23 0 13 1 2 24 0 12 1 2 25 0 11 1 2 2...
result:
ok ok
Test #25:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
234654 253129
output:
46 2 46 0 46 1 2 1 0 1 1 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 1 15 1 1 16 1 1 17 1 2 18 0 32 1 2 19 0 13 1 1 20 1 2 21 0 11 1 1 22 1 2 23 0 9 1 2 24 0 8 1 1 25 1 2 26 0 6 1 2 27 0 5 1 1 28 1 1 2...
result:
ok ok
Test #26:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
554090 608599
output:
52 2 52 0 52 1 2 1 0 1 1 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 1 17 1 1 18 0 1 19 0 2 20 0 36 1 2 21 0 15 1 1 22 1 1 23 1 1 24 1 2 25 0 11 1 1 26 1 2 27 0 9 1 2 28 0 8 1 2...
result:
ok ok
Extra Test:
score: 0
Extra Test Passed