QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#310841 | #1963. Squid Game | xcyyyyy | AC ✓ | 0ms | 3960kb | C++14 | 587b | 2024-01-21 18:51:03 | 2024-01-21 18:51:04 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int A,ida,B,idb,C,idc;
vector< pair<int,int> > ans;
void init(){if(A>B)swap(A,B),swap(ida,idb);if(A>C)swap(A,C),swap(ida,idc);if(B>C)swap(B,C),swap(idb,idc);}
int main(){
scanf("%d%d%d",&A,&B,&C);ida=1,idb=2,idc=3;
while(init(),A){
int base=A;
while(A/base<=B/base){
if((B/base)&(A/base))B-=A,A+=A,ans.push_back({idb,ida});
else C-=A,A+=A,ans.push_back({idc,ida});
}
}
printf("%d\n",ans.size());
for(pair<int,int> &x:ans)printf("%d %d\n",x.first,x.second);
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3952kb
input:
1 2 3
output:
2 3 1 2 1
result:
ok good plan
Test #2:
score: 0
Accepted
time: 0ms
memory: 3952kb
input:
1 4 6
output:
3 3 1 3 1 2 1
result:
ok good plan
Test #3:
score: 0
Accepted
time: 0ms
memory: 3908kb
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: 3816kb
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: 3912kb
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: 3960kb
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: 3908kb
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: 3772kb
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: 3956kb
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: 3948kb
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: 3956kb
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: 3900kb
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: 3808kb
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: 3772kb
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: 3904kb
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: 3888kb
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: 3956kb
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: 3956kb
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: 3768kb
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: 3892kb
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: 3812kb
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: 3924kb
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: 3912kb
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: 3912kb
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: 3912kb
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: 3948kb
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: 3848kb
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: 3912kb
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: 3952kb
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: 3932kb
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