#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const int MOD = 1e9 + 7;
const int MAXN = 1e6+1;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, x, y;
cin >> n >> x >> y;
int aux = x+1;
int resp = 1;
while(aux <= n){
cout << "examine " << aux << ' ' << y << endl;
string fb;
cin >> fb;
if(fb == "true"){
resp++;
} else break;
aux++;
}
aux = x-1;
while(aux > 0){
cout << "examine " << aux << ' ' << y << endl;
string fb;
cin >> fb;
if(fb == "true"){
resp++;
} else break;
aux--;
}
aux++;
int auy = y-1;
while(auy > 0){
cout << "examine " << aux << ' ' << auy << endl;
string fb;
cin >> fb;
if(fb != "true")
break;
auy--;
}
auy++;
auy-=2*resp;
while(auy > 0){
cout << "examine " << aux << ' ' << auy << endl;
string fb;
cin >> fb;
if(fb != "true")
break;
auy-=resp;
}
auy+=2*resp;
aux-=2*resp;
while(aux > 0){
cout << "examine " << aux << ' ' << auy << endl;
string fb;
cin >> fb;
if(fb!="true")
break;
aux-=resp;
}
aux+=2*resp;
cout << "solution " << aux + 2*resp + resp/2 << ' ' << auy + 2*resp + resp/2 << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
200 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
200 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
200 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
200 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
200 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
200 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
240 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
200 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
5 ms |
200 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
4 ms |
200 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |