oj.uz

Submission #1061397

# Submission time Handle Problem Language Result Execution time Memory
1061397 2024-08-16T08:39:35 Z vjudge1 Mađioničar (COI22_madionicar) C++17
0 / 100
 1164 ms 344 KB 
#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;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 74 ms 344 KB L = 25, expected 30
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 74 ms 344 KB L = 25, expected 30
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory 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 -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 74 ms 344 KB L = 25, expected 30
2 Halted 0 ms 0 KB -