제출 #635154

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
635154		marvinthang	죄수들의 도전 (IOI22_prison)	C++17	80 / 100	12 ms	1068 KiB

prison

/*************************************
*    author: marvinthang             *
*    created: 25.08.2022 20:38:19    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                 div  ___div
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define             FULL(i)  (MASK(i) - 1)
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#define          file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }

template <class T>             scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class T>            print_op(vector <T>)  { out << '{'; for (size_t i = 0; i + 1 < u.size(); ++i) out << u[i] << ", "; if (!u.empty()) out << u.back(); return out << '}'; }
template <class U, class V>   scan_op(pair <U, V>)  { return in >> u.fi >> u.se; }
template <class U, class V>  print_op(pair <U, V>)  { return out << '(' << u.fi << ", " << u.se << ')'; }

const double PI = 3.1415926535897932384626433832795; // acos(-1.0); atan(-1.0);
const int dir[] = {1, 0, -1, 0, 1, 1, -1, -1, 1}; // {2, 1, -2, -1, -2, 1, 2, -1, 2};
const int NUM_BIT = 8;
const int NUM_STATE = NUM_BIT * 3 - 1;
const int p3[] = {1, 3, 9, 27, 81, 243, 729, 2187, 6561};

int get_bit(int n, int bit) { if (bit < 0) return 0; return (n % p3[bit + 1]) / p3[bit]; }

pair <int, int> decode(int code) {
	--code;
	if (code < 0) return make_pair(0, 0);
	int bit = NUM_BIT - code / 3 - 1;
	if (!bit) return make_pair(0, 1);
	return make_pair(bit, code % 3);
}

int encode(int bit, int t) {
	if (bit < 0) return 0;
	if (!bit) return 22;
	return (NUM_BIT - bit - 1) * 3 + t + 1;
}

vector <vector <int>> devise_strategy(int n) {
	vector <vector <int>> res(NUM_STATE, vector<int> (n + 1, 0));

	for (int state = 0; state < NUM_STATE; ++state) {
		if (!state) {
			res[state][0] = 0;
			for (int i = 1; i <= n; ++i) 
				res[state][i] = encode(NUM_BIT - 1, get_bit(i, NUM_BIT - 1));
			continue;
		}
		auto [bit, t] = decode(state);
		bool parity = !(bit & 1);
		res[state][0] = !parity;
		for (int i = 1; i <= n; ++i) {
			int pre_bit = t;
			int cur_bit = get_bit(i, bit);
			if (pre_bit < cur_bit) res[state][i] = parity ? -2 : -1;
			else if (pre_bit > cur_bit) res[state][i] = parity ? -1 : -2;
			else {
				int tmp = get_bit(i, bit - 1);
				if (bit > 1 || tmp == 1) res[state][i] = encode(bit - 1, tmp);
				else {
					if (tmp == 0) res[state][i] = -2;
					else res[state][i] = -1;
				}
			}
		}
	}
	return res;
}

vector <vector <int>> res;
int n, a, b;

void Try(int state) {
	if (state < 0) return void(cout << state << '\n');
	cout << decode(state) << '\n';
	Try(res[state][res[state][0] ? b : a]);
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 70 / 90