oj.uz

Submission #771854

# Submission time Handle Problem Language Result Execution time Memory
771854 2023-07-03T10:34:36 Z marvinthang Dungeons Game (IOI21_dungeons) C++17
100 / 100
 2488 ms 1049092 KB 
/*************************************
*    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.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4692 KB Output is correct
2 Correct 2 ms 4692 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Correct 81 ms 135092 KB Output is correct
5 Correct 5 ms 9920 KB Output is correct
6 Correct 81 ms 134852 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 836 ms 1043288 KB Output is correct
3 Correct 663 ms 1044464 KB Output is correct
4 Correct 770 ms 1045864 KB Output is correct
5 Correct 745 ms 1045920 KB Output is correct
6 Correct 757 ms 1044312 KB Output is correct
7 Correct 728 ms 1042604 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7364 KB Output is correct
2 Correct 154 ms 136472 KB Output is correct
3 Correct 123 ms 136560 KB Output is correct
4 Correct 107 ms 135996 KB Output is correct
5 Correct 103 ms 135896 KB Output is correct
6 Correct 172 ms 136108 KB Output is correct
7 Correct 177 ms 136012 KB Output is correct
8 Correct 109 ms 135824 KB Output is correct
9 Correct 109 ms 135756 KB Output is correct
10 Correct 116 ms 135656 KB Output is correct
11 Correct 113 ms 136032 KB Output is correct
12 Correct 183 ms 136144 KB Output is correct
13 Correct 185 ms 136020 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7364 KB Output is correct
2 Correct 154 ms 136472 KB Output is correct
3 Correct 123 ms 136560 KB Output is correct
4 Correct 107 ms 135996 KB Output is correct
5 Correct 103 ms 135896 KB Output is correct
6 Correct 172 ms 136108 KB Output is correct
7 Correct 177 ms 136012 KB Output is correct
8 Correct 109 ms 135824 KB Output is correct
9 Correct 109 ms 135756 KB Output is correct
10 Correct 116 ms 135656 KB Output is correct
11 Correct 113 ms 136032 KB Output is correct
12 Correct 183 ms 136144 KB Output is correct
13 Correct 185 ms 136020 KB Output is correct
14 Correct 5 ms 7252 KB Output is correct
15 Correct 129 ms 136248 KB Output is correct
16 Correct 151 ms 136480 KB Output is correct
17 Correct 115 ms 135924 KB Output is correct
18 Correct 138 ms 135980 KB Output is correct
19 Correct 161 ms 136124 KB Output is correct
20 Correct 155 ms 135752 KB Output is correct
21 Correct 153 ms 135868 KB Output is correct
22 Correct 112 ms 135876 KB Output is correct
23 Correct 121 ms 136040 KB Output is correct
24 Correct 254 ms 136088 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7364 KB Output is correct
2 Correct 154 ms 136472 KB Output is correct
3 Correct 123 ms 136560 KB Output is correct
4 Correct 107 ms 135996 KB Output is correct
5 Correct 103 ms 135896 KB Output is correct
6 Correct 172 ms 136108 KB Output is correct
7 Correct 177 ms 136012 KB Output is correct
8 Correct 109 ms 135824 KB Output is correct
9 Correct 109 ms 135756 KB Output is correct
10 Correct 116 ms 135656 KB Output is correct
11 Correct 113 ms 136032 KB Output is correct
12 Correct 183 ms 136144 KB Output is correct
13 Correct 185 ms 136020 KB Output is correct
14 Correct 5 ms 7252 KB Output is correct
15 Correct 129 ms 136248 KB Output is correct
16 Correct 151 ms 136480 KB Output is correct
17 Correct 115 ms 135924 KB Output is correct
18 Correct 138 ms 135980 KB Output is correct
19 Correct 161 ms 136124 KB Output is correct
20 Correct 155 ms 135752 KB Output is correct
21 Correct 153 ms 135868 KB Output is correct
22 Correct 112 ms 135876 KB Output is correct
23 Correct 121 ms 136040 KB Output is correct
24 Correct 254 ms 136088 KB Output is correct
25 Correct 120 ms 135368 KB Output is correct
26 Correct 146 ms 136464 KB Output is correct
27 Correct 119 ms 135840 KB Output is correct
28 Correct 127 ms 135928 KB Output is correct
29 Correct 168 ms 136464 KB Output is correct
30 Correct 144 ms 135980 KB Output is correct
31 Correct 189 ms 135756 KB Output is correct
32 Correct 220 ms 135896 KB Output is correct
33 Correct 415 ms 136116 KB Output is correct
34 Correct 1269 ms 135800 KB Output is correct
35 Correct 441 ms 135928 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 836 ms 1043288 KB Output is correct
3 Correct 663 ms 1044464 KB Output is correct
4 Correct 770 ms 1045864 KB Output is correct
5 Correct 745 ms 1045920 KB Output is correct
6 Correct 757 ms 1044312 KB Output is correct
7 Correct 728 ms 1042604 KB Output is correct
8 Correct 4 ms 7364 KB Output is correct
9 Correct 154 ms 136472 KB Output is correct
10 Correct 123 ms 136560 KB Output is correct
11 Correct 107 ms 135996 KB Output is correct
12 Correct 103 ms 135896 KB Output is correct
13 Correct 172 ms 136108 KB Output is correct
14 Correct 177 ms 136012 KB Output is correct
15 Correct 109 ms 135824 KB Output is correct
16 Correct 109 ms 135756 KB Output is correct
17 Correct 116 ms 135656 KB Output is correct
18 Correct 113 ms 136032 KB Output is correct
19 Correct 183 ms 136144 KB Output is correct
20 Correct 185 ms 136020 KB Output is correct
21 Correct 5 ms 7252 KB Output is correct
22 Correct 129 ms 136248 KB Output is correct
23 Correct 151 ms 136480 KB Output is correct
24 Correct 115 ms 135924 KB Output is correct
25 Correct 138 ms 135980 KB Output is correct
26 Correct 161 ms 136124 KB Output is correct
27 Correct 155 ms 135752 KB Output is correct
28 Correct 153 ms 135868 KB Output is correct
29 Correct 112 ms 135876 KB Output is correct
30 Correct 121 ms 136040 KB Output is correct
31 Correct 254 ms 136088 KB Output is correct
32 Correct 120 ms 135368 KB Output is correct
33 Correct 146 ms 136464 KB Output is correct
34 Correct 119 ms 135840 KB Output is correct
35 Correct 127 ms 135928 KB Output is correct
36 Correct 168 ms 136464 KB Output is correct
37 Correct 144 ms 135980 KB Output is correct
38 Correct 189 ms 135756 KB Output is correct
39 Correct 220 ms 135896 KB Output is correct
40 Correct 415 ms 136116 KB Output is correct
41 Correct 1269 ms 135800 KB Output is correct
42 Correct 441 ms 135928 KB Output is correct
43 Correct 3 ms 4660 KB Output is correct
44 Correct 4 ms 7364 KB Output is correct
45 Correct 1116 ms 1049092 KB Output is correct
46 Correct 786 ms 1044464 KB Output is correct
47 Correct 762 ms 1044844 KB Output is correct
48 Correct 714 ms 1047084 KB Output is correct
49 Correct 1149 ms 1049076 KB Output is correct
50 Correct 782 ms 1046596 KB Output is correct
51 Correct 687 ms 1046960 KB Output is correct
52 Correct 753 ms 1044780 KB Output is correct
53 Correct 1107 ms 1044640 KB Output is correct
54 Correct 1499 ms 1043640 KB Output is correct
55 Correct 2196 ms 1042432 KB Output is correct
56 Correct 1453 ms 1041932 KB Output is correct
57 Correct 2488 ms 1041172 KB Output is correct
58 Correct 1786 ms 1038780 KB Output is correct
59 Correct 1764 ms 1038700 KB Output is correct
60 Correct 1351 ms 1038300 KB Output is correct
61 Correct 1165 ms 1037512 KB Output is correct