QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#423077 | #1963. Squid Game | qwqwf | AC ✓ | 0ms | 3712kb | C++14 | 806b | 2024-05-27 21:02:03 | 2024-05-27 21:02:03 |
Judging History
answer
#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define MP make_pair
#define fi first
#define se second
using namespace std;
int id[4],v[4];
vector<pii> ans;
void calc(){
int k=v[2]/v[1],r=v[2]%v[1];
for(int i=0;v[2]!=r;i++){
if(k>>i&1) ans.pb(MP(id[2],id[1])),v[2]-=v[1],v[1]*=2;
else ans.pb(MP(id[3],id[1])),v[3]-=v[1],v[1]*=2;
}
}
signed main(){
// freopen("a.in","r",stdin);
// freopen("a.out","w",stdout);
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>v[1]>>v[2]>>v[3];
id[1]=1;id[2]=2;id[3]=3;
while(true){
if(v[1]>v[2]) swap(v[1],v[2]),swap(id[1],id[2]);
if(v[2]>v[3]) swap(v[2],v[3]),swap(id[2],id[3]);
if(!v[1]) break;
calc();
}
cout<<ans.size()<<'\n';
for(pii x:ans) cout<<x.fi<<' '<<x.se<<'\n';
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
input:
1 2 3
output:
2 3 1 2 1
result:
ok good plan
Test #2:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
1 4 6
output:
3 3 1 3 1 2 1
result:
ok good plan
Test #3:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
3 4 8
output:
4 2 1 3 2 1 2 1 2
result:
ok good plan
Test #4:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
2 5 8
output:
5 3 1 2 1 1 2 3 2 3 2
result:
ok good plan
Test #5:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
3 8 12
output:
8 3 1 2 1 1 2 1 2 3 2 2 3 1 3 1 3
result:
ok good plan
Test #6:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
5 9 13
output:
10 2 1 3 2 1 2 2 1 2 1 3 1 1 3 2 3 1 3 2 3
result:
ok good plan
Test #7:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
4 15 26
output:
10 2 1 2 1 1 2 3 2 1 2 2 1 2 1 3 1 2 1 3 1
result:
ok good plan
Test #8:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
8 27 46
output:
16 2 1 2 1 3 2 1 2 3 2 1 2 3 1 3 1 3 1 3 1 2 3 2 3 2 3 2 3 2 3 1 3
result:
ok good plan
Test #9:
score: 0
Accepted
time: 0ms
memory: 3700kb
input:
27 35 43
output:
13 2 1 3 2 1 2 3 2 2 3 2 3 1 3 1 3 2 1 2 1 2 1 3 1 3 1
result:
ok good plan
Test #10:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
8 35 62
output:
12 3 1 3 1 2 1 1 2 1 2 3 2 3 2 1 3 1 3 1 3 2 3 2 3
result:
ok good plan
Test #11:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
66 95 98
output:
23 2 1 3 2 3 2 1 3 2 3 1 3 2 3 3 2 3 2 1 2 1 2 2 1 2 1 3 1 3 1 2 1 1 2 3 2 1 2 1 2 1 2 3 2 3 2
result:
ok good plan
Test #12:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
109 167 289
output:
25 2 1 1 2 1 2 2 1 3 1 2 1 1 2 1 2 1 2 1 2 3 2 1 3 1 3 2 3 2 3 1 3 3 1 3 1 2 1 3 1 2 1 3 1 3 1 3 1 2 1
result:
ok good plan
Test #13:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
269 380 398
output:
28 2 1 3 2 3 2 1 3 2 3 2 3 3 2 3 2 3 2 1 2 3 1 3 1 2 3 2 3 2 3 1 3 3 1 2 1 2 1 3 1 3 1 2 3 2 3 2 3 2 3 2 3 1 3 1 3
result:
ok good plan
Test #14:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
233 364 480
output:
22 2 1 1 2 1 2 2 1 3 1 3 1 1 3 2 3 1 3 2 3 3 2 3 2 1 2 1 2 3 1 3 1 3 1 2 1 2 1 2 1 2 1 2 1
result:
ok good plan
Test #15:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
1098 1376 1489
output:
48 2 1 3 2 1 2 3 2 2 3 2 3 2 3 2 3 1 3 2 1 3 1 2 1 2 1 1 2 3 2 3 2 3 2 1 2 3 2 1 2 2 1 3 1 3 1 2 1 2 1 3 1 3 1 3 1 2 1 1 2 3 2 1 2 1 2 3 2 1 2 3 2 3 2 3 2 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 2 3 2 3
result:
ok good plan
Test #16:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
10035 10338 10444
output:
81 2 1 1 2 3 2 1 2 1 2 1 2 3 2 1 3 1 3 1 3 1 3 2 3 2 3 1 3 2 1 3 1 3 1 3 1 3 1 3 1 2 1 2 1 1 2 1 2 1 2 3 2 1 2 1 2 3 2 3 2 3 2 1 3 2 3 1 3 2 3 1 3 2 3 1 3 1 3 1 3 2 3 1 3 3 1 2 1 3 1 3 1 2 1 3 1 3 1 3 1 3 1 3 1 3 1 2 1 3 2 3 2 3 2 3 2 1 2 3 2 1 2 1 2 1 2 1 2 3 2 1 2 3 2 2 3 2 3 2 3 2 3 2 3 1 3 1 3 2...
result:
ok good plan
Test #17:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
100010 100200 100227
output:
75 2 1 3 2 3 2 3 2 3 2 1 2 1 2 1 2 1 2 1 2 3 2 2 3 1 3 2 3 2 3 2 3 2 3 1 3 2 3 2 3 2 3 1 3 3 1 2 1 3 1 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 1 2 1 2 1 2 3 2 3 2 1 2 1 2 1 2 3 2 3 2 1 2 1 2 2 1 2 1 3 1 2 1 2 1 3 1 2 1 2 1 3 1 2 1 2 1 3 1 3 1 3 1 2 1 1 2 3 2 3 2 1 2 1 2 1 2 1 2 3 2 1 2 1 2 3 2 3 2 3 2 1 2 3 2
result:
ok good plan
Test #18:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
1000000 1000235 1000288
output:
75 2 1 1 2 1 2 1 2 1 2 1 2 3 2 1 2 3 2 1 2 1 2 1 2 1 2 3 2 2 3 2 3 2 3 2 3 1 3 2 3 1 3 1 3 2 3 2 3 2 3 2 3 2 3 1 3 2 1 2 1 3 1 2 1 3 1 3 1 3 1 3 1 2 1 2 1 2 1 2 1 3 1 2 1 1 2 1 2 3 2 1 2 1 2 3 2 3 2 1 2 1 2 1 2 3 2 3 2 3 2 3 2 1 2 2 1 2 1 2 1 3 1 3 1 2 1 2 1 3 1 3 1 2 1 3 1 3 1 2 1 3 1 3 1 2 1 3 1 3 1
result:
ok good plan
Test #19:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
10000011 10000314 10000358
output:
200 2 1 1 2 1 2 3 2 3 2 1 2 3 2 3 2 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3 2 1 3 2 3 2 3 2 3 2 3 1 3 1 3 2 3 1 3 1 3 1 3 1 3 2 3 2 3 2 3 2 3 1 3 2 1 2 1 2 1 3 1 2 1 2 1 3 1 2 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 3 1 3 1 2 1 3 2 3 2 3 2 1 2 1 2 1 2 1 2 1 2 3 2 3 2 3 2 1 2 3 2 3 2 3 2 3 2 1 2 1 2 3 2 2 3 2 3 1 3 ...
result:
ok good plan
Test #20:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
100000057 100000244 100000402
output:
119 2 1 3 2 1 2 1 2 3 2 1 2 3 2 3 2 3 2 1 2 1 2 1 2 3 2 1 2 3 2 1 2 1 2 1 2 1 2 1 2 3 2 2 3 1 3 1 3 2 3 2 3 1 3 1 3 1 3 2 3 2 3 2 3 2 3 1 3 1 3 2 3 1 3 2 3 2 3 2 3 2 3 1 3 2 1 3 1 3 1 2 1 3 1 3 1 2 1 3 1 3 1 2 1 2 1 3 1 3 1 3 1 2 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 2 1 3 2 1 2 1 2 3 2 1 2 3 2 3 2 ...
result:
ok good plan
Test #21:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
1 1000000 1000000000
output:
20 3 1 3 1 3 1 3 1 3 1 3 1 2 1 3 1 3 1 2 1 3 1 3 1 3 1 3 1 2 1 3 1 2 1 2 1 2 1 2 1
result:
ok good plan
Test #22:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
1024 65536 536870912
output:
7 3 1 3 1 3 1 3 1 3 1 3 1 2 1
result:
ok good plan
Test #23:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
6 268435456 536870912
output:
53 3 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 3 1 2 1 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 1 2 1 2
result:
ok good plan
Test #24:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
7 16777217 536870909
output:
46 2 1 3 1 3 1 2 1 3 1 3 1 2 1 3 1 3 1 2 1 3 1 3 1 2 1 3 1 3 1 2 1 3 1 3 1 2 1 3 1 3 1 2 1 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 1 2 1 2 1 2
result:
ok good plan
Test #25:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
24223 44594 72242
output:
50 2 1 3 2 1 2 2 1 3 1 3 1 2 3 1 3 2 3 1 3 3 1 3 1 3 1 2 1 1 2 1 2 3 2 3 2 2 3 1 3 2 3 1 3 2 3 1 2 1 2 3 2 3 2 1 2 1 2 1 2 1 2 3 1 3 1 3 1 3 1 3 1 3 1 2 1 3 1 2 1 3 2 3 2 3 2 1 2 1 2 3 2 1 2 1 2 1 2 1 2
result:
ok good plan
Test #26:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
123441 146831 150393
output:
113 2 1 1 2 3 2 3 2 1 3 2 3 1 3 1 3 2 3 1 2 1 2 1 2 1 2 2 1 2 1 3 1 2 1 2 1 2 1 3 1 3 1 2 1 1 2 1 2 3 2 3 2 3 2 3 2 1 2 3 2 3 2 1 2 3 2 1 2 3 1 2 1 2 1 2 1 2 1 3 1 2 1 2 1 2 1 3 1 2 1 3 1 2 1 2 1 3 1 2 3 2 3 1 3 2 3 1 3 2 3 1 3 1 3 1 3 2 3 2 3 1 3 1 3 1 3 2 3 3 2 3 2 3 2 3 2 1 2 1 2 1 2 3 2 1 2 3 2 ...
result:
ok good plan
Test #27:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
1017604 1044219 1047264
output:
124 2 1 3 2 3 2 3 2 1 2 1 2 3 2 2 3 1 3 1 3 2 3 1 3 2 3 2 3 1 3 3 1 2 1 2 1 2 1 2 1 3 1 3 1 2 1 3 2 3 2 3 2 1 2 3 2 3 2 1 2 1 2 1 2 2 1 3 1 2 1 3 1 2 1 2 1 2 1 2 1 2 1 3 1 3 1 3 1 3 1 2 1 1 2 1 2 3 2 1 2 1 2 1 2 3 2 3 2 3 2 1 2 1 2 1 2 3 2 1 3 1 3 1 3 1 3 1 3 2 3 1 3 1 3 2 3 2 3 2 3 2 3 1 3 1 3 2 3 ...
result:
ok good plan
Test #28:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
10023437 10049857 10053253
output:
124 2 1 1 2 1 2 3 2 3 2 3 2 3 2 3 2 1 2 3 2 1 3 2 3 2 3 2 3 2 3 1 3 2 3 2 3 2 3 2 3 1 2 3 2 1 2 3 2 1 2 3 2 1 2 1 2 3 2 1 2 3 2 1 3 1 3 2 3 2 3 2 3 1 3 2 3 1 3 2 3 2 3 1 3 2 1 2 1 3 1 2 1 3 1 3 1 3 1 3 1 2 1 2 1 2 1 3 1 2 3 1 3 2 3 2 3 1 3 2 3 2 3 2 3 2 3 2 3 1 2 3 2 1 2 1 2 1 2 1 2 1 2 3 2 3 2 1 2 ...
result:
ok good plan
Test #29:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
100010076 100034479 100039408
output:
184 2 1 3 2 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3 2 1 3 2 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 2 3 2 3 2 3 2 3 1 3 2 1 2 1 2 1 2 1 2 1 2 1 3 1 3 1 3 1 2 1 3 1 2 1 3 1 3 1 2 1 3 2 1 2 3 2 3 2 1 2 3 2 3 2 1 2 1 2 1 2 1 2 3 2 1 2 1 2 3 2 1 3 2 3 1 3 1 3 1 3 2 3 2 3 2 3 2 3 1 3 2 3 2 3 1 3 1 3 1 3 2 1 ...
result:
ok good plan
Test #30:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
100021199 100049225 100065369
output:
127 2 1 1 2 3 2 1 2 1 2 3 2 3 2 3 2 3 2 3 2 1 2 3 2 3 2 2 3 2 3 1 3 2 3 2 3 2 3 1 3 2 3 2 3 2 3 1 3 1 3 1 3 2 3 1 2 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 3 2 3 2 1 2 3 2 1 2 2 1 2 1 2 1 3 1 3 1 2 1 2 1 3 1 3 1 3 1 2 1 3 1 3 1 3 1 2 1 1 2 3 2 3 2 1 2 1 2 1 2 3 2 3 2 1 2 3 2 3 2 3 2 1 2 1 2 3 2 1 3 2 3 2 3 ...
result:
ok good plan