oj.uz

Submission #1012245

# Submission time Handle Problem Language Result Execution time Memory
1012245 2024-07-01T21:07:54 Z 1ne Dungeons Game (IOI21_dungeons) C++17
39 / 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) {
	unordered_map<int,long long>mp;
	long long Z = z;
	int cnt = 0;
	auto check = [&](int xx){
		if (xx != N && mp.find(xx) != mp.end() && S[xx] > Z && Z != mp[xx]){
			long long v = Z - mp[xx];
			long long k = (S[xx] - Z + v - 1) / v;
			Z+=k * v;			
		}
		mp[xx] = Z;
	};
	while(x != N){
		//check(x);
		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];	
		}
		check(x);
		if (x != N && S[x] > Z){
			int cc = 0;
			while(bk[x][cc]!=-1 && need[x][cc] > Z){
				++cc;
			}
			cc--;
			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];
						//check(x);
					}
				}
				else cc--;
			}
			//cout<<'\n';
		}	
	}
//	cout<<'\n';
	return Z;
}

Subtask #1
0.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 4 ms 2648 KB Output is correct
4 Correct 82 ms 61444 KB Output is correct
5 Incorrect 2 ms 2652 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1628 KB Output is correct
2 Correct 717 ms 489592 KB Output is correct
3 Correct 679 ms 489536 KB Output is correct
4 Correct 719 ms 489556 KB Output is correct
5 Correct 593 ms 489680 KB Output is correct
6 Correct 761 ms 489556 KB Output is correct
7 Correct 679 ms 489452 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 92 ms 62032 KB Output is correct
3 Correct 121 ms 62032 KB Output is correct
4 Correct 116 ms 62232 KB Output is correct
5 Correct 113 ms 62032 KB Output is correct
6 Correct 107 ms 62272 KB Output is correct
7 Correct 114 ms 62032 KB Output is correct
8 Correct 113 ms 62088 KB Output is correct
9 Correct 92 ms 62032 KB Output is correct
10 Correct 106 ms 62036 KB Output is correct
11 Correct 107 ms 62172 KB Output is correct
12 Correct 245 ms 62272 KB Output is correct
13 Correct 186 ms 62080 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 92 ms 62032 KB Output is correct
3 Correct 121 ms 62032 KB Output is correct
4 Correct 116 ms 62232 KB Output is correct
5 Correct 113 ms 62032 KB Output is correct
6 Correct 107 ms 62272 KB Output is correct
7 Correct 114 ms 62032 KB Output is correct
8 Correct 113 ms 62088 KB Output is correct
9 Correct 92 ms 62032 KB Output is correct
10 Correct 106 ms 62036 KB Output is correct
11 Correct 107 ms 62172 KB Output is correct
12 Correct 245 ms 62272 KB Output is correct
13 Correct 186 ms 62080 KB Output is correct
14 Correct 2 ms 1624 KB Output is correct
15 Correct 108 ms 62180 KB Output is correct
16 Correct 125 ms 62044 KB Output is correct
17 Correct 104 ms 62036 KB Output is correct
18 Correct 105 ms 62032 KB Output is correct
19 Correct 106 ms 62036 KB Output is correct
20 Correct 122 ms 62040 KB Output is correct
21 Correct 114 ms 62044 KB Output is correct
22 Execution timed out 7062 ms 62036 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 92 ms 62032 KB Output is correct
3 Correct 121 ms 62032 KB Output is correct
4 Correct 116 ms 62232 KB Output is correct
5 Correct 113 ms 62032 KB Output is correct
6 Correct 107 ms 62272 KB Output is correct
7 Correct 114 ms 62032 KB Output is correct
8 Correct 113 ms 62088 KB Output is correct
9 Correct 92 ms 62032 KB Output is correct
10 Correct 106 ms 62036 KB Output is correct
11 Correct 107 ms 62172 KB Output is correct
12 Correct 245 ms 62272 KB Output is correct
13 Correct 186 ms 62080 KB Output is correct
14 Correct 2 ms 1624 KB Output is correct
15 Correct 108 ms 62180 KB Output is correct
16 Correct 125 ms 62044 KB Output is correct
17 Correct 104 ms 62036 KB Output is correct
18 Correct 105 ms 62032 KB Output is correct
19 Correct 106 ms 62036 KB Output is correct
20 Correct 122 ms 62040 KB Output is correct
21 Correct 114 ms 62044 KB Output is correct
22 Execution timed out 7062 ms 62036 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 717 ms 489592 KB Output is correct
3 Correct 679 ms 489536 KB Output is correct
4 Correct 719 ms 489556 KB Output is correct
5 Correct 593 ms 489680 KB Output is correct
6 Correct 761 ms 489556 KB Output is correct
7 Correct 679 ms 489452 KB Output is correct
8 Correct 2 ms 1628 KB Output is correct
9 Correct 92 ms 62032 KB Output is correct
10 Correct 121 ms 62032 KB Output is correct
11 Correct 116 ms 62232 KB Output is correct
12 Correct 113 ms 62032 KB Output is correct
13 Correct 107 ms 62272 KB Output is correct
14 Correct 114 ms 62032 KB Output is correct
15 Correct 113 ms 62088 KB Output is correct
16 Correct 92 ms 62032 KB Output is correct
17 Correct 106 ms 62036 KB Output is correct
18 Correct 107 ms 62172 KB Output is correct
19 Correct 245 ms 62272 KB Output is correct
20 Correct 186 ms 62080 KB Output is correct
21 Correct 2 ms 1624 KB Output is correct
22 Correct 108 ms 62180 KB Output is correct
23 Correct 125 ms 62044 KB Output is correct
24 Correct 104 ms 62036 KB Output is correct
25 Correct 105 ms 62032 KB Output is correct
26 Correct 106 ms 62036 KB Output is correct
27 Correct 122 ms 62040 KB Output is correct
28 Correct 114 ms 62044 KB Output is correct
29 Execution timed out 7062 ms 62036 KB Time limit exceeded
30 Halted 0 ms 0 KB -