Submission #952449

#	Time	Username	Problem	Language	Result	Execution time	Memory
952449		thieunguyenhuy	동굴 (IOI13_cave)	C++17	100 / 100	505 ms	600 KiB

cave

#ifndef hwe
	#include "cave.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) __builtin_popcountll((n))
#define clz(n) __builtin_clzll((n))
#define ctz(n) __builtin_ctzll((n))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

const int N = 5000 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

#ifdef hwe
namespace Grader {
	int tryCombination(int S[]) {
		for (int i = 0; i < 3; ++i)
			cout << S[i] << ' ';
		cout << '\n';
		int x; cin >> x; return x;
	}
	void answer(int S[], int D[]) {
		for (int i = 0; i < 3; ++i)
			cout << S[i] << ' ';
		cout << '\n';
		for (int i = 0; i < 3; ++i)
			cout << D[i] << ' ';
		cout << '\n';
	}
}
using namespace Grader;
#endif

int s[N], d[N];

void exploreCave(int n) {
	for (int i = 0; i < n; ++i) s[i] = 0, d[i] = -1;

	auto flip = [&](int x) {
		for (int i = 0; i < x; ++i)
			if (d[i] == -1) s[i] = !s[i];
	};

	for (int door = 0; door < n; ++door) {
		int tmp = tryCombination(s);
		if (tmp == door) flip(n);
		int low = 1, high = n, p = -1;
		while (low <= high) {
			int mid = low + high >> 1;
			flip(mid); int tmp = tryCombination(s); flip(mid);
			if (tmp == door) high = (p = mid) - 1;
			else low = mid + 1;
		}
		assert(p != -1); --p;
		// cout << p << ' ' << door << '\n';
		d[p] = door;
	}

	answer(s, d);
}

#ifdef hwe
signed main() {
    // ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    exploreCave(3);

    cerr << '\n'; return 0;
}
#endif

Compilation message (stderr)

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:99:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   99 |    int mid = low + high >> 1;
      |              ~~~~^~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24