제출 #1313380

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1313380		thieunguyenhuy	Worm Worries (BOI18_worm)	C++20	10 / 100	3075 ms	332 KiB

worm

#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 LOG(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;
}

template <class T> void remove_duplicate(vector<T> &ve) {
	sort (ve.begin(), ve.end());
	ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

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

const int N = 500;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

const int dx[] = {-1, 1, 0, 0, 0, 0};
const int dy[] = {0, 0, -1, 1, 0, 0};
const int dz[] = {0, 0, 0, 0, -1, 1};

int n, m, k, q;
int mem[N * N * N + 5];

int num(int x, int y, int z) {
	return (x - 1) * m * k + (y - 1) * k + z - 1;
}

int ask(int x, int y, int z) {
	if (x < 1 || x > n || y < 1 || y > m || z < 1 || z > k) return 0;
	int &ans = mem[num(x, y, z)];
	if (ans != 0) return ans;
	cout << "? " << x << ' ' << y << ' ' << z << endl;
	cin >> ans;
	if (ans == -1) {
		while (true) {
			int n = 5;
		}
	}
	return ans;
}

void answer(int x, int y, int z) {
	cout << "! " << x << ' ' << y << ' ' << z << endl;
	exit(0);
}

signed main() {
	cin >> n >> m >> k >> q;

	if (ask(1, 1, 1) >= ask(2, 1, 1)) answer(1, 1, 1);
	if (ask(n, 1, 1) >= ask(n - 1, 1, 1)) answer(n, 1, 1);

	int low = 2, high = n - 1, pos = -1;
	while (low <= high) {
		int mid = (low + high) >> 1;
		if (ask(mid, 1, 1) > ask(mid + 1, 1, 1)) high = (pos = mid) - 1;
		else low = mid + 1;
	}

	answer(pos, 1, 1);
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 22
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 14
• Subtask 6: 0 / 23