Submission #1195424

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195424		FIFI_cpp	Mađioničar (COI22_madionicar)	C++20	100 / 100	451 ms	412 KiB

Main

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <fstream>
#include <iterator>
#include <set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cctype>
#include <string>
#include <cassert>
#include <set>
#include <bitset>
#include <unordered_set>
#include <numeric>

#define all(a) a.begin(), a.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ppi pair<int,pair<int,int>>
#define int int64_t

using namespace std;
//    /\_/\
//   (= ._.)
//   / >  \>
// encouraging cat
const int INF = 10000000000000000;
//const int mod = 1000000007;
const int mod = 998244353;
const int MAXN = 200005;
//ifstream fin('xor.in');
//ofstream fout('xor.out');
int res = 1;
int queries = 0;
int n;
bool query(int l,int r)
{
    if (l < 0)
    {
        return false;
    }
    if (l == r)
    {
        return true;
    }
    if (r >= n || l > r)
    {
        return false;
    }
    queries++;
    cout << "? " << l + 1 << " " << r + 1 << '\n';
    cout.flush();
    int x;
    cin >> x;
    if (x)
    {
        res = max(res, r - l + 1);
    }
    return x;
}
signed main()
{
    cin >> n;
    int delta = 1;
    for (int l = 0;l + delta < n;l++)
    {
        for (;l + delta < n && l - delta >= 0;delta++)
        {
            if (!query(l - delta, l + delta))
            {
                break;
            }
        }
    }
    res = max(res,2 * delta - 1);
    delta = 1;
    for (int l = 0;l < n;l++)
    {
        for (;l + delta < n && l - delta + 1 >= 0;delta++)
        {
            if (!query(l - delta + 1, l + delta))
            {
                break;
            }
        }
    }
    res = max(res, 2 * delta - 2);
    cout << "! " << res << '\n';
    //cout << "asked: " << queries << '\n';
    return 0;
}

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