oj.uz

Submission #852254

# Submission time Handle Problem Language Result Execution time Memory
852254 2023-09-21T13:42:59 Z alex_2008 Dungeons Game (IOI21_dungeons) C++17
100 / 100
 2621 ms 985296 KB 
#include "dungeons.h"
#include <bits/stdc++.h>
#define mindiff first
#define pos second.first
#define strength second.second
using namespace std;
const long long N = 4e5 + 10;
const long long M = 10000001;
const int INF = 1e7;
pair<int, pair<int, int>> dp[N][8][24];
long long NN;
vector <long long> ss, pp, ww, ll;
long long nxt[N];
int lg8[M];
bool ch = true;
void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
  	lg8[1] = 0;
  	for (int i = 1; i < 8; i++) {
  		lg8[i] = 0;
  	}
  	for (int i = 8; i < M; i++) {
		lg8[i] = lg8[i / 8] + 1;
    } 
  	NN = n;
	s.push_back(0);
	p.push_back(0);
	w.push_back(n);
	l.push_back(n);
	for (int i = 0; i <= n; i++) {
		ss.push_back(s[i]);
		if (w[i] != l[i]) ch = false;
    }
	nxt[n] = 0;
	for (int i = n - 1; i >= 0; i--) {
		nxt[i] = s[i] + nxt[w[i]];
	}
	for (int i = 0; i <= n; i++) {
		pp.push_back(p[i]);
	}
	for (int i = 0; i <= n; i++) {
		ww.push_back(w[i]);
	}
	for (int i = 0; i <= n; i++) {
		ll.push_back(l[i]);
	}
	for (int k = 0; k < 24; k++) {
		for (int i = 0; i <= n; i++) {
			for (int j = 0; j < 8; j++) {
				if (k == 0) {
					dp[i][j][k].pos = ((1 << (3 * j)) >= s[i]) ? w[i] : l[i];
					dp[i][j][k].strength = ((1 << (3 * j)) >= s[i]) ? s[i] : p[i];
					dp[i][j][k].mindiff = ((1 << (3 * j)) < s[i]) ? s[i] : INF;
				}
				else {
					int p = dp[i][j][k - 1].pos;
					dp[i][j][k].pos = dp[p][j][k - 1].pos;
					dp[i][j][k].strength = min(INF, dp[i][j][k - 1].strength + dp[p][j][k - 1].strength);
					dp[i][j][k].mindiff = max(0, min(dp[i][j][k - 1].mindiff, dp[p][j][k - 1].mindiff - dp[i][j][k - 1].strength));
				}
			}
		}
	}
}
long long simulate(int xx, int zz) {
	long long x = xx, z = zz;
	while (1) {
		if (z >= 10000000) {
			z += nxt[x];
			return z;
		}
		int v = (int)lg8[z];
		for (int k = 23; k >= 0; k--) {
			if (dp[x][v][k].pos == N || dp[x][v][k].mindiff <= z || (dp[x][v][k].strength + z >= 10000000) || lg8[dp[x][v][k].strength + z] > v) continue;
			z += dp[x][v][k].strength;
			x = dp[x][v][k].pos;
		}
		if (z >= ss[x]) {
			z += ss[x];
			x = ww[x];
		}
		else {
			z += pp[x];
			x = ll[x];
		}
		if (x == NN) return z;
	}
	return 0;
}
//int main() {
//	init(3, { 2, 6, 9 }, { 3, 1, 2 }, { 2, 2, 3 }, { 1, 0, 1 });
//	cout << simulate(0, 1) << "\n";
//	cout << simulate(2, 3) << "\n";
//}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 41564 KB Output is correct
2 Correct 11 ms 41564 KB Output is correct
3 Correct 14 ms 45912 KB Output is correct
4 Correct 144 ms 159832 KB Output is correct
5 Correct 13 ms 45916 KB Output is correct
6 Correct 150 ms 159832 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 43608 KB Output is correct
2 Correct 1708 ms 972240 KB Output is correct
3 Correct 1892 ms 980272 KB Output is correct
4 Correct 1852 ms 984980 KB Output is correct
5 Correct 1156 ms 981836 KB Output is correct
6 Correct 1937 ms 981576 KB Output is correct
7 Correct 1978 ms 977744 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 43612 KB Output is correct
2 Correct 187 ms 160504 KB Output is correct
3 Correct 191 ms 160616 KB Output is correct
4 Correct 215 ms 160616 KB Output is correct
5 Correct 206 ms 160620 KB Output is correct
6 Correct 200 ms 160492 KB Output is correct
7 Correct 194 ms 160456 KB Output is correct
8 Correct 309 ms 160616 KB Output is correct
9 Correct 161 ms 160620 KB Output is correct
10 Correct 285 ms 160456 KB Output is correct
11 Correct 345 ms 160716 KB Output is correct
12 Correct 768 ms 160700 KB Output is correct
13 Correct 675 ms 160476 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 43612 KB Output is correct
2 Correct 187 ms 160504 KB Output is correct
3 Correct 191 ms 160616 KB Output is correct
4 Correct 215 ms 160616 KB Output is correct
5 Correct 206 ms 160620 KB Output is correct
6 Correct 200 ms 160492 KB Output is correct
7 Correct 194 ms 160456 KB Output is correct
8 Correct 309 ms 160616 KB Output is correct
9 Correct 161 ms 160620 KB Output is correct
10 Correct 285 ms 160456 KB Output is correct
11 Correct 345 ms 160716 KB Output is correct
12 Correct 768 ms 160700 KB Output is correct
13 Correct 675 ms 160476 KB Output is correct
14 Correct 13 ms 43612 KB Output is correct
15 Correct 171 ms 160624 KB Output is correct
16 Correct 174 ms 160604 KB Output is correct
17 Correct 228 ms 160468 KB Output is correct
18 Correct 220 ms 160600 KB Output is correct
19 Correct 225 ms 160616 KB Output is correct
20 Correct 314 ms 160456 KB Output is correct
21 Correct 329 ms 160620 KB Output is correct
22 Correct 280 ms 160456 KB Output is correct
23 Correct 459 ms 160460 KB Output is correct
24 Correct 510 ms 160572 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 43612 KB Output is correct
2 Correct 187 ms 160504 KB Output is correct
3 Correct 191 ms 160616 KB Output is correct
4 Correct 215 ms 160616 KB Output is correct
5 Correct 206 ms 160620 KB Output is correct
6 Correct 200 ms 160492 KB Output is correct
7 Correct 194 ms 160456 KB Output is correct
8 Correct 309 ms 160616 KB Output is correct
9 Correct 161 ms 160620 KB Output is correct
10 Correct 285 ms 160456 KB Output is correct
11 Correct 345 ms 160716 KB Output is correct
12 Correct 768 ms 160700 KB Output is correct
13 Correct 675 ms 160476 KB Output is correct
14 Correct 13 ms 43612 KB Output is correct
15 Correct 171 ms 160624 KB Output is correct
16 Correct 174 ms 160604 KB Output is correct
17 Correct 228 ms 160468 KB Output is correct
18 Correct 220 ms 160600 KB Output is correct
19 Correct 225 ms 160616 KB Output is correct
20 Correct 314 ms 160456 KB Output is correct
21 Correct 329 ms 160620 KB Output is correct
22 Correct 280 ms 160456 KB Output is correct
23 Correct 459 ms 160460 KB Output is correct
24 Correct 510 ms 160572 KB Output is correct
25 Correct 138 ms 159832 KB Output is correct
26 Correct 178 ms 160620 KB Output is correct
27 Correct 186 ms 160620 KB Output is correct
28 Correct 183 ms 160460 KB Output is correct
29 Correct 210 ms 160460 KB Output is correct
30 Correct 375 ms 160612 KB Output is correct
31 Correct 435 ms 160604 KB Output is correct
32 Correct 433 ms 160624 KB Output is correct
33 Correct 364 ms 160596 KB Output is correct
34 Correct 557 ms 160620 KB Output is correct
35 Correct 331 ms 160556 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 43608 KB Output is correct
2 Correct 1708 ms 972240 KB Output is correct
3 Correct 1892 ms 980272 KB Output is correct
4 Correct 1852 ms 984980 KB Output is correct
5 Correct 1156 ms 981836 KB Output is correct
6 Correct 1937 ms 981576 KB Output is correct
7 Correct 1978 ms 977744 KB Output is correct
8 Correct 13 ms 43612 KB Output is correct
9 Correct 187 ms 160504 KB Output is correct
10 Correct 191 ms 160616 KB Output is correct
11 Correct 215 ms 160616 KB Output is correct
12 Correct 206 ms 160620 KB Output is correct
13 Correct 200 ms 160492 KB Output is correct
14 Correct 194 ms 160456 KB Output is correct
15 Correct 309 ms 160616 KB Output is correct
16 Correct 161 ms 160620 KB Output is correct
17 Correct 285 ms 160456 KB Output is correct
18 Correct 345 ms 160716 KB Output is correct
19 Correct 768 ms 160700 KB Output is correct
20 Correct 675 ms 160476 KB Output is correct
21 Correct 13 ms 43612 KB Output is correct
22 Correct 171 ms 160624 KB Output is correct
23 Correct 174 ms 160604 KB Output is correct
24 Correct 228 ms 160468 KB Output is correct
25 Correct 220 ms 160600 KB Output is correct
26 Correct 225 ms 160616 KB Output is correct
27 Correct 314 ms 160456 KB Output is correct
28 Correct 329 ms 160620 KB Output is correct
29 Correct 280 ms 160456 KB Output is correct
30 Correct 459 ms 160460 KB Output is correct
31 Correct 510 ms 160572 KB Output is correct
32 Correct 138 ms 159832 KB Output is correct
33 Correct 178 ms 160620 KB Output is correct
34 Correct 186 ms 160620 KB Output is correct
35 Correct 183 ms 160460 KB Output is correct
36 Correct 210 ms 160460 KB Output is correct
37 Correct 375 ms 160612 KB Output is correct
38 Correct 435 ms 160604 KB Output is correct
39 Correct 433 ms 160624 KB Output is correct
40 Correct 364 ms 160596 KB Output is correct
41 Correct 557 ms 160620 KB Output is correct
42 Correct 331 ms 160556 KB Output is correct
43 Correct 11 ms 41620 KB Output is correct
44 Correct 12 ms 43608 KB Output is correct
45 Correct 1360 ms 983800 KB Output is correct
46 Correct 1231 ms 982668 KB Output is correct
47 Correct 1236 ms 980552 KB Output is correct
48 Correct 1200 ms 983280 KB Output is correct
49 Correct 1299 ms 984196 KB Output is correct
50 Correct 1834 ms 981880 KB Output is correct
51 Correct 1117 ms 981284 KB Output is correct
52 Correct 1866 ms 982004 KB Output is correct
53 Correct 2499 ms 981860 KB Output is correct
54 Correct 2104 ms 983064 KB Output is correct
55 Correct 2621 ms 981420 KB Output is correct
56 Correct 1968 ms 981328 KB Output is correct
57 Correct 2304 ms 984740 KB Output is correct
58 Correct 2084 ms 981308 KB Output is correct
59 Correct 2144 ms 983584 KB Output is correct
60 Correct 2249 ms 981488 KB Output is correct
61 Correct 1960 ms 985296 KB Output is correct