oj.uz

답안 #528081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528081 2022-02-19T07:14:12 Z SiddhantAttavar Colors (BOI20_colors) C++14
0 / 100
 1 ms 200 KB 
#include <bits/stdc++.h>
using namespace std;
template<typename T> inline void input(T& inVar) {cin >> inVar;}
template<typename T, typename... S> inline void input(T& inVar, S&... args) {cin >> inVar; input(args ...);}
template<typename T> inline void print(T outVar) {cout << outVar << endl;}
template<typename T, typename... S> inline void print(T outVar, S... args) {cout << outVar << ' '; print(args ...);}
#define range(it, start, end) for (int it = start; it < end; it++)
#define arrPut(var) for (auto &inVar : var) {cin >> inVar;}
#define arrPrint(var) for (auto outVar : var) {cout << outVar << ' ';} cout << endl
#define setup() ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long

int32_t main() {
	// setup();
	
	int n;
	input(n);
	
	int l = 0, r = n, c = 0;
	bool flag = false;
	while (l + 1 < r) {
		int m = (l + r) / 2;
		if (flag) {
			c -= m;
		}
		else {
			c += m;
		}
		l = m;
		flag = !flag;
	}

	if (c < 0) {
		c = -c;
	}

	l = 0;
	r = n;
	print("? ", c);
	bool f;
	input(f);
	set<int> done;
	while (l + 1 < r) {
		int m = (l + r) / 2;
		if (c + m <= n and !done.count(c + m)) {
			c += m;
		}
		else if (c - m >= 1 and !done.count(c - m)) {
			c -= m;
		}
		else {
			c = 1;
			print("? ", c);
			bool b;
			input(b);
			done.insert(1);
			continue;
		}

		print("? ", c);
		done.insert(c);

		bool b;
		input(b);
		if (b) {
			r = m;
		}
		else {
			l = m;
		}
	}
	print("= ", r);
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB OK (4 queries)
2 Incorrect 1 ms 200 KB Hair color 1 was used multiple times
3 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB OK (4 queries)
2 Incorrect 1 ms 200 KB Hair color 1 was used multiple times
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB OK (4 queries)
2 Incorrect 1 ms 200 KB Hair color 1 was used multiple times
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB OK (4 queries)
2 Incorrect 1 ms 200 KB Hair color 1 was used multiple times
3 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB OK (4 queries)
2 Incorrect 1 ms 200 KB Hair color 1 was used multiple times
3 Halted 0 ms 0 KB -