# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1036759 | MarwenElarbi | Colors (BOI20_colors) | C++17 | 0 ms | 344 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>
#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 << "? "<<n/2-1<<endl;
int nothing;cin>>nothing;
int l=0;
int r=n-1;
int lst=n/2-1;
int i=lst;
int j=lst;
int end=1;
bool vis[n+1];
memset(vis,0,sizeof vis);
vis[(int)__lg(n)]=true;
while(r-l>1){
int mid=(r+l)/2;
if(lst+mid<=n&&!vis[lst+mid]){
cout <<"? "<<lst+mid<<endl;
vis[lst+mid]=true;
lst=lst+mid;
}else{
cout <<"? "<<lst-mid<<endl;
vis[lst-mid]=true;
lst=lst-mid;
}
int c;
cin>>c;
if(c==0){
l=mid;
}else{
r=mid;
}
}
cout <<"= "<<r<<endl;
}
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... |