/*************************************
* 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 long long INF = 1e18;
const int MAX = 4e5 + 5;
int N;
vector <int> S, P, W, L;
int nxt[NT][LOG][MAX];
long long add[NT][LOG][MAX], threshold[NT][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;
REP(t, NT) {
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];
threshold[t][k][i] = min(threshold[t][k - 1][i], threshold[t][k - 1][m] - add[t][k - 1][i]);
}
}
}
long long simulate(int x, int zz) {
long long z = zz;
REP(t, NT) {
REP(love, MASK(T) - 1) {
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 >= MASK(t * T + T)) break;
if (z >= S[x]) {
z += S[x];
x = W[x];
} else {
z += P[x];
x = L[x];
}
}
}
return z;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
5436 KB |
Output is correct |
2 |
Correct |
2 ms |
5460 KB |
Output is correct |
3 |
Correct |
7 ms |
14404 KB |
Output is correct |
4 |
Correct |
112 ms |
228920 KB |
Output is correct |
5 |
Correct |
7 ms |
14336 KB |
Output is correct |
6 |
Correct |
114 ms |
228704 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
9940 KB |
Output is correct |
2 |
Correct |
1483 ms |
1786020 KB |
Output is correct |
3 |
Correct |
1141 ms |
1787972 KB |
Output is correct |
4 |
Correct |
1176 ms |
1789584 KB |
Output is correct |
5 |
Correct |
1289 ms |
1789500 KB |
Output is correct |
6 |
Correct |
1231 ms |
1788052 KB |
Output is correct |
7 |
Correct |
1251 ms |
1786168 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
9940 KB |
Output is correct |
2 |
Correct |
445 ms |
230320 KB |
Output is correct |
3 |
Correct |
382 ms |
230420 KB |
Output is correct |
4 |
Correct |
169 ms |
229772 KB |
Output is correct |
5 |
Correct |
198 ms |
229680 KB |
Output is correct |
6 |
Correct |
413 ms |
229952 KB |
Output is correct |
7 |
Correct |
387 ms |
229920 KB |
Output is correct |
8 |
Correct |
199 ms |
229580 KB |
Output is correct |
9 |
Correct |
180 ms |
229656 KB |
Output is correct |
10 |
Correct |
160 ms |
229496 KB |
Output is correct |
11 |
Correct |
170 ms |
229948 KB |
Output is correct |
12 |
Correct |
471 ms |
229972 KB |
Output is correct |
13 |
Correct |
419 ms |
229956 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
9940 KB |
Output is correct |
2 |
Correct |
445 ms |
230320 KB |
Output is correct |
3 |
Correct |
382 ms |
230420 KB |
Output is correct |
4 |
Correct |
169 ms |
229772 KB |
Output is correct |
5 |
Correct |
198 ms |
229680 KB |
Output is correct |
6 |
Correct |
413 ms |
229952 KB |
Output is correct |
7 |
Correct |
387 ms |
229920 KB |
Output is correct |
8 |
Correct |
199 ms |
229580 KB |
Output is correct |
9 |
Correct |
180 ms |
229656 KB |
Output is correct |
10 |
Correct |
160 ms |
229496 KB |
Output is correct |
11 |
Correct |
170 ms |
229948 KB |
Output is correct |
12 |
Correct |
471 ms |
229972 KB |
Output is correct |
13 |
Correct |
419 ms |
229956 KB |
Output is correct |
14 |
Correct |
7 ms |
9972 KB |
Output is correct |
15 |
Correct |
316 ms |
230088 KB |
Output is correct |
16 |
Correct |
410 ms |
230344 KB |
Output is correct |
17 |
Correct |
271 ms |
229820 KB |
Output is correct |
18 |
Correct |
302 ms |
229844 KB |
Output is correct |
19 |
Correct |
383 ms |
229936 KB |
Output is correct |
20 |
Correct |
290 ms |
229632 KB |
Output is correct |
21 |
Correct |
294 ms |
229784 KB |
Output is correct |
22 |
Correct |
185 ms |
229728 KB |
Output is correct |
23 |
Correct |
180 ms |
229964 KB |
Output is correct |
24 |
Correct |
492 ms |
229916 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
9940 KB |
Output is correct |
2 |
Correct |
445 ms |
230320 KB |
Output is correct |
3 |
Correct |
382 ms |
230420 KB |
Output is correct |
4 |
Correct |
169 ms |
229772 KB |
Output is correct |
5 |
Correct |
198 ms |
229680 KB |
Output is correct |
6 |
Correct |
413 ms |
229952 KB |
Output is correct |
7 |
Correct |
387 ms |
229920 KB |
Output is correct |
8 |
Correct |
199 ms |
229580 KB |
Output is correct |
9 |
Correct |
180 ms |
229656 KB |
Output is correct |
10 |
Correct |
160 ms |
229496 KB |
Output is correct |
11 |
Correct |
170 ms |
229948 KB |
Output is correct |
12 |
Correct |
471 ms |
229972 KB |
Output is correct |
13 |
Correct |
419 ms |
229956 KB |
Output is correct |
14 |
Correct |
7 ms |
9972 KB |
Output is correct |
15 |
Correct |
316 ms |
230088 KB |
Output is correct |
16 |
Correct |
410 ms |
230344 KB |
Output is correct |
17 |
Correct |
271 ms |
229820 KB |
Output is correct |
18 |
Correct |
302 ms |
229844 KB |
Output is correct |
19 |
Correct |
383 ms |
229936 KB |
Output is correct |
20 |
Correct |
290 ms |
229632 KB |
Output is correct |
21 |
Correct |
294 ms |
229784 KB |
Output is correct |
22 |
Correct |
185 ms |
229728 KB |
Output is correct |
23 |
Correct |
180 ms |
229964 KB |
Output is correct |
24 |
Correct |
492 ms |
229916 KB |
Output is correct |
25 |
Correct |
141 ms |
229220 KB |
Output is correct |
26 |
Correct |
387 ms |
230312 KB |
Output is correct |
27 |
Correct |
254 ms |
229684 KB |
Output is correct |
28 |
Correct |
249 ms |
229816 KB |
Output is correct |
29 |
Correct |
382 ms |
230216 KB |
Output is correct |
30 |
Correct |
261 ms |
229904 KB |
Output is correct |
31 |
Correct |
262 ms |
229592 KB |
Output is correct |
32 |
Correct |
461 ms |
229760 KB |
Output is correct |
33 |
Correct |
748 ms |
229840 KB |
Output is correct |
34 |
Correct |
1469 ms |
229648 KB |
Output is correct |
35 |
Correct |
777 ms |
229796 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
9940 KB |
Output is correct |
2 |
Correct |
1483 ms |
1786020 KB |
Output is correct |
3 |
Correct |
1141 ms |
1787972 KB |
Output is correct |
4 |
Correct |
1176 ms |
1789584 KB |
Output is correct |
5 |
Correct |
1289 ms |
1789500 KB |
Output is correct |
6 |
Correct |
1231 ms |
1788052 KB |
Output is correct |
7 |
Correct |
1251 ms |
1786168 KB |
Output is correct |
8 |
Correct |
6 ms |
9940 KB |
Output is correct |
9 |
Correct |
445 ms |
230320 KB |
Output is correct |
10 |
Correct |
382 ms |
230420 KB |
Output is correct |
11 |
Correct |
169 ms |
229772 KB |
Output is correct |
12 |
Correct |
198 ms |
229680 KB |
Output is correct |
13 |
Correct |
413 ms |
229952 KB |
Output is correct |
14 |
Correct |
387 ms |
229920 KB |
Output is correct |
15 |
Correct |
199 ms |
229580 KB |
Output is correct |
16 |
Correct |
180 ms |
229656 KB |
Output is correct |
17 |
Correct |
160 ms |
229496 KB |
Output is correct |
18 |
Correct |
170 ms |
229948 KB |
Output is correct |
19 |
Correct |
471 ms |
229972 KB |
Output is correct |
20 |
Correct |
419 ms |
229956 KB |
Output is correct |
21 |
Correct |
7 ms |
9972 KB |
Output is correct |
22 |
Correct |
316 ms |
230088 KB |
Output is correct |
23 |
Correct |
410 ms |
230344 KB |
Output is correct |
24 |
Correct |
271 ms |
229820 KB |
Output is correct |
25 |
Correct |
302 ms |
229844 KB |
Output is correct |
26 |
Correct |
383 ms |
229936 KB |
Output is correct |
27 |
Correct |
290 ms |
229632 KB |
Output is correct |
28 |
Correct |
294 ms |
229784 KB |
Output is correct |
29 |
Correct |
185 ms |
229728 KB |
Output is correct |
30 |
Correct |
180 ms |
229964 KB |
Output is correct |
31 |
Correct |
492 ms |
229916 KB |
Output is correct |
32 |
Correct |
141 ms |
229220 KB |
Output is correct |
33 |
Correct |
387 ms |
230312 KB |
Output is correct |
34 |
Correct |
254 ms |
229684 KB |
Output is correct |
35 |
Correct |
249 ms |
229816 KB |
Output is correct |
36 |
Correct |
382 ms |
230216 KB |
Output is correct |
37 |
Correct |
261 ms |
229904 KB |
Output is correct |
38 |
Correct |
262 ms |
229592 KB |
Output is correct |
39 |
Correct |
461 ms |
229760 KB |
Output is correct |
40 |
Correct |
748 ms |
229840 KB |
Output is correct |
41 |
Correct |
1469 ms |
229648 KB |
Output is correct |
42 |
Correct |
777 ms |
229796 KB |
Output is correct |
43 |
Correct |
3 ms |
5460 KB |
Output is correct |
44 |
Correct |
6 ms |
9980 KB |
Output is correct |
45 |
Correct |
1550 ms |
1792736 KB |
Output is correct |
46 |
Correct |
1094 ms |
1788092 KB |
Output is correct |
47 |
Correct |
1073 ms |
1788444 KB |
Output is correct |
48 |
Correct |
1112 ms |
1790720 KB |
Output is correct |
49 |
Correct |
1379 ms |
1792872 KB |
Output is correct |
50 |
Correct |
1030 ms |
1790344 KB |
Output is correct |
51 |
Correct |
975 ms |
1790860 KB |
Output is correct |
52 |
Correct |
1034 ms |
1788356 KB |
Output is correct |
53 |
Correct |
1787 ms |
1789204 KB |
Output is correct |
54 |
Correct |
1878 ms |
1790328 KB |
Output is correct |
55 |
Correct |
2453 ms |
1789232 KB |
Output is correct |
56 |
Correct |
2044 ms |
1789860 KB |
Output is correct |
57 |
Correct |
2792 ms |
1790104 KB |
Output is correct |
58 |
Correct |
2686 ms |
1790088 KB |
Output is correct |
59 |
Correct |
2670 ms |
1790176 KB |
Output is correct |
60 |
Correct |
2052 ms |
1789348 KB |
Output is correct |
61 |
Correct |
1894 ms |
1789532 KB |
Output is correct |