oj.uz

Submission #437147

# Submission time Handle Problem Language Result Execution time Memory
437147 2021-06-25T23:01:19 Z jeroenodb Dungeons Game (IOI21_dungeons) C++17
100 / 100
 4482 ms 179556 KB 
#ifndef GRADER
#include "dungeons.h"
#endif
#pragma GCC optimize "Ofast"
#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 4e5+10, oo = 1e8;
const int LOG = 25;
int jmp[mxN][LOG], mn[mxN][LOG];
ll sm[mxN][LOG];
static int N;
const int B = 8000;
vi S,P,W,L;
ll prefsum[mxN] = {};
void init(int n, vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
	S=s,P=p,W=w,L=l;
	N=n;
	jmp[n][0]=n;
	mn[n][0]=0;
	sm[n][0]=oo;
	for(int j=0;j<n;++j) {
		if(s[j]>=B) {
			jmp[j][0] = l[j], sm[j][0]=p[j];
		} else jmp[j][0] = w[j], sm[j][0] = s[j];
		mn[j][0] = (s[j]>=B?s[j]:oo);
	}

	for(int i=1;i<LOG;++i) {
		for(int j=0;j<=n;++j) {
			jmp[j][i] = jmp[jmp[j][i-1]][i-1];
			mn[j][i] = max(0LL,min((ll)mn[j][i-1],mn[jmp[j][i-1]][i-1]-sm[j][i-1]));
			sm[j][i] = sm[j][i-1]+sm[jmp[j][i-1]][i-1];
		}
	}
	for(int i=n-1;i>=0;--i) {
		prefsum[i]=S[i]+prefsum[W[i]];
	}
}

