# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
827753 | 2023-08-16T17:24:31 Z | nnin | Aliens (IOI07_aliens) | C++14 | 1 ms | 208 KB |
#include<bits/stdc++.h> #define int long long #define pii pair<int,int> #define f first #define s second using namespace std; int n, x, y, m; bool interact(int xx, int yy) { if(xx==x && yy==y) return 1; printf("examine %d %d\n", xx, yy); string s; cin>>s; return s[0]=='t'; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin>>n>>x>>y; int l, r, two; two = 1; while(x+two<=n && interact(x+two, y)) two *= 2; l = x+(two/2); r = min(x+two, n); while(l<r) { int mid = (l+r+1)/2; if(interact(mid, y)) l = mid; else r = mid-1; } int right = l; two = 1; while(x-two>=1 && interact(x-two, y)) two *= 2; l = max(x-two, (int)1); r = x-(two/2); while(l<r) { int mid = (l+r)/2; if(interact(mid, y)) r = mid; else l = mid+1; } int left = l; two = 1; while(y+two<=n && interact(x, y+two)) two *= 2; l = y+(two/2); r = min(y+two, n); while(l<r) { int mid = (l+r+1)/2; if(interact(x, mid)) l = mid; else r = mid-1; } int top = l; two = 1; while(y-two>=1 && interact(x, y-two)) two *= 2; l = max(y-two, (int)1); r = y-(two/2); while(l<r) { int mid = (l+r)/2; if(interact(x, mid)) r = mid; else l = mid+1; } int bottom = l; m = right+1-left; int xc = (left+right)/2; int yc = (top+bottom)/2; while(xc-m>=1 && yc-m>=1 && interact(xc-m, yc-m)) { xc -= m; yc -= m; } while(xc-(2*m)>=1 && interact(xc-(2*m), yc)) xc -= 2*m; while(yc-(2*m)>=1 && interact(xc, yc-(2*m))) yc -= 2*m; xc += 2*m; yc += 2*m; printf("solution %d %d", xc, yc); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 0 ms | 208 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1 ms | 208 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1 ms | 208 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1 ms | 208 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1 ms | 208 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1 ms | 208 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1 ms | 208 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1 ms | 208 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 0 ms | 208 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1 ms | 208 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |