oj.uz

Submission #567320

# Submission time Handle Problem Language Result Execution time Memory
567320 2022-05-23T10:31:04 Z amunduzbaev Rainforest Jumps (APIO21_jumps) C++17
52 / 100
 4000 ms 868596 KB 
#include "jumps.h"

#ifndef EVAL
#include "stub.cpp"
#endif

#include "bits/stdc++.h"
using namespace std;

const int B = 700;
const int N = 2e5 + 5;
const int lg = 18;
vector<int> edges[N];
int mx[N][lg], mn[N][lg], h[N], pos[N];
int st[N][lg], pre[N/B][N];
int lx[N], rx[N];

struct ST{
	int tree[1 << (lg + 1)], b;
	void build(int lx = 0, int rx = N - 1, int x = 1){
		if(lx == rx) { tree[x] = pre[b][lx]; return; }
		int m = (lx + rx) >> 1;
		build(lx, m, x << 1);
		build(m + 1, rx, x << 1 | 1);
		tree[x] = min(tree[x<<1], tree[x<<1 | 1]);
	}
	
	int get(int l, int r, int lx = 0, int rx = N - 1, int x = 1){
		if(lx > r || rx < l) return N;
		if(lx >= l && rx <= r) return tree[x];
		int m = (lx + rx) >> 1;
		return min(get(l, r, lx, m, x<<1), get(l, r, m+1, rx, x<<1|1));
	}
}tree[N/B];

void init(int n, vector<int> H){
	for(int i=0;i<n;i++){
		h[i] = H[i];
		pos[h[i]] = i;
		st[i][0] = h[i];
	}
	
	vector<int> ss;
	for(int i=0;i<n;i++){
		while(!ss.empty() && h[ss.back()] < h[i]) ss.pop_back();
		if(!ss.empty()) lx[i] = ss.back();
		else lx[i] = n;
		ss.push_back(i);
	} ss.clear();
	
	for(int i=n-1;~i;i--){
		while(!ss.empty() && h[ss.back()] < h[i]) ss.pop_back();
		if(!ss.empty()) rx[i] = ss.back();
		else rx[i] = n;
		ss.push_back(i);
	} ss.clear();
	h[n] = N;
	
	for(int i=0;i<n;i++){
		if(h[lx[i]] < h[rx[i]]){
			swap(lx[i], rx[i]);
		} 
		edges[lx[i]].push_back(i);
		edges[rx[i]].push_back(i);
		mn[i][0] = rx[i];
		mx[i][0] = lx[i];
		lx[i] = min(lx[i], rx[i]);
		if(i < lx[i]) lx[i] = -1;
	}
	mn[n][0] = mx[n][0] = n;
	edges[n].clear();
	
	for(int b=0;b<n/B;b++){
		memset(pre[b], 127, sizeof pre[b]);
		queue<int> q;
		for(int i=0;b * B + i<n;i++){
			q.push(b * B + i);
			pre[b][b * B + i] = 0;
		}
		
		while(!q.empty()){
			int u = q.front(); q.pop();
			for(auto x : edges[u]){
				if(pre[b][x] > pre[b][u] + 1){
					pre[b][x] = pre[b][u] + 1;
					q.push(x);
				}
			}
		}
		tree[b].b = b;
		tree[b].build();
	}
	
	for(int j=1;j<lg;j++){
		for(int i=0;i<=n;i++){
			if(i + (1 << (j - 1)) < n) st[i][j] = max(st[i][j - 1], st[i + (1 << (j - 1))][j-1]);
			mn[i][j] = mn[mn[i][j-1]][j-1];
			mx[i][j] = mx[mx[i][j-1]][j-1];
		}
	}
}

int get(int l, int r){
	int lg = __lg(r - l + 1);
	return max(st[l][lg], st[r - (1 << lg) + 1][lg]);
}

int check(int a, int c){
	int res = 0;
	for(int i=lg-1;~i;i--){
		if(h[mx[a][i]] <= h[c]){
			//~ cout<<mx[a][i]<<" "<<h[mx[a][i]]<<" "<<h[c]<<"\n";
			//~ cout<<i<<"\n";
			a = mx[a][i], res += (1 << i);
		}
	}
	
	for(int i=lg-1;~i;i--){
		if(h[mn[a][i]] <= h[c]){
			//~ cout<<mx[a][i]<<" "<<h[mx[a][i]]<<" "<<h[c]<<"\n";
			a = mn[a][i], res += (1 << i);
		}
	}
	
	if(a != c) return N;
	return res;
}

