Submission #1049103

# Submission time Handle Problem Language Result Execution time Memory
1049103 2024-08-08T13:22:42 Z parsadox2 Dungeons Game (IOI21_dungeons) C++17
89 / 100
7000 ms 531412 KB
#include "dungeons.h"
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;

const int N = 4e5 + 10 , Lg = 27;
const long long inf = 1e15 + 10;

int n;

vector <int> s , p , w , l;

long long f(long long x)
{
	if(x <= 0)
		return inf;
	return x;
}

struct item{
	long long mn;
	long long val;
	int id;
};

item a[2 * N][Lg];

item Get(item now , int len)
{
	if(len == 0)
		return now;
	long long id = now.id , mn = now.mn , val = now.val , dif = val - (val >= s[id]) * s[id];

	for(int i = Lg - 1 ; i >= 0 ; i--)  if((1 << i) <= len && a[id * 2 + (val >= s[id])][i].mn > dif)
	{
		item tmp = a[id * 2 + (val >= s[id])][i];
		return Get({min(mn , tmp.mn - dif) , tmp.val + dif , tmp.id} , len - (1 << i));
	}
	if(val >= s[id])
		return Get({min(mn , f(s[w[id]] - val - s[id])) , val + s[id] , w[id]} , len - 1);
	else
		return Get({min(mn , f(s[l[id]] - val - p[id])) , val + p[id] , l[id]} , len - 1);
}

void init(int nn, vector<int> ss, vector<int> pp, vector<int> ww, vector<int> ll) {
	n = nn;
	s = ss;
	p = pp;
	w = ww;
	l = ll;
	s.push_back(0);
	p.push_back(0);
	w.push_back(n);
	l.push_back(n);
	for(int i = 0 ; i <= n ; i++)
	{
		a[i << 1][0] = {f(s[l[i]] - p[i]) , p[i] , l[i]};
		a[(i << 1) + 1][0] = {f(s[w[i]] - 2 * s[i]) , 2 * s[i] , w[i]};
	}
	for(int j = 1 ; j < Lg ; j++)  for(int i = 0 ; i <= 2 * n + 1 ; i++)
	{
		a[i][j] = Get(a[i][j - 1] , (1 << (j - 1)));
	}
}

