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;
void solve(){
int n;
cin >> n;
int prev = 1, resp, ans = 1;
int next_prev;
for(int i = 2; i <= n; i++){
next_prev = i;
cout << "? " << prev << " " << i << endl;
cin >> resp;
if(resp == 1){
next_prev = prev;
ans = max(ans, i-prev+1);
}
if(prev != 1){
cout << "? " << prev-1 << " " << i << endl;
cin >> resp;
if(resp == 1){
next_prev = prev-2;
ans = max(ans, i-prev+2);
}
}
prev = next_prev;
}
cout << "! " << ans << endl;
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int t = 1;
// cin >> t;
while(t--){
solve();
}
return 0;
}
# | 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... |