Submission #1195470

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195470		raphaelp	Mađioničar (COI22_madionicar)	C++20	100 / 100	472 ms	1552 KiB

Main

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N;
    cin >> N;
    int best = 0;
    vector<int> Tab;
    for (int i = 0; i < N; i++)
    {
        Tab.push_back(N + i);
        if (i > 0)
            Tab.push_back(N - i);
    }
    for (int i = 0; i < 2 * N - 1; i++)
    {
        int x = Tab[i];
        int t = 1;
        while (t)
        {
            int sz = best + 1;
            if (sz % 2 != x % 2)
                sz++;
            int L = (x - sz) / 2 + 1, R = (x + sz) / 2;
            if (L < 1 || R > N)
                break;
            cout << "? " << L << ' ' << R << endl;
            cin >> t;
            if (t)
                best = sz;
        }
    }
    cout << "! " << best << endl;
}

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