int minimum_jumps(int a, int b, int c, int d) {
	int bl = c / B, br = d / B;
	int res = N;
	for(int j=bl+1;j<br;j++){
		//~ assert(false);
		res = min(res, tree[j].get(a, b));
	}
	
	auto calc = [&](int l, int r){
		for(int i=l;i<=r;i++){
			int L = max(lx[i] + 1, a);
			if(L <= b){
				int mx = pos[get(L, b)];
				res = min(res, check(mx, i));
			}
		}
	};
	
	if(bl == br){
		calc(c, d);
	} else {
		if(c % B == 0) res = min(res, tree[bl].get(a, b));
		else calc(c, (bl + 1) * B - 1);
		if((d + 1) % B == 0) res = min(res, tree[br].get(a, b));
		else calc(br * B, d);
	}
	
	if(res == N) return -1;
	return res;
}

/*

7 2
3 2 1 6 4 5 7
4 4 6 6
0 1 2 2

*/

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 2013 ms 692836 KB Output is correct
4 Execution timed out 4111 ms 868508 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 5 ms 4984 KB Output is correct
6 Correct 6 ms 5072 KB Output is correct
7 Correct 5 ms 5104 KB Output is correct
8 Correct 8 ms 5072 KB Output is correct
9 Correct 4 ms 5120 KB Output is correct
10 Correct 4 ms 5072 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 8 ms 5072 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 8 ms 5152 KB Output is correct
15 Correct 6 ms 5072 KB Output is correct
16 Correct 8 ms 5072 KB Output is correct
17 Correct 7 ms 5072 KB Output is correct
18 Correct 3 ms 4944 KB Output is correct
19 Correct 3 ms 4960 KB Output is correct
20 Correct 4 ms 5072 KB Output is correct
21 Correct 6 ms 5104 KB Output is correct
22 Correct 6 ms 5072 KB Output is correct
23 Correct 6 ms 5120 KB Output is correct
24 Correct 6 ms 5072 KB Output is correct
25 Correct 3 ms 4992 KB Output is correct
26 Correct 3 ms 4944 KB Output is correct
27 Correct 3 ms 4992 KB Output is correct
28 Correct 4 ms 4980 KB Output is correct
29 Correct 5 ms 5072 KB Output is correct
30 Correct 5 ms 5072 KB Output is correct
31 Correct 5 ms 5072 KB Output is correct
32 Correct 7 ms 5072 KB Output is correct
33 Correct 3 ms 4944 KB Output is correct
34 Correct 3 ms 5072 KB Output is correct
35 Correct 3 ms 5072 KB Output is correct
36 Correct 4 ms 5072 KB Output is correct
37 Correct 4 ms 5108 KB Output is correct
38 Correct 6 ms 5056 KB Output is correct
39 Correct 4 ms 5072 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 5 ms 4984 KB Output is correct
6 Correct 6 ms 5072 KB Output is correct
7 Correct 5 ms 5104 KB Output is correct
8 Correct 8 ms 5072 KB Output is correct
9 Correct 4 ms 5120 KB Output is correct
10 Correct 4 ms 5072 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 8 ms 5072 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 8 ms 5152 KB Output is correct
15 Correct 6 ms 5072 KB Output is correct
16 Correct 8 ms 5072 KB Output is correct
17 Correct 7 ms 5072 KB Output is correct
18 Correct 3 ms 4944 KB Output is correct
19 Correct 3 ms 4960 KB Output is correct
20 Correct 4 ms 5072 KB Output is correct
21 Correct 6 ms 5104 KB Output is correct
22 Correct 6 ms 5072 KB Output is correct
23 Correct 6 ms 5120 KB Output is correct
24 Correct 6 ms 5072 KB Output is correct
25 Correct 3 ms 4992 KB Output is correct
26 Correct 3 ms 4944 KB Output is correct
27 Correct 3 ms 4992 KB Output is correct
28 Correct 4 ms 4980 KB Output is correct
29 Correct 5 ms 5072 KB Output is correct
30 Correct 5 ms 5072 KB Output is correct
31 Correct 5 ms 5072 KB Output is correct
32 Correct 7 ms 5072 KB Output is correct
33 Correct 3 ms 4944 KB Output is correct
34 Correct 3 ms 5072 KB Output is correct
35 Correct 3 ms 5072 KB Output is correct
36 Correct 4 ms 5072 KB Output is correct
37 Correct 4 ms 5108 KB Output is correct
38 Correct 6 ms 5056 KB Output is correct
39 Correct 4 ms 5072 KB Output is correct
40 Correct 4 ms 4944 KB Output is correct
41 Correct 3 ms 4992 KB Output is correct
42 Correct 4 ms 4984 KB Output is correct
43 Correct 4 ms 4992 KB Output is correct
44 Correct 5 ms 4956 KB Output is correct
45 Correct 6 ms 5120 KB Output is correct
46 Correct 5 ms 5112 KB Output is correct
47 Correct 5 ms 5072 KB Output is correct
48 Correct 5 ms 5120 KB Output is correct
49 Correct 5 ms 5072 KB Output is correct
50 Correct 6 ms 5072 KB Output is correct
51 Correct 6 ms 5096 KB Output is correct
52 Correct 5 ms 5072 KB Output is correct
53 Correct 5 ms 5072 KB Output is correct
54 Correct 7 ms 5072 KB Output is correct
55 Correct 7 ms 5072 KB Output is correct
56 Correct 5 ms 5072 KB Output is correct
57 Correct 5 ms 5092 KB Output is correct
58 Correct 25 ms 11060 KB Output is correct
59 Correct 30 ms 11176 KB Output is correct
60 Correct 14 ms 8104 KB Output is correct
61 Correct 27 ms 11216 KB Output is correct
62 Correct 15 ms 5072 KB Output is correct
63 Incorrect 25 ms 11160 KB Output isn't correct
64 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 4 ms 4944 KB Output is correct
4 Correct 4 ms 4944 KB Output is correct
5 Correct 1446 ms 696512 KB Output is correct
6 Correct 1729 ms 864756 KB Output is correct
7 Correct 556 ms 445692 KB Output is correct
8 Incorrect 2175 ms 864988 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 4 ms 4944 KB Output is correct
3 Correct 4 ms 5000 KB Output is correct
4 Correct 706 ms 397320 KB Output is correct
5 Correct 2715 ms 865240 KB Output is correct
6 Correct 836 ms 146860 KB Output is correct
7 Correct 2599 ms 865240 KB Output is correct
8 Correct 990 ms 300812 KB Output is correct
9 Correct 2560 ms 864964 KB Output is correct
10 Correct 2437 ms 868440 KB Output is correct
11 Correct 2315 ms 868528 KB Output is correct
12 Correct 2480 ms 868408 KB Output is correct
13 Correct 2606 ms 865356 KB Output is correct
14 Correct 2331 ms 867268 KB Output is correct
15 Correct 1926 ms 868472 KB Output is correct
16 Correct 1964 ms 868596 KB Output is correct
17 Correct 3 ms 4944 KB Output is correct
18 Correct 4 ms 4944 KB Output is correct
19 Correct 6 ms 4944 KB Output is correct
20 Correct 7 ms 5072 KB Output is correct
21 Correct 8 ms 5072 KB Output is correct
22 Correct 7 ms 5072 KB Output is correct
23 Correct 5 ms 5072 KB Output is correct
24 Correct 4 ms 5072 KB Output is correct
25 Correct 3 ms 5072 KB Output is correct
26 Correct 6 ms 8016 KB Output is correct
27 Correct 30 ms 11216 KB Output is correct
28 Correct 32 ms 11264 KB Output is correct
29 Correct 26 ms 11196 KB Output is correct
30 Correct 31 ms 11232 KB Output is correct
31 Correct 16 ms 11216 KB Output is correct
32 Correct 3 ms 4944 KB Output is correct
33 Correct 647 ms 502984 KB Output is correct
34 Correct 1492 ms 864956 KB Output is correct
35 Correct 1215 ms 868388 KB Output is correct
36 Correct 2076 ms 865536 KB Output is correct
37 Correct 1269 ms 867312 KB Output is correct
38 Correct 1160 ms 868452 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 4 ms 4944 KB Output is correct
3 Correct 4 ms 5000 KB Output is correct
4 Correct 706 ms 397320 KB Output is correct
5 Correct 2715 ms 865240 KB Output is correct
6 Correct 836 ms 146860 KB Output is correct
7 Correct 2599 ms 865240 KB Output is correct
8 Correct 990 ms 300812 KB Output is correct
9 Correct 2560 ms 864964 KB Output is correct
10 Correct 2437 ms 868440 KB Output is correct
11 Correct 2315 ms 868528 KB Output is correct
12 Correct 2480 ms 868408 KB Output is correct
13 Correct 2606 ms 865356 KB Output is correct
14 Correct 2331 ms 867268 KB Output is correct
15 Correct 1926 ms 868472 KB Output is correct
16 Correct 1964 ms 868596 KB Output is correct
17 Correct 3 ms 4944 KB Output is correct
18 Correct 4 ms 4944 KB Output is correct
19 Correct 6 ms 4944 KB Output is correct
20 Correct 7 ms 5072 KB Output is correct
21 Correct 8 ms 5072 KB Output is correct
22 Correct 7 ms 5072 KB Output is correct
23 Correct 5 ms 5072 KB Output is correct
24 Correct 4 ms 5072 KB Output is correct
25 Correct 3 ms 5072 KB Output is correct
26 Correct 6 ms 8016 KB Output is correct
27 Correct 30 ms 11216 KB Output is correct
28 Correct 32 ms 11264 KB Output is correct
29 Correct 26 ms 11196 KB Output is correct
30 Correct 31 ms 11232 KB Output is correct
31 Correct 16 ms 11216 KB Output is correct
32 Correct 3 ms 4944 KB Output is correct
33 Correct 647 ms 502984 KB Output is correct
34 Correct 1492 ms 864956 KB Output is correct
35 Correct 1215 ms 868388 KB Output is correct
36 Correct 2076 ms 865536 KB Output is correct
37 Correct 1269 ms 867312 KB Output is correct
38 Correct 1160 ms 868452 KB Output is correct
39 Correct 4 ms 5052 KB Output is correct
40 Correct 3 ms 4944 KB Output is correct
41 Correct 3 ms 4944 KB Output is correct
42 Correct 824 ms 397316 KB Output is correct
43 Correct 2855 ms 865172 KB Output is correct
44 Correct 840 ms 146848 KB Output is correct
45 Correct 2515 ms 865320 KB Output is correct
46 Correct 933 ms 300816 KB Output is correct
47 Correct 2416 ms 864988 KB Output is correct
48 Correct 2399 ms 868544 KB Output is correct
49 Correct 2406 ms 868436 KB Output is correct
50 Correct 2476 ms 868444 KB Output is correct
51 Correct 2413 ms 865360 KB Output is correct
52 Correct 2412 ms 867348 KB Output is correct
53 Correct 2072 ms 868476 KB Output is correct
54 Correct 1778 ms 868496 KB Output is correct
55 Correct 3 ms 4944 KB Output is correct
56 Correct 1752 ms 861720 KB Output is correct
57 Correct 2302 ms 864752 KB Output is correct
58 Correct 598 ms 155960 KB Output is correct
59 Correct 2292 ms 865372 KB Output is correct
60 Correct 774 ms 309872 KB Output is correct
61 Correct 2544 ms 864704 KB Output is correct
62 Correct 2148 ms 868480 KB Output is correct
63 Correct 1963 ms 868464 KB Output is correct
64 Correct 2273 ms 867848 KB Output is correct
65 Correct 2437 ms 865440 KB Output is correct
66 Correct 2065 ms 867348 KB Output is correct
67 Correct 1803 ms 868480 KB Output is correct
68 Correct 1582 ms 868472 KB Output is correct
69 Correct 3 ms 4944 KB Output is correct
70 Correct 4 ms 4944 KB Output is correct
71 Correct 7 ms 5072 KB Output is correct
72 Correct 6 ms 5072 KB Output is correct
73 Correct 6 ms 5072 KB Output is correct
74 Correct 5 ms 5072 KB Output is correct
75 Correct 5 ms 5072 KB Output is correct
76 Correct 3 ms 4944 KB Output is correct
77 Correct 3 ms 4944 KB Output is correct
78 Correct 5 ms 4944 KB Output is correct
79 Correct 7 ms 5072 KB Output is correct
80 Correct 5 ms 5072 KB Output is correct
81 Correct 5 ms 5072 KB Output is correct
82 Correct 5 ms 5072 KB Output is correct
83 Correct 7 ms 5072 KB Output is correct
84 Correct 3 ms 5072 KB Output is correct
85 Correct 9 ms 5072 KB Output is correct
86 Correct 24 ms 11216 KB Output is correct
87 Correct 23 ms 11216 KB Output is correct
88 Correct 25 ms 11216 KB Output is correct
89 Correct 26 ms 11216 KB Output is correct
90 Correct 24 ms 11216 KB Output is correct
91 Correct 3 ms 5072 KB Output is correct
92 Correct 6 ms 8044 KB Output is correct
93 Correct 24 ms 11216 KB Output is correct
94 Correct 15 ms 11164 KB Output is correct
95 Correct 25 ms 11216 KB Output is correct
96 Correct 28 ms 11160 KB Output is correct
97 Correct 22 ms 11248 KB Output is correct
98 Correct 3 ms 4944 KB Output is correct
99 Correct 1741 ms 865288 KB Output is correct
100 Correct 1385 ms 865344 KB Output is correct
101 Correct 1141 ms 868324 KB Output is correct
102 Correct 1642 ms 865020 KB Output is correct
103 Correct 1126 ms 867288 KB Output is correct
104 Correct 842 ms 868544 KB Output is correct
105 Correct 2 ms 4944 KB Output is correct
106 Correct 572 ms 503160 KB Output is correct
107 Correct 1301 ms 864956 KB Output is correct
108 Correct 1028 ms 868452 KB Output is correct
109 Correct 1673 ms 865584 KB Output is correct
110 Correct 1066 ms 867304 KB Output is correct
111 Correct 828 ms 868444 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 2013 ms 692836 KB Output is correct
4 Execution timed out 4111 ms 868508 KB Time limit exceeded
5 Halted 0 ms 0 KB -