Submission #914446

#TimeUsernameProblemLanguageResultExecution timeMemory
914446AmrColors (BOI20_colors)C++14
0 / 100
0 ms344 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define S second #define F first #define all(x) (x).begin(),(x).end() #define sz size() #define Yes cout << "YES" << endl #define No cout << "NO" << endl #define pb(x) push_back(x); #define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); const int N=3e5+7; ll INF=INT_MAX,mod=1e9+7; int TT=1; ll power(ll x, unsigned int y) { ll res = 1; x = x; // % mod; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res*x) ; // % mod; y = y>>1; x = (x*x) ; // % mod; } return res; } void solve() { ll n; cin >> n; ll lst = 1,over =n-1; cout << "? " << 1 << endl; ll cn; cin >> cn; while(1) { if(lst+over<=n) lst+=over; else lst-=over; cout << "? " << lst << endl; cin >> cn; if(cn==0) {cout << over+1 << endl; break;} over--; } } int main(){ //freopen("friday.in","r",stdin); //freopen("friday.out","w",stdout); fast; // cin >> TT; while(TT--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...