제출 #771854

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
771854		marvinthang	던전 (IOI21_dungeons)	C++17	100 / 100	2488 ms	1049092 KiB

dungeons

/*************************************
*    author: marvinthang             *
*    created: 03.07.2023 09:56:24    *
*************************************/

#include "dungeons.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

const int LOG = 25;
const int NT = 9;
const int T = 3;
const int INF = 1e9;
const int MAX = 4e5 + 5;

int N;
vector <int> S, P, W, L;
int nxt[NT - 1][LOG][MAX], threshold[NT - 1][LOG][MAX], add[NT - 1][LOG][MAX];
long long add_last[LOG][MAX];

void init(int n, vector <int> s, vector <int> p, vector <int> w, vector <int> l) {
	N = n; S = s; P = p; W = w; L = l;
	REPD(t, NT) {
		if (t < NT - 1) {
			nxt[t][0][N] = N;
			add[t][0][N] = 0;
			threshold[t][0][N] = INF;
			REP(i, N) {
				if (s[i] <= MASK(t * T)) {
					nxt[t][0][i] = W[i];
					add[t][0][i] = S[i];
					threshold[t][0][i] = INF;
				} else {
					nxt[t][0][i] = L[i];
					add[t][0][i] = P[i];
					threshold[t][0][i] = S[i];
				}
			}
			FOR(k, 1, LOG) REP(i, N + 1) {
				int m = nxt[t][k - 1][i];
				nxt[t][k][i] = nxt[t][k - 1][m];
				add[t][k][i] = add[t][k - 1][i] + add[t][k - 1][m];
				if (add[t][k][i] >= MASK(t * T) + (int) 1e7) {
					threshold[t][k][i] = -1;
					add[t][k][i] = 0;
				} else {
					threshold[t][k][i] = min(threshold[t][k - 1][i], threshold[t][k - 1][m] == INF ? INF : threshold[t][k - 1][m] - add[t][k - 1][i]);
				}
			}
		} else {
			nxt[0][0][N] = N;
			add_last[0][N] = 0;
			REP(i, N) {
				nxt[0][0][i] = W[i];
				add_last[0][i] = S[i];
			}
			FOR(k, 1, LOG) REP(i, N + 1) {
				int m = nxt[0][k - 1][i];
				nxt[0][k][i] = nxt[0][k - 1][m];
				add_last[k][i] = add_last[k - 1][i] + add_last[k - 1][m];
			}
		}
	}
}

long long simulate(int x, int zz) {
	long long z = zz;
	REP(t, NT - 1) {
		REP(love, MASK(T) - 1) {
			if (z >= MASK(t * T + T)) break;
			REPD(k, LOG) if (z < threshold[t][k][x]) {
				z += add[t][k][x];
				x = nxt[t][k][x];
			}
			if (x == N) return z;
			if (z >= S[x]) {
				z += S[x];
				x = W[x];
			} else {
				z += P[x];
				x = L[x];
			}
		}
	}
	return z + add_last[LOG - 1][x];
}

• Subtask 1: 11 / 11
• Subtask 2: 26 / 26
• Subtask 3: 13 / 13
• Subtask 4: 12 / 12
• Subtask 5: 27 / 27
• Subtask 6: 11 / 11