oj.uz

Submission #444294

# Submission time Handle Problem Language Result Execution time Memory
444294 2021-07-13T14:07:25 Z hhhhaura Dungeons Game (IOI21_dungeons) C++17
100 / 100
 3579 ms 2011480 KB 
#include "dungeons.h"
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))

#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)

using namespace std;

#define ll long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

#ifdef wiwihorz
#define print(a...) cerr << "Line " << __LINE__ << ": ", kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
void kout() {cerr << endl;}
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif
int N, K = 5, sz, lg;
ll cur; 
vector<ll> P;
vector<int> S, W;
vector<vector<int>> to[20];
vector<vector<ll>> ge[20], lim[20];
void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
	N = n, sz = 0, lg = 20, cur = 1, S = s, W = w;
	while(cur < 1e7) sz ++, cur = cur * K;
	P.assign(sz + 2, 1), P[sz + 1] = INF;
	rep(i, 1, sz) P[i] = P[i - 1] * K; 
	rep(seg, 0, sz) {
		int L = P[seg];
		to[seg].assign(lg + 1, vector<int>(n + 1, n));
		ge[seg].assign(lg + 1, vector<ll>(n + 1, 0ll));
		lim[seg].assign(lg + 1, vector<ll>(n + 1, INF));
		rep(i, 0, n - 1) {
			if(s[i] < L) {
				to[seg][0][i] = w[i];
				ge[seg][0][i] = s[i];
				lim[seg][0][i] = INF;
			}
			else {
				to[seg][0][i] = l[i];
				ge[seg][0][i] = p[i];
				lim[seg][0][i] = s[i];
			}
		}
		rep(i, 1, lg) rep(j, 0, n) {
			to[seg][i][j] = to[seg][i - 1][to[seg][i - 1][j]];
			ge[seg][i][j] = ge[seg][i - 1][j] + ge[seg][i - 1][to[seg][i - 1][j]];
			lim[seg][i][j] = min(lim[seg][i - 1][j], 
				lim[seg][i - 1][to[seg][i - 1][j]] - ge[seg][i - 1][j]);
		}
	}
	return;
}
pair<int, ll> go(int id, int x, ll z) {
	rrep(i, 0, lg) {
		if(lim[id][i][x] > z) {
			z += ge[id][i][x];
			x = to[id][i][x];
		}
	}
	if(x == N) return {x, z};
	if(z >= S[x]) z += S[x], x = W[x];
	return {x, z};
} 
ll simulate(int x, int z) {
	ll cost = z;
	rep(i, 0, sz) {
		while(cost < P[i + 1]) {
			tie(x, cost) = go(i, x, cost);
			if(x == N) return cost;
		}
	}
	assert(x == N);
	return cost;
}

Compilation message

dungeons.cpp:5: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    5 | #pragma loop-opt(on)
      | 
