oj.uz

Submission #1011125

# Submission time Handle Problem Language Result Execution time Memory
1011125 2024-06-29T20:55:43 Z 1ne Dungeons Game (IOI21_dungeons) C++17
50 / 100
 7000 ms 489680 KB 
#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int k = 20;
vector<vector<long long>>table;
vector<vector<long long>>nx;
vector<vector<long long>>bk;
vector<vector<long long>>sum;
vector<vector<long long>>bksum;
vector<vector<long long>>need;
vector<int>S,P,W,L;
long long N;	
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
	table.resize(n,vector<long long>(k));
	nx.resize(n,vector<long long>(k,-1));
	sum.resize(n,vector<long long>(k,0));
	need.resize(n,vector<long long>(k,1e16));
	bk.resize(n,vector<long long>(k,-1));
	bksum.resize(n,vector<long long>(k,0));
	N = n;
	S = s;
	P = p;
	W = w;
	L = l;
	for (long long i = 0;i<n;++i){
		table[i][0] = s[i];
		nx[i][0] = w[i];
		sum[i][0] = s[i];
		need[i][0] = s[i];
		bk[i][0] = l[i];
		bksum[i][0] = p[i];
	}
	for (long long i = 1;i<k;++i){
			for (long long j = 0;j<n;++j){
			if (nx[j][i - 1] == -1 || nx[j][i - 1] == n)continue;
			//cout<<nx[j][i - 1]<<'\n';
			nx[j][i] = nx[nx[j][i - 1]][i - 1];
			table[j][i] = max(table[j][i - 1],table[nx[j][i - 1]][i - 1] - sum[j][i - 1]);
			sum[j][i] = sum[j][i - 1] + sum[nx[j][i - 1]][i - 1];
		}
	}
	for (long long i = 1;i<k;++i){
			for (long long j = 0;j<n;++j){
			if (bk[j][i - 1] == -1 || bk[j][i - 1] == n)continue;
			//cout<<nx[j][i - 1]<<'\n';
			bk[j][i] = bk[bk[j][i - 1]][i - 1];
			need[j][i] = min(need[j][i - 1],need[bk[j][i - 1]][i - 1] - bksum[j][i - 1]);
			bksum[j][i] = bksum[j][i - 1] + bksum[bk[j][i - 1]][i - 1];
		}
	}
	return;
}
 