long long mysimulate(int x, ll z) {
	int n = N;
	while(z<B) {
		if(x==n) return z;
		if(z>=S[x]) {
			z+=S[x];
			x=W[x];
		} else {
			z+=P[x];
			x=L[x];
		}
	}
	// find next x: S[x]>z, can only happen log times
	// what if P[x] is very small?
	const int mxS = int(1e7);
	while(x!=n and z<mxS) {
		for(int i=LOG-1;i>=0 and z<mxS and x!=n;--i) {
			if(mn[x][i]>z) {
				z+=sm[x][i];
				x=jmp[x][i];
			}
		}
		if(x==n or z>=mxS) break;
		assert(S[x]>=B and z>=S[x]);
		if(z>=S[x]) {
			z+=S[x];
			x=W[x];
		} else {
			z+=P[x];
			x=L[x];
		}
	}
	return prefsum[x]+z;
}
long long simulate(int x, int z) {
	return mysimulate(x,z);	
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 1100 KB Output is correct
4 Correct 76 ms 22620 KB Output is correct
5 Correct 2 ms 1100 KB Output is correct
6 Correct 72 ms 22624 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 708 ms 179524 KB Output is correct
3 Correct 686 ms 179524 KB Output is correct
4 Correct 650 ms 179524 KB Output is correct
5 Correct 667 ms 179508 KB Output is correct
6 Correct 948 ms 179512 KB Output is correct
7 Correct 1127 ms 179504 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 114 ms 23364 KB Output is correct
3 Correct 106 ms 23380 KB Output is correct
4 Correct 118 ms 23456 KB Output is correct
5 Correct 112 ms 23356 KB Output is correct
6 Correct 157 ms 23408 KB Output is correct
7 Correct 750 ms 23364 KB Output is correct
8 Correct 187 ms 23384 KB Output is correct
9 Correct 99 ms 23408 KB Output is correct
10 Correct 376 ms 23364 KB Output is correct
11 Correct 4397 ms 23388 KB Output is correct
12 Correct 4448 ms 23492 KB Output is correct
13 Correct 1270 ms 23364 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 114 ms 23364 KB Output is correct
3 Correct 106 ms 23380 KB Output is correct
4 Correct 118 ms 23456 KB Output is correct
5 Correct 112 ms 23356 KB Output is correct
6 Correct 157 ms 23408 KB Output is correct
7 Correct 750 ms 23364 KB Output is correct
8 Correct 187 ms 23384 KB Output is correct
9 Correct 99 ms 23408 KB Output is correct
10 Correct 376 ms 23364 KB Output is correct
11 Correct 4397 ms 23388 KB Output is correct
12 Correct 4448 ms 23492 KB Output is correct
13 Correct 1270 ms 23364 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 111 ms 23500 KB Output is correct
16 Correct 113 ms 23380 KB Output is correct
17 Correct 119 ms 23364 KB Output is correct
18 Correct 127 ms 23424 KB Output is correct
19 Correct 163 ms 23416 KB Output is correct
20 Correct 162 ms 23420 KB Output is correct
21 Correct 110 ms 23520 KB Output is correct
22 Correct 1709 ms 23364 KB Output is correct
23 Correct 4482 ms 23456 KB Output is correct
24 Correct 2193 ms 23408 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 114 ms 23364 KB Output is correct
3 Correct 106 ms 23380 KB Output is correct
4 Correct 118 ms 23456 KB Output is correct
5 Correct 112 ms 23356 KB Output is correct
6 Correct 157 ms 23408 KB Output is correct
7 Correct 750 ms 23364 KB Output is correct
8 Correct 187 ms 23384 KB Output is correct
9 Correct 99 ms 23408 KB Output is correct
10 Correct 376 ms 23364 KB Output is correct
11 Correct 4397 ms 23388 KB Output is correct
12 Correct 4448 ms 23492 KB Output is correct
13 Correct 1270 ms 23364 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 111 ms 23500 KB Output is correct
16 Correct 113 ms 23380 KB Output is correct
17 Correct 119 ms 23364 KB Output is correct
18 Correct 127 ms 23424 KB Output is correct
19 Correct 163 ms 23416 KB Output is correct
20 Correct 162 ms 23420 KB Output is correct
21 Correct 110 ms 23520 KB Output is correct
22 Correct 1709 ms 23364 KB Output is correct
23 Correct 4482 ms 23456 KB Output is correct
24 Correct 2193 ms 23408 KB Output is correct
25 Correct 80 ms 22744 KB Output is correct
26 Correct 115 ms 23364 KB Output is correct
27 Correct 118 ms 23412 KB Output is correct
28 Correct 114 ms 23360 KB Output is correct
29 Correct 117 ms 23412 KB Output is correct
30 Correct 225 ms 23532 KB Output is correct
31 Correct 276 ms 23408 KB Output is correct
32 Correct 1277 ms 23508 KB Output is correct
33 Correct 269 ms 23400 KB Output is correct
34 Correct 1181 ms 23384 KB Output is correct
35 Correct 898 ms 23384 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 708 ms 179524 KB Output is correct
3 Correct 686 ms 179524 KB Output is correct
4 Correct 650 ms 179524 KB Output is correct
5 Correct 667 ms 179508 KB Output is correct
6 Correct 948 ms 179512 KB Output is correct
7 Correct 1127 ms 179504 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 114 ms 23364 KB Output is correct
10 Correct 106 ms 23380 KB Output is correct
11 Correct 118 ms 23456 KB Output is correct
12 Correct 112 ms 23356 KB Output is correct
13 Correct 157 ms 23408 KB Output is correct
14 Correct 750 ms 23364 KB Output is correct
15 Correct 187 ms 23384 KB Output is correct
16 Correct 99 ms 23408 KB Output is correct
17 Correct 376 ms 23364 KB Output is correct
18 Correct 4397 ms 23388 KB Output is correct
19 Correct 4448 ms 23492 KB Output is correct
20 Correct 1270 ms 23364 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 111 ms 23500 KB Output is correct
23 Correct 113 ms 23380 KB Output is correct
24 Correct 119 ms 23364 KB Output is correct
25 Correct 127 ms 23424 KB Output is correct
26 Correct 163 ms 23416 KB Output is correct
27 Correct 162 ms 23420 KB Output is correct
28 Correct 110 ms 23520 KB Output is correct
29 Correct 1709 ms 23364 KB Output is correct
30 Correct 4482 ms 23456 KB Output is correct
31 Correct 2193 ms 23408 KB Output is correct
32 Correct 80 ms 22744 KB Output is correct
33 Correct 115 ms 23364 KB Output is correct
34 Correct 118 ms 23412 KB Output is correct
35 Correct 114 ms 23360 KB Output is correct
36 Correct 117 ms 23412 KB Output is correct
37 Correct 225 ms 23532 KB Output is correct
38 Correct 276 ms 23408 KB Output is correct
39 Correct 1277 ms 23508 KB Output is correct
40 Correct 269 ms 23400 KB Output is correct
41 Correct 1181 ms 23384 KB Output is correct
42 Correct 898 ms 23384 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 2 ms 716 KB Output is correct
45 Correct 951 ms 179508 KB Output is correct
46 Correct 681 ms 179508 KB Output is correct
47 Correct 680 ms 179508 KB Output is correct
48 Correct 703 ms 179556 KB Output is correct
49 Correct 950 ms 179528 KB Output is correct
50 Correct 817 ms 179504 KB Output is correct
51 Correct 697 ms 179508 KB Output is correct
52 Correct 849 ms 179512 KB Output is correct
53 Correct 4033 ms 179508 KB Output is correct
54 Correct 1245 ms 179504 KB Output is correct
55 Correct 2654 ms 179508 KB Output is correct
56 Correct 2734 ms 179524 KB Output is correct
57 Correct 2715 ms 179524 KB Output is correct
58 Correct 2317 ms 179520 KB Output is correct
59 Correct 2225 ms 179508 KB Output is correct
60 Correct 2800 ms 179512 KB Output is correct
61 Correct 2683 ms 179508 KB Output is correct