#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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
74 ms |
344 KB |
L = 25, expected 30 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
74 ms |
344 KB |
L = 25, expected 30 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1164 ms |
344 KB |
Output is correct |
2 |
Runtime error |
0 ms |
344 KB |
Execution killed with signal 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
74 ms |
344 KB |
L = 25, expected 30 |
2 |
Halted |
0 ms |
0 KB |
- |