# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1036474 | 2024-07-27T12:16:30 Z | MarwenElarbi | Colors (BOI20_colors) | C++17 | 1 ms | 344 KB |
#include <bits/stdc++.h> #define vi vector<int> #define ve vector #define ll long long #define vl vector<ll> #define vll vector<pair<ll,ll>> #define onbit __builtin_popcount #define ii pair<int,int> #define vvi vector<vi> #define vii vector<ii> #define gii greater<ii> #define pb push_back #define mp make_pair #define fi first #define se second #define INF 1e18 #define eps 1e-7 #define eps1 1e-2 #define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define MAX_A 1e5+5 using namespace std; const int MOD = 1e9+7; const int nax = 2e5+5; const int MAX_VAL = 1e6; double PI=3.14159265359; int arx[8]={1,1,0,-1,-1,-1, 0, 1}; int ary[8]={0,1,1, 1, 0,-1,-1,-1}; typedef complex<int> Point; #define X real() #define Y imag() void setIO(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } int main(){ optimise; //setIO("closing"); int n; cin>>n; cout << "? "<<__lg(n)<<endl; int nothing;cin>>nothing; int l=0; int r=n-1; int lst=__lg(n); int i=lst; int j=lst; while(r-l>1){ int mid=(r+l)/2; cout <<"? "<<lst+mid<<endl; int c; cin>>c; if(c==0){ j--; lst=j; l=mid; if(l==r-1) break; cout<<"? "<<lst<<endl; cin>>c; if(c==1){ r=mid+1; break; } l=mid+1; }else{ i++; lst=i; r=mid; if(r==l+1) break; cout<<"? "<<lst<<endl; cin>>c; if(c==0) break; r=mid-1; } } cout <<"= "<<r<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | OK (3 queries) |
2 | Correct | 1 ms | 344 KB | OK (9 queries) |
3 | Correct | 0 ms | 344 KB | OK (5 queries) |
4 | Correct | 0 ms | 344 KB | OK (7 queries) |
5 | Correct | 0 ms | 344 KB | OK (3 queries) |
6 | Incorrect | 0 ms | 344 KB | Wrong guess |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | OK (3 queries) |
2 | Correct | 1 ms | 344 KB | OK (9 queries) |
3 | Correct | 0 ms | 344 KB | OK (5 queries) |
4 | Correct | 0 ms | 344 KB | OK (7 queries) |
5 | Correct | 0 ms | 344 KB | OK (3 queries) |
6 | Incorrect | 0 ms | 344 KB | Wrong guess |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | OK (3 queries) |
2 | Correct | 1 ms | 344 KB | OK (9 queries) |
3 | Correct | 0 ms | 344 KB | OK (5 queries) |
4 | Correct | 0 ms | 344 KB | OK (7 queries) |
5 | Correct | 0 ms | 344 KB | OK (3 queries) |
6 | Incorrect | 0 ms | 344 KB | Wrong guess |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | OK (3 queries) |
2 | Correct | 1 ms | 344 KB | OK (9 queries) |
3 | Correct | 0 ms | 344 KB | OK (5 queries) |
4 | Correct | 0 ms | 344 KB | OK (7 queries) |
5 | Correct | 0 ms | 344 KB | OK (3 queries) |
6 | Incorrect | 0 ms | 344 KB | Wrong guess |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | OK (3 queries) |
2 | Correct | 1 ms | 344 KB | OK (9 queries) |
3 | Correct | 0 ms | 344 KB | OK (5 queries) |
4 | Correct | 0 ms | 344 KB | OK (7 queries) |
5 | Correct | 0 ms | 344 KB | OK (3 queries) |
6 | Incorrect | 0 ms | 344 KB | Wrong guess |
7 | Halted | 0 ms | 0 KB | - |