long long simulate(int x, int z) {
	long long Z = z;
	int cnt = 0;
	while(x != N){
		cnt++;
		//assert(cnt < 50);
	//	cout<<x<<"->";
		long long c = -1;
		int left = 0,right = k - 1;
		while(left <= right){
			int mid = (left + right)>>1;
			if (nx[x][mid] != -1 && table[x][mid] <= Z){
				left = mid + 1;
				c = mid;
			}
			else right = mid - 1;
		}
		++c;
		//while(nx[x][c] != -1 && table[x][c] <= Z){
		//	++c;
		//}
		if (c != 0){
			Z+=sum[x][c - 1];
			x = nx[x][c - 1];
		}
		if (x != N && S[x] > Z){
			int cc = -1;
			left = 0,right = k - 1;
			while(left<=right){
				int mid = (left + right)>>1;
				if (bk[x][mid] != -1 && need[x][mid] <= Z){
					right = mid - 1;
				}
				else{
					left = mid + 1;
					cc = mid;
				}
			}
			while(cc >= 0 && x != N){
			//	cout<<x<<"->";
				if (bk[x][cc] != -1){
					if (need[x][cc] <= Z){
						cc--;
					}	 
					else{
						Z+=bksum[x][cc];
						x = bk[x][cc];break;
					}
				}
				else cc--;
			}
			//cout<<'\n';
		}	
	}
//	cout<<'\n';
	return Z;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 73 ms 61484 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 64 ms 61400 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1628 KB Output is correct
2 Correct 733 ms 489680 KB Output is correct
3 Correct 671 ms 489552 KB Output is correct
4 Correct 698 ms 489676 KB Output is correct
5 Correct 576 ms 489552 KB Output is correct
6 Correct 747 ms 489456 KB Output is correct
7 Correct 662 ms 489480 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1628 KB Output is correct
2 Correct 90 ms 62164 KB Output is correct
3 Correct 106 ms 62044 KB Output is correct
4 Correct 114 ms 62032 KB Output is correct
5 Correct 91 ms 62032 KB Output is correct
6 Correct 94 ms 62036 KB Output is correct
7 Correct 98 ms 62036 KB Output is correct
8 Correct 89 ms 62032 KB Output is correct
9 Correct 78 ms 62036 KB Output is correct
10 Correct 86 ms 62040 KB Output is correct
11 Correct 111 ms 62032 KB Output is correct
12 Correct 262 ms 62032 KB Output is correct
13 Correct 222 ms 62272 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1628 KB Output is correct
2 Correct 90 ms 62164 KB Output is correct
3 Correct 106 ms 62044 KB Output is correct
4 Correct 114 ms 62032 KB Output is correct
5 Correct 91 ms 62032 KB Output is correct
6 Correct 94 ms 62036 KB Output is correct
7 Correct 98 ms 62036 KB Output is correct
8 Correct 89 ms 62032 KB Output is correct
9 Correct 78 ms 62036 KB Output is correct
10 Correct 86 ms 62040 KB Output is correct
11 Correct 111 ms 62032 KB Output is correct
12 Correct 262 ms 62032 KB Output is correct
13 Correct 222 ms 62272 KB Output is correct
14 Correct 3 ms 1628 KB Output is correct
15 Correct 122 ms 62288 KB Output is correct
16 Correct 94 ms 62272 KB Output is correct
17 Correct 94 ms 62032 KB Output is correct
18 Correct 102 ms 62032 KB Output is correct
19 Correct 97 ms 62168 KB Output is correct
20 Correct 107 ms 62044 KB Output is correct
21 Correct 98 ms 62036 KB Output is correct
22 Execution timed out 7076 ms 62272 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1628 KB Output is correct
2 Correct 90 ms 62164 KB Output is correct
3 Correct 106 ms 62044 KB Output is correct
4 Correct 114 ms 62032 KB Output is correct
5 Correct 91 ms 62032 KB Output is correct
6 Correct 94 ms 62036 KB Output is correct
7 Correct 98 ms 62036 KB Output is correct
8 Correct 89 ms 62032 KB Output is correct
9 Correct 78 ms 62036 KB Output is correct
10 Correct 86 ms 62040 KB Output is correct
11 Correct 111 ms 62032 KB Output is correct
12 Correct 262 ms 62032 KB Output is correct
13 Correct 222 ms 62272 KB Output is correct
14 Correct 3 ms 1628 KB Output is correct
15 Correct 122 ms 62288 KB Output is correct
16 Correct 94 ms 62272 KB Output is correct
17 Correct 94 ms 62032 KB Output is correct
18 Correct 102 ms 62032 KB Output is correct
19 Correct 97 ms 62168 KB Output is correct
20 Correct 107 ms 62044 KB Output is correct
21 Correct 98 ms 62036 KB Output is correct
22 Execution timed out 7076 ms 62272 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1628 KB Output is correct
2 Correct 733 ms 489680 KB Output is correct
3 Correct 671 ms 489552 KB Output is correct
4 Correct 698 ms 489676 KB Output is correct
5 Correct 576 ms 489552 KB Output is correct
6 Correct 747 ms 489456 KB Output is correct
7 Correct 662 ms 489480 KB Output is correct
8 Correct 2 ms 1628 KB Output is correct
9 Correct 90 ms 62164 KB Output is correct
10 Correct 106 ms 62044 KB Output is correct
11 Correct 114 ms 62032 KB Output is correct
12 Correct 91 ms 62032 KB Output is correct
13 Correct 94 ms 62036 KB Output is correct
14 Correct 98 ms 62036 KB Output is correct
15 Correct 89 ms 62032 KB Output is correct
16 Correct 78 ms 62036 KB Output is correct
17 Correct 86 ms 62040 KB Output is correct
18 Correct 111 ms 62032 KB Output is correct
19 Correct 262 ms 62032 KB Output is correct
20 Correct 222 ms 62272 KB Output is correct
21 Correct 3 ms 1628 KB Output is correct
22 Correct 122 ms 62288 KB Output is correct
23 Correct 94 ms 62272 KB Output is correct
24 Correct 94 ms 62032 KB Output is correct
25 Correct 102 ms 62032 KB Output is correct
26 Correct 97 ms 62168 KB Output is correct
27 Correct 107 ms 62044 KB Output is correct
28 Correct 98 ms 62036 KB Output is correct
29 Execution timed out 7076 ms 62272 KB Time limit exceeded
30 Halted 0 ms 0 KB -