Submission #502657

#	Time	Username	Problem	Language	Result	Execution time	Memory
502657		srivatsav_kannan	Colors (BOI20_colors)	C++14	0 / 100	0 ms	200 KiB

Colors

#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <map>
#include <algorithm>
#include <unordered_map>
using namespace std;
#define int long long int
signed main() {
    int n; cin >> n;
    if (n == 1){
        cout << 1 << endl;
        return 0;
    }
    int l = 1, r = n;
    int prev = n;
    int cur;
    while (l < r){
        int mid = (l+r)/2;
        if (l == r-1) mid = r;
        if (mid == n){
            cout << "? 1" << endl;
            cin >> cur;
            cout << "? " << n << endl;
            cin >> cur;
            if (cur){
                cout << "= " << n-1 << endl;
            } else {
                cout << " " << n << endl;
            }
            return 0;
        }
        cout << "? " << 1 << endl;
        cin >> cur;
        cout << "? " << 1+mid << endl;
        cin >> cur;
        prev += mid;
        if (cur){
            if  (l == r){
                cout << "= " << l << endl;
                break;
            }
            if (l == r-1){
                cout << "= " << r << endl;
                break;
            }
            l = mid;
        } else {
            r = mid-1;
            if (l == r-1){
                cout << "= " << l << endl;
                break;
            }
        }
    }
    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 24
• Subtask 5: 0 / 33