dungeons.cpp:25:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   25 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |             ^~~~
dungeons.cpp:25:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   25 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |                     ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 8 ms 10316 KB Output is correct
4 Correct 198 ms 251540 KB Output is correct
5 Correct 8 ms 10236 KB Output is correct
6 Correct 219 ms 251608 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5324 KB Output is correct
2 Correct 1528 ms 2011356 KB Output is correct
3 Correct 1599 ms 2011244 KB Output is correct
4 Correct 1521 ms 2011320 KB Output is correct
5 Correct 1715 ms 2011264 KB Output is correct
6 Correct 1638 ms 2011444 KB Output is correct
7 Correct 1641 ms 2011480 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5324 KB Output is correct
2 Correct 275 ms 252380 KB Output is correct
3 Correct 254 ms 252288 KB Output is correct
4 Correct 214 ms 252352 KB Output is correct
5 Correct 217 ms 252324 KB Output is correct
6 Correct 314 ms 252404 KB Output is correct
7 Correct 462 ms 252372 KB Output is correct
8 Correct 225 ms 252348 KB Output is correct
9 Correct 252 ms 252348 KB Output is correct
10 Correct 245 ms 252376 KB Output is correct
11 Correct 243 ms 252284 KB Output is correct
12 Correct 943 ms 252340 KB Output is correct
13 Correct 787 ms 252536 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5324 KB Output is correct
2 Correct 275 ms 252380 KB Output is correct
3 Correct 254 ms 252288 KB Output is correct
4 Correct 214 ms 252352 KB Output is correct
5 Correct 217 ms 252324 KB Output is correct
6 Correct 314 ms 252404 KB Output is correct
7 Correct 462 ms 252372 KB Output is correct
8 Correct 225 ms 252348 KB Output is correct
9 Correct 252 ms 252348 KB Output is correct
10 Correct 245 ms 252376 KB Output is correct
11 Correct 243 ms 252284 KB Output is correct
12 Correct 943 ms 252340 KB Output is correct
13 Correct 787 ms 252536 KB Output is correct
14 Correct 4 ms 5324 KB Output is correct
15 Correct 248 ms 252396 KB Output is correct
16 Correct 267 ms 252284 KB Output is correct
17 Correct 233 ms 252296 KB Output is correct
18 Correct 237 ms 252372 KB Output is correct
19 Correct 319 ms 252360 KB Output is correct
20 Correct 268 ms 252312 KB Output is correct
21 Correct 278 ms 252376 KB Output is correct
22 Correct 247 ms 252408 KB Output is correct
23 Correct 265 ms 252344 KB Output is correct
24 Correct 365 ms 252388 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5324 KB Output is correct
2 Correct 275 ms 252380 KB Output is correct
3 Correct 254 ms 252288 KB Output is correct
4 Correct 214 ms 252352 KB Output is correct
5 Correct 217 ms 252324 KB Output is correct
6 Correct 314 ms 252404 KB Output is correct
7 Correct 462 ms 252372 KB Output is correct
8 Correct 225 ms 252348 KB Output is correct
9 Correct 252 ms 252348 KB Output is correct
10 Correct 245 ms 252376 KB Output is correct
11 Correct 243 ms 252284 KB Output is correct
12 Correct 943 ms 252340 KB Output is correct
13 Correct 787 ms 252536 KB Output is correct
14 Correct 4 ms 5324 KB Output is correct
15 Correct 248 ms 252396 KB Output is correct
16 Correct 267 ms 252284 KB Output is correct
17 Correct 233 ms 252296 KB Output is correct
18 Correct 237 ms 252372 KB Output is correct
19 Correct 319 ms 252360 KB Output is correct
20 Correct 268 ms 252312 KB Output is correct
21 Correct 278 ms 252376 KB Output is correct
22 Correct 247 ms 252408 KB Output is correct
23 Correct 265 ms 252344 KB Output is correct
24 Correct 365 ms 252388 KB Output is correct
25 Correct 207 ms 251580 KB Output is correct
26 Correct 274 ms 252396 KB Output is correct
27 Correct 255 ms 252360 KB Output is correct
28 Correct 277 ms 252292 KB Output is correct
29 Correct 297 ms 252292 KB Output is correct
30 Correct 304 ms 252284 KB Output is correct
31 Correct 290 ms 252356 KB Output is correct
32 Correct 445 ms 252368 KB Output is correct
33 Correct 964 ms 252284 KB Output is correct
34 Correct 1439 ms 252280 KB Output is correct
35 Correct 613 ms 252380 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5324 KB Output is correct
2 Correct 1528 ms 2011356 KB Output is correct
3 Correct 1599 ms 2011244 KB Output is correct
4 Correct 1521 ms 2011320 KB Output is correct
5 Correct 1715 ms 2011264 KB Output is correct
6 Correct 1638 ms 2011444 KB Output is correct
7 Correct 1641 ms 2011480 KB Output is correct
8 Correct 5 ms 5324 KB Output is correct
9 Correct 275 ms 252380 KB Output is correct
10 Correct 254 ms 252288 KB Output is correct
11 Correct 214 ms 252352 KB Output is correct
12 Correct 217 ms 252324 KB Output is correct
13 Correct 314 ms 252404 KB Output is correct
14 Correct 462 ms 252372 KB Output is correct
15 Correct 225 ms 252348 KB Output is correct
16 Correct 252 ms 252348 KB Output is correct
17 Correct 245 ms 252376 KB Output is correct
18 Correct 243 ms 252284 KB Output is correct
19 Correct 943 ms 252340 KB Output is correct
20 Correct 787 ms 252536 KB Output is correct
21 Correct 4 ms 5324 KB Output is correct
22 Correct 248 ms 252396 KB Output is correct
23 Correct 267 ms 252284 KB Output is correct
24 Correct 233 ms 252296 KB Output is correct
25 Correct 237 ms 252372 KB Output is correct
26 Correct 319 ms 252360 KB Output is correct
27 Correct 268 ms 252312 KB Output is correct
28 Correct 278 ms 252376 KB Output is correct
29 Correct 247 ms 252408 KB Output is correct
30 Correct 265 ms 252344 KB Output is correct
31 Correct 365 ms 252388 KB Output is correct
32 Correct 207 ms 251580 KB Output is correct
33 Correct 274 ms 252396 KB Output is correct
34 Correct 255 ms 252360 KB Output is correct
35 Correct 277 ms 252292 KB Output is correct
36 Correct 297 ms 252292 KB Output is correct
37 Correct 304 ms 252284 KB Output is correct
38 Correct 290 ms 252356 KB Output is correct
39 Correct 445 ms 252368 KB Output is correct
40 Correct 964 ms 252284 KB Output is correct
41 Correct 1439 ms 252280 KB Output is correct
42 Correct 613 ms 252380 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 5 ms 5324 KB Output is correct
45 Correct 2097 ms 2011296 KB Output is correct
46 Correct 1803 ms 2011324 KB Output is correct
47 Correct 1805 ms 2011372 KB Output is correct
48 Correct 1747 ms 2011252 KB Output is correct
49 Correct 2285 ms 2011372 KB Output is correct
50 Correct 1635 ms 2011248 KB Output is correct
51 Correct 1637 ms 2011248 KB Output is correct
52 Correct 1570 ms 2011264 KB Output is correct
53 Correct 2920 ms 2011244 KB Output is correct
54 Correct 2672 ms 2011252 KB Output is correct
55 Correct 3038 ms 1995736 KB Output is correct
56 Correct 2958 ms 2011260 KB Output is correct
57 Correct 3136 ms 2011364 KB Output is correct
58 Correct 3406 ms 2011332 KB Output is correct
59 Correct 3579 ms 2011276 KB Output is correct
60 Correct 2551 ms 2011392 KB Output is correct
61 Correct 2285 ms 2011384 KB Output is correct