| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1086001 | not_amir | Colors (BOI20_colors) | C++14 | 1 ms | 388 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;
#define T
typedef long long ll;
int ask(ll q){
static ll bef = 0;
cout << "? " << q << endl;
int ans;
cin >> ans;
return ans;
}
ll solve(ll n, ll c, ll add, bool dir){
if(n == 1)
return 1 + add;
ll diff = n/2 + add;
ll q = (dir)?c+diff:c-diff;
if(ask(q))
return solve(n/2, q, add, !dir);
else
return solve((n+1)/2, q, add + n/2, !dir);
}
ll start(ll n){
if(n == 2)
return 1;
return (n + 1)/2 + 1 - start((n + 1)/2);
}
int main(){
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
ll n;
cin >> n;
int c = start(n);
ask(c);
ll ans = solve(n, c, 0, 1);
cout << "= " << ans;
}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... | ||||
