제출 #807285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
807285		stefanopulos	Mađioničar (COI22_madionicar)	C++17	0 / 100	1006 ms	208 KiB

Main

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 200005; 

int n;

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

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;

    int a = 1, b = 0;
    ff(i,1,n){

        while(i - a / 2 - 1 >= 1 && i + a / 2 + 1 <= n && ask(i - a / 2 - 1, i + a / 2 + 1) == 1){
            a += 2;
        }

        while(i - b / 2 >= a && i + b / 2 + 1 <= n && ask(i - b / 2, i + b / 2 + 1) == 1){
            b += 2;
        }

    }

    cout << max(a, b) << endl;

    return 0;
}
/*



// probati bojenje sahovski
*/
 
 
 
 
 

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