Submission #722609

#	Time	Username	Problem	Language	Result	Execution time	Memory
722609		gagik_2007	Colors (BOI20_colors)	C++17	0 / 100	1 ms	208 KiB

Colors

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <chrono>
#include <ctime>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <limits>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <functional>
#include <random>
#include <cassert>
using namespace std;

typedef long long ll;
typedef long double ld;

#define ff first
#define ss second

ll ttt;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll N = 200007;
const ll LG = 31;
ll n, m, k;

bool ask(ll& cur, ll len) {
	ll nor = 0;
	if (cur > n / 2) {
		nor = cur - len;
	}
	else {
		nor = cur + len;
	}
	cout << "? " << nor << endl;
	cur = nor;
	bool res;
	cin >> res;
	return res;
}

int main() {
	//freopen("in.txt", "r", stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	ll l = 1, r = n + 1;
	ll cur = 0;
	ask(cur, n / 4);
	while (l < r) {
		ll mid = (l + r) / 2;
		if (ask(cur, mid)) {
			r = mid;
		}
		else {
			l = mid + 1;
		}
	}
	cout << "= " << l << endl;
}

/// ---- - --------  ------ -------- -- - - -
/// Just a reminder. Ubuntu password is I O I
/// ---- - --------  ------ -------- -- - - -

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