oj.uz

Submission #437144

# Submission time Handle Problem Language Result Execution time Memory
437144 2021-06-25T22:57:38 Z jeroenodb Dungeons Game (IOI21_dungeons) C++17
100 / 100
 4198 ms 179532 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 = 7000;
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 80 ms 22624 KB Output is correct
5 Correct 2 ms 1100 KB Output is correct
6 Correct 72 ms 22620 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 709 ms 179508 KB Output is correct
3 Correct 690 ms 179504 KB Output is correct
4 Correct 629 ms 179504 KB Output is correct
5 Correct 651 ms 179508 KB Output is correct
6 Correct 949 ms 179508 KB Output is correct
7 Correct 1072 ms 179516 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 108 ms 23424 KB Output is correct
3 Correct 111 ms 23412 KB Output is correct
4 Correct 116 ms 23364 KB Output is correct
5 Correct 118 ms 23508 KB Output is correct
6 Correct 151 ms 23388 KB Output is correct
7 Correct 663 ms 23388 KB Output is correct
8 Correct 186 ms 23368 KB Output is correct
9 Correct 102 ms 23384 KB Output is correct
10 Correct 336 ms 23380 KB Output is correct
11 Correct 3873 ms 23408 KB Output is correct
12 Correct 4099 ms 23308 KB Output is correct
13 Correct 1171 ms 23384 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 108 ms 23424 KB Output is correct
3 Correct 111 ms 23412 KB Output is correct
4 Correct 116 ms 23364 KB Output is correct
5 Correct 118 ms 23508 KB Output is correct
6 Correct 151 ms 23388 KB Output is correct
7 Correct 663 ms 23388 KB Output is correct
8 Correct 186 ms 23368 KB Output is correct
9 Correct 102 ms 23384 KB Output is correct
10 Correct 336 ms 23380 KB Output is correct
11 Correct 3873 ms 23408 KB Output is correct
12 Correct 4099 ms 23308 KB Output is correct
13 Correct 1171 ms 23384 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 132 ms 23512 KB Output is correct
16 Correct 143 ms 23364 KB Output is correct
17 Correct 113 ms 23424 KB Output is correct
18 Correct 129 ms 23540 KB Output is correct
19 Correct 162 ms 23384 KB Output is correct
20 Correct 170 ms 23380 KB Output is correct
21 Correct 109 ms 23364 KB Output is correct
22 Correct 1585 ms 23512 KB Output is correct
23 Correct 4198 ms 23364 KB Output is correct
24 Correct 1805 ms 23364 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 108 ms 23424 KB Output is correct
3 Correct 111 ms 23412 KB Output is correct
4 Correct 116 ms 23364 KB Output is correct
5 Correct 118 ms 23508 KB Output is correct
6 Correct 151 ms 23388 KB Output is correct
7 Correct 663 ms 23388 KB Output is correct
8 Correct 186 ms 23368 KB Output is correct
9 Correct 102 ms 23384 KB Output is correct
10 Correct 336 ms 23380 KB Output is correct
11 Correct 3873 ms 23408 KB Output is correct
12 Correct 4099 ms 23308 KB Output is correct
13 Correct 1171 ms 23384 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 132 ms 23512 KB Output is correct
16 Correct 143 ms 23364 KB Output is correct
17 Correct 113 ms 23424 KB Output is correct
18 Correct 129 ms 23540 KB Output is correct
19 Correct 162 ms 23384 KB Output is correct
20 Correct 170 ms 23380 KB Output is correct
21 Correct 109 ms 23364 KB Output is correct
22 Correct 1585 ms 23512 KB Output is correct
23 Correct 4198 ms 23364 KB Output is correct
24 Correct 1805 ms 23364 KB Output is correct
25 Correct 77 ms 22608 KB Output is correct
26 Correct 113 ms 23500 KB Output is correct
27 Correct 124 ms 23408 KB Output is correct
28 Correct 121 ms 23376 KB Output is correct
29 Correct 120 ms 23416 KB Output is correct
30 Correct 236 ms 23376 KB Output is correct
31 Correct 255 ms 23408 KB Output is correct
32 Correct 1097 ms 23364 KB Output is correct
33 Correct 292 ms 23368 KB Output is correct
34 Correct 1288 ms 23404 KB Output is correct
35 Correct 951 ms 23452 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 709 ms 179508 KB Output is correct
3 Correct 690 ms 179504 KB Output is correct
4 Correct 629 ms 179504 KB Output is correct
5 Correct 651 ms 179508 KB Output is correct
6 Correct 949 ms 179508 KB Output is correct
7 Correct 1072 ms 179516 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 108 ms 23424 KB Output is correct
10 Correct 111 ms 23412 KB Output is correct
11 Correct 116 ms 23364 KB Output is correct
12 Correct 118 ms 23508 KB Output is correct
13 Correct 151 ms 23388 KB Output is correct
14 Correct 663 ms 23388 KB Output is correct
15 Correct 186 ms 23368 KB Output is correct
16 Correct 102 ms 23384 KB Output is correct
17 Correct 336 ms 23380 KB Output is correct
18 Correct 3873 ms 23408 KB Output is correct
19 Correct 4099 ms 23308 KB Output is correct
20 Correct 1171 ms 23384 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 132 ms 23512 KB Output is correct
23 Correct 143 ms 23364 KB Output is correct
24 Correct 113 ms 23424 KB Output is correct
25 Correct 129 ms 23540 KB Output is correct
26 Correct 162 ms 23384 KB Output is correct
27 Correct 170 ms 23380 KB Output is correct
28 Correct 109 ms 23364 KB Output is correct
29 Correct 1585 ms 23512 KB Output is correct
30 Correct 4198 ms 23364 KB Output is correct
31 Correct 1805 ms 23364 KB Output is correct
32 Correct 77 ms 22608 KB Output is correct
33 Correct 113 ms 23500 KB Output is correct
34 Correct 124 ms 23408 KB Output is correct
35 Correct 121 ms 23376 KB Output is correct
36 Correct 120 ms 23416 KB Output is correct
37 Correct 236 ms 23376 KB Output is correct
38 Correct 255 ms 23408 KB Output is correct
39 Correct 1097 ms 23364 KB Output is correct
40 Correct 292 ms 23368 KB Output is correct
41 Correct 1288 ms 23404 KB Output is correct
42 Correct 951 ms 23452 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 2 ms 716 KB Output is correct
45 Correct 849 ms 179516 KB Output is correct
46 Correct 656 ms 179504 KB Output is correct
47 Correct 643 ms 179512 KB Output is correct
48 Correct 675 ms 179532 KB Output is correct
49 Correct 881 ms 179508 KB Output is correct
50 Correct 822 ms 179508 KB Output is correct
51 Correct 656 ms 179520 KB Output is correct
52 Correct 846 ms 179504 KB Output is correct
53 Correct 3791 ms 179508 KB Output is correct
54 Correct 1290 ms 179524 KB Output is correct
55 Correct 2930 ms 179508 KB Output is correct
56 Correct 3277 ms 179512 KB Output is correct
57 Correct 2957 ms 179512 KB Output is correct
58 Correct 2468 ms 179520 KB Output is correct
59 Correct 2247 ms 179528 KB Output is correct
60 Correct 2651 ms 179508 KB Output is correct
61 Correct 2471 ms 179508 KB Output is correct