# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71493 | RezwanArefin01 | Aliens (IOI07_aliens) | C++17 | 5 ms | 572 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int n;
map<pair<ll, ll>, bool> mp;
bool get(ll x, ll y) {
if(x < 1 || x > n || y < 1 || y > n) return 0;
if(mp.count({x, y})) return mp[{x, y}];
cout << "examine " << x << " " << y << endl;
string s; cin >> s;
return mp[{x, y}] = s[0] == 't';
}
void ans(ll x, ll y) {
cout << "solution " << x << " " << y << endl;
}
ll find(ll x, ll y, ll dx, ll dy) {
ll d = 1;
while(get(x + dx * d, y + dy * d)) d <<= 1;
ll lo = d >> 1, hi = d, idx;
while(lo <= hi) {
ll mid = lo + hi >> 1;
if(get(x + dx * mid, y + dy * mid))
lo = mid + 1, idx = mid;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |