QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #437322 | #8674. Riddle of the Sphinx | monster_hunter | WA | 1ms | 3880kb | C++14 | 934b | 2024-06-09 07:37:07 | 2024-06-09 07:37:07 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define f fflush(stdout)
LL n,i,j,k,m,x,y;
LL a,b,c;
bool flag1=false,flag2=false,flag3=false;
int main(){
printf("1 0 0\n");
f;
scanf("%lld",&a);
printf("0 1 0\n");
f;
scanf("%lld",&b);
printf("0 0 1\n");
f;
scanf("%lld",&c);
printf("1 1 1\n");
f;
scanf("%lld",&x);
if(x==a+b+c){
printf("0 0 0\n");
f;
scanf("%lld",&x);
printf("%lld %lld %lld\n",a,b,c);
}
else{
printf("1 2 3\n");
f;
scanf("%lld",&y);
if(y-x!=b+2*c) flag1=true;
if(y-2*x!=c-a) flag2=true;
if(3*x-y!=b+2*a) flag3=true;
if(flag1==true && flag2==true){
printf("%lld %lld %lld\n",a,b,x-a-b);
}
if(flag1==true && flag3==true){
printf("%lld %lld %lld\n",a,x-a-c,c);
}
if(flag2==true && flag3==true){
printf("%lld %lld %lld\n",x-b-c,b,c);
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3824kb
input:
1 2 3 6 0
output:
1 0 0 0 1 0 0 0 1 1 1 1 0 0 0 1 2 3
result:
ok correct!
Test #2:
score: 0
Accepted
time: 1ms
memory: 3868kb
input:
9998 1 1 10000 0
output:
1 0 0 0 1 0 0 0 1 1 1 1 0 0 0 9998 1 1
result:
ok correct!
Test #3:
score: 0
Accepted
time: 0ms
memory: 3780kb
input:
3333 3333 3333 9999 0
output:
1 0 0 0 1 0 0 0 1 1 1 1 0 0 0 3333 3333 3333
result:
ok correct!
Test #4:
score: 0
Accepted
time: 0ms
memory: 3796kb
input:
892 503 712 2108 4035
output:
1 0 0 0 1 0 0 0 1 1 1 1 1 2 3 893 503 712
result:
ok correct!
Test #5:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
868 365 947 2182 4443
output:
1 0 0 0 1 0 0 0 1 1 1 1 1 2 3 868 367 947
result:
ok correct!
Test #6:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
684 827 794 2304 4717
output:
1 0 0 0 1 0 0 0 1 1 1 1 1 2 3 684 827 793
result:
ok correct!
Test #7:
score: -100
Wrong Answer
time: 0ms
memory: 3792kb
input:
308 23 440 769 1674
output:
1 0 0 0 1 0 0 0 1 1 1 1 1 2 3 308 23 438 308 21 440 306 23 440
result:
wrong answer read