oj.uz

답안 #1049083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049083 2024-08-08T13:12:50 Z parsadox2 던전 (IOI21_dungeons) C++17
89 / 100
 7000 ms 540768 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] = {s[i] , p[i] , l[i]};
		a[(i << 1) + 1][0] = {inf , 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;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 5 ms 4700 KB Output is correct
4 Correct 108 ms 67344 KB Output is correct
5 Correct 6 ms 4696 KB Output is correct
6 Correct 119 ms 67348 KB Output is correct

Subtask #2
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 5413 ms 534536 KB Output is correct
3 Correct 6654 ms 533348 KB Output is correct
4 Correct 5655 ms 532964 KB Output is correct
5 Correct 1022 ms 534080 KB Output is correct
6 Correct 5626 ms 533380 KB Output is correct
7 Correct 3883 ms 535528 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 115 ms 68664 KB Output is correct
3 Correct 110 ms 68916 KB Output is correct
4 Correct 110 ms 68428 KB Output is correct
5 Correct 101 ms 68360 KB Output is correct
6 Correct 170 ms 68424 KB Output is correct
7 Correct 146 ms 68428 KB Output is correct
8 Correct 101 ms 68168 KB Output is correct
9 Correct 120 ms 68172 KB Output is correct
10 Correct 114 ms 68172 KB Output is correct
11 Correct 110 ms 68680 KB Output is correct
12 Correct 220 ms 68612 KB Output is correct
13 Correct 191 ms 68616 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 115 ms 68664 KB Output is correct
3 Correct 110 ms 68916 KB Output is correct
4 Correct 110 ms 68428 KB Output is correct
5 Correct 101 ms 68360 KB Output is correct
6 Correct 170 ms 68424 KB Output is correct
7 Correct 146 ms 68428 KB Output is correct
8 Correct 101 ms 68168 KB Output is correct
9 Correct 120 ms 68172 KB Output is correct
10 Correct 114 ms 68172 KB Output is correct
11 Correct 110 ms 68680 KB Output is correct
12 Correct 220 ms 68612 KB Output is correct
13 Correct 191 ms 68616 KB Output is correct
14 Correct 3 ms 2652 KB Output is correct
15 Correct 171 ms 68504 KB Output is correct
16 Correct 102 ms 68660 KB Output is correct
17 Correct 127 ms 68280 KB Output is correct
18 Correct 145 ms 68424 KB Output is correct
19 Correct 139 ms 68428 KB Output is correct
20 Correct 301 ms 68160 KB Output is correct
21 Correct 233 ms 68508 KB Output is correct
22 Correct 174 ms 68416 KB Output is correct
23 Correct 112 ms 68428 KB Output is correct
24 Correct 241 ms 68424 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 115 ms 68664 KB Output is correct
3 Correct 110 ms 68916 KB Output is correct
4 Correct 110 ms 68428 KB Output is correct
5 Correct 101 ms 68360 KB Output is correct
6 Correct 170 ms 68424 KB Output is correct
7 Correct 146 ms 68428 KB Output is correct
8 Correct 101 ms 68168 KB Output is correct
9 Correct 120 ms 68172 KB Output is correct
10 Correct 114 ms 68172 KB Output is correct
11 Correct 110 ms 68680 KB Output is correct
12 Correct 220 ms 68612 KB Output is correct
13 Correct 191 ms 68616 KB Output is correct
14 Correct 3 ms 2652 KB Output is correct
15 Correct 171 ms 68504 KB Output is correct
16 Correct 102 ms 68660 KB Output is correct
17 Correct 127 ms 68280 KB Output is correct
18 Correct 145 ms 68424 KB Output is correct
19 Correct 139 ms 68428 KB Output is correct
20 Correct 301 ms 68160 KB Output is correct
21 Correct 233 ms 68508 KB Output is correct
22 Correct 174 ms 68416 KB Output is correct
23 Correct 112 ms 68428 KB Output is correct
24 Correct 241 ms 68424 KB Output is correct
25 Correct 106 ms 67912 KB Output is correct
26 Correct 108 ms 68656 KB Output is correct
27 Correct 282 ms 68404 KB Output is correct
28 Correct 230 ms 68400 KB Output is correct
29 Correct 118 ms 68548 KB Output is correct
30 Correct 379 ms 68672 KB Output is correct
31 Correct 499 ms 68364 KB Output is correct
32 Correct 455 ms 68424 KB Output is correct
33 Correct 176 ms 68424 KB Output is correct
34 Correct 198 ms 68680 KB Output is correct
35 Correct 321 ms 68428 KB Output is correct

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 5413 ms 534536 KB Output is correct
3 Correct 6654 ms 533348 KB Output is correct
4 Correct 5655 ms 532964 KB Output is correct
5 Correct 1022 ms 534080 KB Output is correct
6 Correct 5626 ms 533380 KB Output is correct
7 Correct 3883 ms 535528 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 115 ms 68664 KB Output is correct
10 Correct 110 ms 68916 KB Output is correct
11 Correct 110 ms 68428 KB Output is correct
12 Correct 101 ms 68360 KB Output is correct
13 Correct 170 ms 68424 KB Output is correct
14 Correct 146 ms 68428 KB Output is correct
15 Correct 101 ms 68168 KB Output is correct
16 Correct 120 ms 68172 KB Output is correct
17 Correct 114 ms 68172 KB Output is correct
18 Correct 110 ms 68680 KB Output is correct
19 Correct 220 ms 68612 KB Output is correct
20 Correct 191 ms 68616 KB Output is correct
21 Correct 3 ms 2652 KB Output is correct
22 Correct 171 ms 68504 KB Output is correct
23 Correct 102 ms 68660 KB Output is correct
24 Correct 127 ms 68280 KB Output is correct
25 Correct 145 ms 68424 KB Output is correct
26 Correct 139 ms 68428 KB Output is correct
27 Correct 301 ms 68160 KB Output is correct
28 Correct 233 ms 68508 KB Output is correct
29 Correct 174 ms 68416 KB Output is correct
30 Correct 112 ms 68428 KB Output is correct
31 Correct 241 ms 68424 KB Output is correct
32 Correct 106 ms 67912 KB Output is correct
33 Correct 108 ms 68656 KB Output is correct
34 Correct 282 ms 68404 KB Output is correct
35 Correct 230 ms 68400 KB Output is correct
36 Correct 118 ms 68548 KB Output is correct
37 Correct 379 ms 68672 KB Output is correct
38 Correct 499 ms 68364 KB Output is correct
39 Correct 455 ms 68424 KB Output is correct
40 Correct 176 ms 68424 KB Output is correct
41 Correct 198 ms 68680 KB Output is correct
42 Correct 321 ms 68428 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 2 ms 2652 KB Output is correct
45 Correct 1105 ms 540768 KB Output is correct
46 Correct 2759 ms 534304 KB Output is correct
47 Correct 2404 ms 536824 KB Output is correct
48 Correct 3732 ms 539220 KB Output is correct
49 Correct 1068 ms 538456 KB Output is correct
50 Correct 5021 ms 535820 KB Output is correct
51 Correct 1225 ms 534848 KB Output is correct
52 Correct 5136 ms 534696 KB Output is correct
53 Execution timed out 7122 ms 532936 KB Time limit exceeded
54 Halted 0 ms 0 KB -