oj.uz

답안 #258049

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
258049 2020-08-05T09:14:23 Z mieszko11b Colors (BOI20_colors) C++14
0 / 100
 0 ms 256 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using pll = pair<ll, ll>;
using uid = uniform_int_distribution<int>;

using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
using ordered_multiset = tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>;

const int inf = int(1e9) + 7;
const ll INF = ll(1e18) + 7;

#define X first
#define Y second

//~ mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());

//~ int rand(int a, int b) {
	//~ return uid(a, b)(rng);
//~ }

void boost() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}

ll n;
ll act;

bool ask(ll x) {
	if(x > n) {
		ask(act - (x - n));
		x = n;
	}
	if(x < 1) {
		ask(act + (1 - x));
		x = 1;
	}
	
	act = x;
	printf("? %lld\n", x);
	fflush(stdout);
	int xx;
	scanf("%d", &xx);
	return xx;
}

void solve() {
	scanf("%lld", &n);
	ll first = 1;
	ll m = 0, pocz = 1, mid;
	while(pocz < n) {
		mid = (pocz + n) / 2;
		if(m)
			first += (mid - pocz + 1);
		m ^= 1;
		pocz = mid + 1;
	}
	
	ask(first);
	int dir = 1;
	pocz = 1;
	ll kon = n;
	while(pocz < kon) {
		mid = (pocz + kon) / 2;
		if(ask(act + ll(dir) * mid))
			kon = mid;
		else
			pocz = mid + 1;
		dir = -dir;
	}
	
	printf("= %lld\n", pocz);
	fflush(stdout);
}

int main() {
	//~ boost();
	int t = 1;
	scanf("%d", &t);
	while(t--) {
		solve();
	}
	return 0;
}

Compilation message

Colors.cpp: In function 'bool ask(ll)':
Colors.cpp:51:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &xx);
  ~~~~~^~~~~~~~~~~
Colors.cpp: In function 'void solve()':
Colors.cpp:56:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
Colors.cpp: In function 'int main()':
Colors.cpp:87:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &t);
  ~~~~~^~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 0 ms 256 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 0 ms 256 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 0 ms 256 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 0 ms 256 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 0 ms 256 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -