제출 #1311110

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1311110		syanvu	Mađioničar (COI22_madionicar)	C++20	100 / 100	477 ms	428 KiB

Main

// #pragma optimize ("g",on)
// #pragma GCC optimize ("inline")
// #pragma GCC optimize ("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC optimize ("03")
#include <bits/stdc++.h>

#define pb push_back
#define SS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
// #define int long long
#define all(v) v.begin(),v.end()
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const int N = 5e4 + 1, inf = 1e9, mod = 998244353;

int ask(int l, int r){
    cout << "? " << l << ' ' << r << endl;
    int res;
    cin >> res;
    return res;
}

void solve(){
    int n;
    cin >> n;
    int sz = 3, i = 1;
    int ans = 1;
    while(i + sz - 1 <= n){
        if(ask(i, i + sz - 1)){
            ans = sz;
            sz += 2;
            if(i != 1) i--;
            continue;
        }
        else{
            i++;
        }
    }
    sz = max(2, ans + 1);
    i = 1;
    while(i + sz - 1 <= n){
        if(ask(i, i + sz - 1)){
            ans = sz;
            sz += 2;
            if(i != 1) i--;
            continue;
        }
        else{
            i++;
        }
    }
    cout << "! " << ans << endl;
    /*
    aabca
    */
}

signed main(){
    SS
    // freopen("trains.in", "r", stdin);
    // freopen("trains.out", "w", stdout);

    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}

• Subtask 1: 13 / 13
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 37 / 37