oj.uz

Submission #567336

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

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

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

const int B = 650;
const int N = 2e5 + 5;
const int M = N / B + 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];
int lx[N], rx[N];

struct ST{
	int tree[N << 2], b;
	void build(int lx = 0, int rx = N - 1, int x = 1){
		if(lx == rx) { tree[x] = pre[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[M];

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 * B<n;b++){
		memset(pre, 127, sizeof pre);
		queue<int> q;
		for(int i=0;b * B + i<n;i++){
			q.push(b * B + i);
			pre[b * B + i] = 0;
		}
		
		while(!q.empty()){
			int u = q.front(); q.pop();
			for(auto x : edges[u]){
				if(pre[x] > pre[u] + 1){
					pre[x] = pre[u] + 1;
					q.push(x);
				}
			}
		}
		
		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 5 ms 7760 KB Output is correct
2 Correct 7 ms 7760 KB Output is correct
3 Correct 1897 ms 554236 KB Output is correct
4 Execution timed out 4078 ms 695208 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7808 KB Output is correct
2 Correct 7 ms 7760 KB Output is correct
3 Correct 7 ms 7760 KB Output is correct
4 Correct 5 ms 7760 KB Output is correct
5 Correct 6 ms 7760 KB Output is correct
6 Correct 7 ms 7888 KB Output is correct
7 Correct 9 ms 7940 KB Output is correct
8 Correct 6 ms 7888 KB Output is correct
9 Correct 6 ms 7924 KB Output is correct
10 Correct 10 ms 7888 KB Output is correct
11 Correct 9 ms 7888 KB Output is correct
12 Correct 9 ms 7928 KB Output is correct
13 Correct 10 ms 7936 KB Output is correct
14 Correct 7 ms 7936 KB Output is correct
15 Correct 8 ms 7888 KB Output is correct
16 Correct 10 ms 7888 KB Output is correct
17 Correct 10 ms 7888 KB Output is correct
18 Correct 5 ms 7760 KB Output is correct
19 Correct 6 ms 7936 KB Output is correct
20 Correct 9 ms 7832 KB Output is correct
21 Correct 7 ms 7936 KB Output is correct
22 Correct 7 ms 7888 KB Output is correct
23 Correct 7 ms 7884 KB Output is correct
24 Correct 6 ms 7888 KB Output is correct
25 Correct 7 ms 7824 KB Output is correct
26 Correct 6 ms 7804 KB Output is correct
27 Correct 7 ms 7864 KB Output is correct
28 Correct 8 ms 7888 KB Output is correct
29 Correct 9 ms 7868 KB Output is correct
30 Correct 9 ms 7888 KB Output is correct
31 Correct 10 ms 7928 KB Output is correct
32 Correct 8 ms 7888 KB Output is correct
33 Correct 5 ms 7760 KB Output is correct
34 Correct 6 ms 7888 KB Output is correct
35 Correct 5 ms 7916 KB Output is correct
36 Correct 6 ms 7836 KB Output is correct
37 Correct 6 ms 7888 KB Output is correct
38 Correct 9 ms 7816 KB Output is correct
39 Correct 5 ms 7888 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7808 KB Output is correct
2 Correct 7 ms 7760 KB Output is correct
3 Correct 7 ms 7760 KB Output is correct
4 Correct 5 ms 7760 KB Output is correct
5 Correct 6 ms 7760 KB Output is correct
6 Correct 7 ms 7888 KB Output is correct
7 Correct 9 ms 7940 KB Output is correct
8 Correct 6 ms 7888 KB Output is correct
9 Correct 6 ms 7924 KB Output is correct
10 Correct 10 ms 7888 KB Output is correct
11 Correct 9 ms 7888 KB Output is correct
12 Correct 9 ms 7928 KB Output is correct
13 Correct 10 ms 7936 KB Output is correct
14 Correct 7 ms 7936 KB Output is correct
15 Correct 8 ms 7888 KB Output is correct
16 Correct 10 ms 7888 KB Output is correct
17 Correct 10 ms 7888 KB Output is correct
18 Correct 5 ms 7760 KB Output is correct
19 Correct 6 ms 7936 KB Output is correct
20 Correct 9 ms 7832 KB Output is correct
21 Correct 7 ms 7936 KB Output is correct
22 Correct 7 ms 7888 KB Output is correct
23 Correct 7 ms 7884 KB Output is correct
24 Correct 6 ms 7888 KB Output is correct
25 Correct 7 ms 7824 KB Output is correct
26 Correct 6 ms 7804 KB Output is correct
27 Correct 7 ms 7864 KB Output is correct
28 Correct 8 ms 7888 KB Output is correct
29 Correct 9 ms 7868 KB Output is correct
30 Correct 9 ms 7888 KB Output is correct
31 Correct 10 ms 7928 KB Output is correct
32 Correct 8 ms 7888 KB Output is correct
33 Correct 5 ms 7760 KB Output is correct
34 Correct 6 ms 7888 KB Output is correct
35 Correct 5 ms 7916 KB Output is correct
36 Correct 6 ms 7836 KB Output is correct
37 Correct 6 ms 7888 KB Output is correct
38 Correct 9 ms 7816 KB Output is correct
39 Correct 5 ms 7888 KB Output is correct
40 Correct 7 ms 7760 KB Output is correct
41 Correct 5 ms 7760 KB Output is correct
42 Correct 5 ms 7760 KB Output is correct
43 Correct 7 ms 7760 KB Output is correct
44 Correct 9 ms 7888 KB Output is correct
45 Correct 7 ms 7936 KB Output is correct
46 Correct 6 ms 7888 KB Output is correct
47 Correct 10 ms 7888 KB Output is correct
48 Correct 7 ms 7940 KB Output is correct
49 Correct 10 ms 7888 KB Output is correct
50 Correct 9 ms 7888 KB Output is correct
51 Correct 9 ms 7888 KB Output is correct
52 Correct 8 ms 7888 KB Output is correct
53 Correct 7 ms 7824 KB Output is correct
54 Correct 7 ms 7940 KB Output is correct
55 Correct 8 ms 7852 KB Output is correct
56 Correct 7 ms 7888 KB Output is correct
57 Correct 5 ms 7888 KB Output is correct
58 Correct 30 ms 12368 KB Output is correct
59 Incorrect 22 ms 14552 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7760 KB Output is correct
2 Correct 7 ms 7760 KB Output is correct
3 Correct 5 ms 7760 KB Output is correct
4 Correct 6 ms 7760 KB Output is correct
5 Correct 1400 ms 558468 KB Output is correct
6 Correct 1651 ms 691492 KB Output is correct
7 Correct 523 ms 357736 KB Output is correct
8 Incorrect 2344 ms 691596 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 5 ms 7760 KB Output is correct
2 Correct 7 ms 7808 KB Output is correct
3 Correct 7 ms 7760 KB Output is correct
4 Correct 715 ms 319676 KB Output is correct
5 Correct 2796 ms 692052 KB Output is correct
6 Correct 816 ms 119380 KB Output is correct
7 Correct 2536 ms 691908 KB Output is correct
8 Correct 821 ms 241884 KB Output is correct
9 Correct 2441 ms 691904 KB Output is correct
10 Correct 2309 ms 695180 KB Output is correct
11 Correct 2281 ms 695236 KB Output is correct
12 Correct 2383 ms 695180 KB Output is correct
13 Correct 2308 ms 692284 KB Output is correct
14 Correct 2102 ms 694044 KB Output is correct
15 Correct 1589 ms 695392 KB Output is correct
16 Correct 1621 ms 695188 KB Output is correct
17 Correct 5 ms 7760 KB Output is correct
18 Correct 5 ms 7808 KB Output is correct
19 Correct 6 ms 7760 KB Output is correct
20 Correct 7 ms 7924 KB Output is correct
21 Correct 7 ms 7936 KB Output is correct
22 Correct 8 ms 7888 KB Output is correct
23 Correct 8 ms 7936 KB Output is correct
24 Correct 8 ms 7924 KB Output is correct
25 Correct 5 ms 7892 KB Output is correct
26 Correct 10 ms 10112 KB Output is correct
27 Correct 24 ms 14544 KB Output is correct
28 Correct 28 ms 14588 KB Output is correct
29 Correct 30 ms 14544 KB Output is correct
30 Correct 40 ms 14544 KB Output is correct
31 Correct 26 ms 14544 KB Output is correct
32 Correct 7 ms 7820 KB Output is correct
33 Correct 631 ms 404420 KB Output is correct
34 Correct 1411 ms 691692 KB Output is correct
35 Correct 1192 ms 695080 KB Output is correct
36 Correct 2019 ms 692316 KB Output is correct
37 Correct 1208 ms 694092 KB Output is correct
38 Correct 773 ms 695296 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7760 KB Output is correct
2 Correct 7 ms 7808 KB Output is correct
3 Correct 7 ms 7760 KB Output is correct
4 Correct 715 ms 319676 KB Output is correct
5 Correct 2796 ms 692052 KB Output is correct
6 Correct 816 ms 119380 KB Output is correct
7 Correct 2536 ms 691908 KB Output is correct
8 Correct 821 ms 241884 KB Output is correct
9 Correct 2441 ms 691904 KB Output is correct
10 Correct 2309 ms 695180 KB Output is correct
11 Correct 2281 ms 695236 KB Output is correct
12 Correct 2383 ms 695180 KB Output is correct
13 Correct 2308 ms 692284 KB Output is correct
14 Correct 2102 ms 694044 KB Output is correct
15 Correct 1589 ms 695392 KB Output is correct
16 Correct 1621 ms 695188 KB Output is correct
17 Correct 5 ms 7760 KB Output is correct
18 Correct 5 ms 7808 KB Output is correct
19 Correct 6 ms 7760 KB Output is correct
20 Correct 7 ms 7924 KB Output is correct
21 Correct 7 ms 7936 KB Output is correct
22 Correct 8 ms 7888 KB Output is correct
23 Correct 8 ms 7936 KB Output is correct
24 Correct 8 ms 7924 KB Output is correct
25 Correct 5 ms 7892 KB Output is correct
26 Correct 10 ms 10112 KB Output is correct
27 Correct 24 ms 14544 KB Output is correct
28 Correct 28 ms 14588 KB Output is correct
29 Correct 30 ms 14544 KB Output is correct
30 Correct 40 ms 14544 KB Output is correct
31 Correct 26 ms 14544 KB Output is correct
32 Correct 7 ms 7820 KB Output is correct
33 Correct 631 ms 404420 KB Output is correct
34 Correct 1411 ms 691692 KB Output is correct
35 Correct 1192 ms 695080 KB Output is correct
36 Correct 2019 ms 692316 KB Output is correct
37 Correct 1208 ms 694092 KB Output is correct
38 Correct 773 ms 695296 KB Output is correct
39 Correct 5 ms 7808 KB Output is correct
40 Correct 5 ms 7760 KB Output is correct
41 Correct 7 ms 7936 KB Output is correct
42 Correct 689 ms 319752 KB Output is correct
43 Correct 2598 ms 692044 KB Output is correct
44 Correct 863 ms 119376 KB Output is correct
45 Correct 2224 ms 691908 KB Output is correct
46 Correct 800 ms 242000 KB Output is correct
47 Correct 2237 ms 691968 KB Output is correct
48 Correct 2184 ms 695276 KB Output is correct
49 Correct 2109 ms 695240 KB Output is correct
50 Correct 2070 ms 695112 KB Output is correct
51 Correct 2078 ms 692408 KB Output is correct
52 Correct 2009 ms 694096 KB Output is correct
53 Correct 1634 ms 695296 KB Output is correct
54 Correct 1723 ms 695280 KB Output is correct
55 Correct 5 ms 7760 KB Output is correct
56 Correct 1645 ms 689752 KB Output is correct
57 Correct 2276 ms 691808 KB Output is correct
58 Correct 573 ms 126096 KB Output is correct
59 Correct 2036 ms 691976 KB Output is correct
60 Correct 707 ms 250672 KB Output is correct
61 Correct 2474 ms 691532 KB Output is correct
62 Correct 1911 ms 695232 KB Output is correct
63 Correct 1833 ms 695068 KB Output is correct
64 Correct 1663 ms 695008 KB Output is correct
65 Correct 1980 ms 691824 KB Output is correct
66 Correct 2045 ms 694048 KB Output is correct
67 Correct 1592 ms 695200 KB Output is correct
68 Correct 1587 ms 695184 KB Output is correct
69 Correct 6 ms 7760 KB Output is correct
70 Correct 6 ms 7888 KB Output is correct
71 Correct 7 ms 7888 KB Output is correct
72 Correct 7 ms 7888 KB Output is correct
73 Correct 7 ms 7888 KB Output is correct
74 Correct 7 ms 7888 KB Output is correct
75 Correct 7 ms 7888 KB Output is correct
76 Correct 6 ms 7760 KB Output is correct
77 Correct 5 ms 7760 KB Output is correct
78 Correct 6 ms 7760 KB Output is correct
79 Correct 9 ms 7888 KB Output is correct
80 Correct 8 ms 7888 KB Output is correct
81 Correct 7 ms 7888 KB Output is correct
82 Correct 8 ms 7888 KB Output is correct
83 Correct 8 ms 7888 KB Output is correct
84 Correct 6 ms 7888 KB Output is correct
85 Correct 9 ms 7884 KB Output is correct
86 Correct 19 ms 14460 KB Output is correct
87 Correct 27 ms 14512 KB Output is correct
88 Correct 31 ms 14544 KB Output is correct
89 Correct 31 ms 14588 KB Output is correct
90 Correct 29 ms 14544 KB Output is correct
91 Correct 5 ms 7888 KB Output is correct
92 Correct 7 ms 10064 KB Output is correct
93 Correct 29 ms 14544 KB Output is correct
94 Correct 20 ms 14544 KB Output is correct
95 Correct 27 ms 14544 KB Output is correct
96 Correct 26 ms 14572 KB Output is correct
97 Correct 29 ms 14544 KB Output is correct
98 Correct 6 ms 7760 KB Output is correct
99 Correct 1683 ms 691996 KB Output is correct
100 Correct 1145 ms 692160 KB Output is correct
101 Correct 935 ms 695000 KB Output is correct
102 Correct 1445 ms 692296 KB Output is correct
103 Correct 903 ms 694020 KB Output is correct
104 Correct 691 ms 695296 KB Output is correct
105 Correct 5 ms 7760 KB Output is correct
106 Correct 505 ms 404436 KB Output is correct
107 Correct 1149 ms 691704 KB Output is correct
108 Correct 936 ms 695228 KB Output is correct
109 Correct 1547 ms 692400 KB Output is correct
110 Correct 961 ms 694068 KB Output is correct
111 Correct 699 ms 695228 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7760 KB Output is correct
2 Correct 7 ms 7760 KB Output is correct
3 Correct 1897 ms 554236 KB Output is correct
4 Execution timed out 4078 ms 695208 KB Time limit exceeded
5 Halted 0 ms 0 KB -