long long simulate(int x, int z) {
	item tmp = Get({inf , z , x} , 2e7);
	return tmp.val;
}

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 5 ms 2908 KB Output is correct
4 Correct 111 ms 66188 KB Output is correct
5 Correct 4 ms 4700 KB Output is correct
6 Correct 146 ms 66192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 6178 ms 527284 KB Output is correct
3 Correct 6905 ms 529412 KB Output is correct
4 Correct 5789 ms 527072 KB Output is correct
5 Correct 1108 ms 527068 KB Output is correct
6 Correct 6093 ms 527268 KB Output is correct
7 Correct 4100 ms 528352 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 118 ms 66884 KB Output is correct
3 Correct 116 ms 66888 KB Output is correct
4 Correct 134 ms 66892 KB Output is correct
5 Correct 113 ms 66892 KB Output is correct
6 Correct 156 ms 66832 KB Output is correct
7 Correct 199 ms 66980 KB Output is correct
8 Correct 106 ms 67144 KB Output is correct
9 Correct 130 ms 66888 KB Output is correct
10 Correct 155 ms 66880 KB Output is correct
11 Correct 138 ms 66772 KB Output is correct
12 Correct 340 ms 66884 KB Output is correct
13 Correct 284 ms 66768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 118 ms 66884 KB Output is correct
3 Correct 116 ms 66888 KB Output is correct
4 Correct 134 ms 66892 KB Output is correct
5 Correct 113 ms 66892 KB Output is correct
6 Correct 156 ms 66832 KB Output is correct
7 Correct 199 ms 66980 KB Output is correct
8 Correct 106 ms 67144 KB Output is correct
9 Correct 130 ms 66888 KB Output is correct
10 Correct 155 ms 66880 KB Output is correct
11 Correct 138 ms 66772 KB Output is correct
12 Correct 340 ms 66884 KB Output is correct
13 Correct 284 ms 66768 KB Output is correct
14 Correct 3 ms 2652 KB Output is correct
15 Correct 217 ms 66764 KB Output is correct
16 Correct 139 ms 66892 KB Output is correct
17 Correct 131 ms 66816 KB Output is correct
18 Correct 173 ms 66976 KB Output is correct
19 Correct 171 ms 66880 KB Output is correct
20 Correct 434 ms 67220 KB Output is correct
21 Correct 281 ms 66972 KB Output is correct
22 Correct 221 ms 66888 KB Output is correct
23 Correct 144 ms 66776 KB Output is correct
24 Correct 351 ms 66980 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 118 ms 66884 KB Output is correct
3 Correct 116 ms 66888 KB Output is correct
4 Correct 134 ms 66892 KB Output is correct
5 Correct 113 ms 66892 KB Output is correct
6 Correct 156 ms 66832 KB Output is correct
7 Correct 199 ms 66980 KB Output is correct
8 Correct 106 ms 67144 KB Output is correct
9 Correct 130 ms 66888 KB Output is correct
10 Correct 155 ms 66880 KB Output is correct
11 Correct 138 ms 66772 KB Output is correct
12 Correct 340 ms 66884 KB Output is correct
13 Correct 284 ms 66768 KB Output is correct
14 Correct 3 ms 2652 KB Output is correct
15 Correct 217 ms 66764 KB Output is correct
16 Correct 139 ms 66892 KB Output is correct
17 Correct 131 ms 66816 KB Output is correct
18 Correct 173 ms 66976 KB Output is correct
19 Correct 171 ms 66880 KB Output is correct
20 Correct 434 ms 67220 KB Output is correct
21 Correct 281 ms 66972 KB Output is correct
22 Correct 221 ms 66888 KB Output is correct
23 Correct 144 ms 66776 KB Output is correct
24 Correct 351 ms 66980 KB Output is correct
25 Correct 108 ms 66124 KB Output is correct
26 Correct 143 ms 66892 KB Output is correct
27 Correct 301 ms 66776 KB Output is correct
28 Correct 240 ms 67148 KB Output is correct
29 Correct 116 ms 66888 KB Output is correct
30 Correct 430 ms 67356 KB Output is correct
31 Correct 606 ms 66976 KB Output is correct
32 Correct 694 ms 66892 KB Output is correct
33 Correct 241 ms 67144 KB Output is correct
34 Correct 257 ms 67144 KB Output is correct
35 Correct 443 ms 67392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 6178 ms 527284 KB Output is correct
3 Correct 6905 ms 529412 KB Output is correct
4 Correct 5789 ms 527072 KB Output is correct
5 Correct 1108 ms 527068 KB Output is correct
6 Correct 6093 ms 527268 KB Output is correct
7 Correct 4100 ms 528352 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 118 ms 66884 KB Output is correct
10 Correct 116 ms 66888 KB Output is correct
11 Correct 134 ms 66892 KB Output is correct
12 Correct 113 ms 66892 KB Output is correct
13 Correct 156 ms 66832 KB Output is correct
14 Correct 199 ms 66980 KB Output is correct
15 Correct 106 ms 67144 KB Output is correct
16 Correct 130 ms 66888 KB Output is correct
17 Correct 155 ms 66880 KB Output is correct
18 Correct 138 ms 66772 KB Output is correct
19 Correct 340 ms 66884 KB Output is correct
20 Correct 284 ms 66768 KB Output is correct
21 Correct 3 ms 2652 KB Output is correct
22 Correct 217 ms 66764 KB Output is correct
23 Correct 139 ms 66892 KB Output is correct
24 Correct 131 ms 66816 KB Output is correct
25 Correct 173 ms 66976 KB Output is correct
26 Correct 171 ms 66880 KB Output is correct
27 Correct 434 ms 67220 KB Output is correct
28 Correct 281 ms 66972 KB Output is correct
29 Correct 221 ms 66888 KB Output is correct
30 Correct 144 ms 66776 KB Output is correct
31 Correct 351 ms 66980 KB Output is correct
32 Correct 108 ms 66124 KB Output is correct
33 Correct 143 ms 66892 KB Output is correct
34 Correct 301 ms 66776 KB Output is correct
35 Correct 240 ms 67148 KB Output is correct
36 Correct 116 ms 66888 KB Output is correct
37 Correct 430 ms 67356 KB Output is correct
38 Correct 606 ms 66976 KB Output is correct
39 Correct 694 ms 66892 KB Output is correct
40 Correct 241 ms 67144 KB Output is correct
41 Correct 257 ms 67144 KB Output is correct
42 Correct 443 ms 67392 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 3 ms 2652 KB Output is correct
45 Correct 1226 ms 529308 KB Output is correct
46 Correct 3619 ms 528524 KB Output is correct
47 Correct 2606 ms 530660 KB Output is correct
48 Correct 4072 ms 528092 KB Output is correct
49 Correct 1161 ms 530656 KB Output is correct
50 Correct 4993 ms 529120 KB Output is correct
51 Correct 1206 ms 529888 KB Output is correct
52 Correct 5303 ms 531412 KB Output is correct
53 Execution timed out 7069 ms 528036 KB Time limit exceeded
54 Halted 0 ms 0 KB -