Submission #1191775

#TimeUsernameProblemLanguageResultExecution timeMemory
1191775petezaMađioničar (COI22_madionicar)C++20
100 / 100
465 ms408 KiB
#include <bits/stdc++.h>
using namespace std;

int n, x;
int cans = 1;
int cmx = 1;

int main() {
    cin >> n;
    //run odd
    for(int i=1;i<=n;i++) {
        for(;i-cmx>=1 && i+cmx <=n;cmx++) {
            cout << "? " << i-cmx << ' ' << i+cmx << endl;
            cin >> x;
            if(!x) break;
        }
    }
    cans = max(cans, cmx*2-1);
    //run even
    cmx = 1;
    for(int i=1;i<n;i++) {
        //let i to i+1 be the center of the palindrome
        for(;i-cmx+1>=1 && i+cmx <= n;cmx++) {
            cout << "? " << i-cmx+1 << ' ' << i+cmx << endl;
            cin >> x;
            if(!x) break;
        }
    }
    cans = max(cans, cmx*2-2);
    cout << "! " << cans << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...