QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#574839 | #8674. Riddle of the Sphinx | deepthought | RE | 1ms | 3688kb | C++23 | 1.5kb | 2024-09-19 01:22:24 | 2024-09-19 01:22:24 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int MAXX = 10005;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int r1, r2, r3, r4, r5;
cout << "1 0 0" << endl; // r1
cin >> r1;
cout << "0 1 0" << endl; // r2
cin >> r2;
cout << "0 0 1" << endl; // r3
cin >> r3;
cout << "1 1 1" << endl; // r4
cin >> r4;
cout << "1 2 3" << endl; // r5
cin >> r5;
if(r1 + r2 + r3 == r4) {
cout << r1 << " " << r2 << " " << r3 << endl;
}
else if(r1 + 2 * r2 + 3 * r3 == r5) {
cout << r1 << " " << r2 << " " << r3 << endl;
}
else {
while(1) {
// without r1
int a = r4 - r3 - r2;
int b = r4 - r2 - a;
int c = r4 - a - b;
if(a + 2 * b + 3 * c == r5) {
cout << a << " " << b << " " << c << endl;
break;
}
// without r2
b = r4 - r1 - r3;
c = r4 - r1 - b;
a = r4 - b - c;
if(a + 2 * b + 3 * c == r5) {
cout << a << " " << b << " " << c << endl;
break;
}
// without r3
c = r4 - r1 - r2;
b = r4 - c - r1;
a = r4 - b - c;
if(a + 2 * b + 3 * c == r5) {
cout << a << " " << b << " " << c << endl;
break;
}
assert(false);
}
}
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3688kb
input:
1 2 3 6 14
output:
1 0 0 0 1 0 0 0 1 1 1 1 1 2 3 1 2 3
result:
ok correct!
Test #2:
score: 0
Accepted
time: 1ms
memory: 3688kb
input:
9998 1 1 10000 10003
output:
1 0 0 0 1 0 0 0 1 1 1 1 1 2 3 9998 1 1
result:
ok correct!
Test #3:
score: 0
Accepted
time: 1ms
memory: 3608kb
input:
3333 3333 3333 9999 19998
output:
1 0 0 0 1 0 0 0 1 1 1 1 1 2 3 3333 3333 3333
result:
ok correct!
Test #4:
score: -100
Runtime Error
input:
892 503 712 2108 4035
output:
1 0 0 0 1 0 0 0 1 1 1 1 1 2 3