oj.uz

Submission #567332

# Submission time Handle Problem Language Result Execution time Memory
567332 2022-05-23T10:37:00 Z amunduzbaev Rainforest Jumps (APIO21_jumps) C++17
52 / 100
 4000 ms 648096 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];
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[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, 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 2 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 1514 ms 517284 KB Output is correct
4 Execution timed out 4098 ms 647996 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 4 ms 4944 KB Output is correct
6 Correct 4 ms 5072 KB Output is correct
7 Correct 4 ms 5072 KB Output is correct
8 Correct 4 ms 5072 KB Output is correct
9 Correct 3 ms 5072 KB Output is correct
10 Correct 5 ms 5072 KB Output is correct
11 Correct 5 ms 5072 KB Output is correct
12 Correct 5 ms 5072 KB Output is correct
13 Correct 4 ms 5072 KB Output is correct
14 Correct 5 ms 5072 KB Output is correct
15 Correct 4 ms 5072 KB Output is correct
16 Correct 7 ms 5072 KB Output is correct
17 Correct 6 ms 5072 KB Output is correct
18 Correct 3 ms 4944 KB Output is correct
19 Correct 4 ms 4944 KB Output is correct
20 Correct 5 ms 5072 KB Output is correct
21 Correct 5 ms 5072 KB Output is correct
22 Correct 4 ms 5072 KB Output is correct
23 Correct 7 ms 5072 KB Output is correct
24 Correct 6 ms 5072 KB Output is correct
25 Correct 3 ms 4944 KB Output is correct
26 Correct 3 ms 5072 KB Output is correct
27 Correct 4 ms 4944 KB Output is correct
28 Correct 4 ms 5060 KB Output is correct
29 Correct 4 ms 5072 KB Output is correct
30 Correct 4 ms 5072 KB Output is correct
31 Correct 4 ms 5072 KB Output is correct
32 Correct 5 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 3 ms 5072 KB Output is correct
37 Correct 3 ms 5072 KB Output is correct
38 Correct 3 ms 5072 KB Output is correct
39 Correct 3 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 4 ms 4944 KB Output is correct
6 Correct 4 ms 5072 KB Output is correct
7 Correct 4 ms 5072 KB Output is correct
8 Correct 4 ms 5072 KB Output is correct
9 Correct 3 ms 5072 KB Output is correct
10 Correct 5 ms 5072 KB Output is correct
11 Correct 5 ms 5072 KB Output is correct
12 Correct 5 ms 5072 KB Output is correct
13 Correct 4 ms 5072 KB Output is correct
14 Correct 5 ms 5072 KB Output is correct
15 Correct 4 ms 5072 KB Output is correct
16 Correct 7 ms 5072 KB Output is correct
17 Correct 6 ms 5072 KB Output is correct
18 Correct 3 ms 4944 KB Output is correct
19 Correct 4 ms 4944 KB Output is correct
20 Correct 5 ms 5072 KB Output is correct
21 Correct 5 ms 5072 KB Output is correct
22 Correct 4 ms 5072 KB Output is correct
23 Correct 7 ms 5072 KB Output is correct
24 Correct 6 ms 5072 KB Output is correct
25 Correct 3 ms 4944 KB Output is correct
26 Correct 3 ms 5072 KB Output is correct
27 Correct 4 ms 4944 KB Output is correct
28 Correct 4 ms 5060 KB Output is correct
29 Correct 4 ms 5072 KB Output is correct
30 Correct 4 ms 5072 KB Output is correct
31 Correct 4 ms 5072 KB Output is correct
32 Correct 5 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 3 ms 5072 KB Output is correct
37 Correct 3 ms 5072 KB Output is correct
38 Correct 3 ms 5072 KB Output is correct
39 Correct 3 ms 5072 KB Output is correct
40 Correct 3 ms 4944 KB Output is correct
41 Correct 3 ms 4944 KB Output is correct
42 Correct 3 ms 4944 KB Output is correct
43 Correct 3 ms 4944 KB Output is correct
44 Correct 4 ms 4952 KB Output is correct
45 Correct 5 ms 5072 KB Output is correct
46 Correct 5 ms 5072 KB Output is correct
47 Correct 5 ms 5072 KB Output is correct
48 Correct 4 ms 5072 KB Output is correct
49 Correct 5 ms 5072 KB Output is correct
50 Correct 5 ms 5072 KB Output is correct
51 Correct 5 ms 5068 KB Output is correct
52 Correct 5 ms 5072 KB Output is correct
53 Correct 4 ms 5072 KB Output is correct
54 Correct 6 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 3 ms 5072 KB Output is correct
58 Correct 18 ms 10320 KB Output is correct
59 Correct 24 ms 10448 KB Output is correct
60 Correct 10 ms 8072 KB Output is correct
61 Correct 24 ms 10448 KB Output is correct
62 Correct 14 ms 5072 KB Output is correct
63 Incorrect 26 ms 10448 KB Output isn't correct
64 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 1049 ms 519204 KB Output is correct
6 Correct 1194 ms 644140 KB Output is correct
7 Correct 385 ms 333156 KB Output is correct
8 Incorrect 1622 ms 644544 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 2 ms 5028 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Correct 526 ms 297252 KB Output is correct
5 Correct 2126 ms 644796 KB Output is correct
6 Correct 520 ms 111168 KB Output is correct
7 Correct 1867 ms 644780 KB Output is correct
8 Correct 606 ms 225332 KB Output is correct
9 Correct 1743 ms 644588 KB Output is correct
10 Correct 1744 ms 648024 KB Output is correct
11 Correct 1512 ms 647932 KB Output is correct
12 Correct 1702 ms 647936 KB Output is correct
13 Correct 1804 ms 644824 KB Output is correct
14 Correct 1710 ms 646680 KB Output is correct
15 Correct 1417 ms 647956 KB Output is correct
16 Correct 1361 ms 647920 KB Output is correct
17 Correct 3 ms 4944 KB Output is correct
18 Correct 3 ms 4944 KB Output is correct
19 Correct 4 ms 4944 KB Output is correct
20 Correct 5 ms 5092 KB Output is correct
21 Correct 5 ms 5072 KB Output is correct
22 Correct 5 ms 5072 KB Output is correct
23 Correct 5 ms 5072 KB Output is correct
24 Correct 5 ms 5072 KB Output is correct
25 Correct 3 ms 5072 KB Output is correct
26 Correct 8 ms 8016 KB Output is correct
27 Correct 26 ms 10448 KB Output is correct
28 Correct 29 ms 10444 KB Output is correct
29 Correct 21 ms 10448 KB Output is correct
30 Correct 20 ms 10448 KB Output is correct
31 Correct 27 ms 10448 KB Output is correct
32 Correct 2 ms 4944 KB Output is correct
33 Correct 488 ms 375616 KB Output is correct
34 Correct 1109 ms 644416 KB Output is correct
35 Correct 886 ms 647852 KB Output is correct
36 Correct 1509 ms 645028 KB Output is correct
37 Correct 867 ms 646680 KB Output is correct
38 Correct 638 ms 648048 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5028 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Correct 526 ms 297252 KB Output is correct
5 Correct 2126 ms 644796 KB Output is correct
6 Correct 520 ms 111168 KB Output is correct
7 Correct 1867 ms 644780 KB Output is correct
8 Correct 606 ms 225332 KB Output is correct
9 Correct 1743 ms 644588 KB Output is correct
10 Correct 1744 ms 648024 KB Output is correct
11 Correct 1512 ms 647932 KB Output is correct
12 Correct 1702 ms 647936 KB Output is correct
13 Correct 1804 ms 644824 KB Output is correct
14 Correct 1710 ms 646680 KB Output is correct
15 Correct 1417 ms 647956 KB Output is correct
16 Correct 1361 ms 647920 KB Output is correct
17 Correct 3 ms 4944 KB Output is correct
18 Correct 3 ms 4944 KB Output is correct
19 Correct 4 ms 4944 KB Output is correct
20 Correct 5 ms 5092 KB Output is correct
21 Correct 5 ms 5072 KB Output is correct
22 Correct 5 ms 5072 KB Output is correct
23 Correct 5 ms 5072 KB Output is correct
24 Correct 5 ms 5072 KB Output is correct
25 Correct 3 ms 5072 KB Output is correct
26 Correct 8 ms 8016 KB Output is correct
27 Correct 26 ms 10448 KB Output is correct
28 Correct 29 ms 10444 KB Output is correct
29 Correct 21 ms 10448 KB Output is correct
30 Correct 20 ms 10448 KB Output is correct
31 Correct 27 ms 10448 KB Output is correct
32 Correct 2 ms 4944 KB Output is correct
33 Correct 488 ms 375616 KB Output is correct
34 Correct 1109 ms 644416 KB Output is correct
35 Correct 886 ms 647852 KB Output is correct
36 Correct 1509 ms 645028 KB Output is correct
37 Correct 867 ms 646680 KB Output is correct
38 Correct 638 ms 648048 KB Output is correct
39 Correct 3 ms 4944 KB Output is correct
40 Correct 3 ms 5016 KB Output is correct
41 Correct 4 ms 4944 KB Output is correct
42 Correct 590 ms 297060 KB Output is correct
43 Correct 2047 ms 644700 KB Output is correct
44 Correct 627 ms 111148 KB Output is correct
45 Correct 1732 ms 644720 KB Output is correct
46 Correct 680 ms 225400 KB Output is correct
47 Correct 1888 ms 644432 KB Output is correct
48 Correct 1798 ms 648064 KB Output is correct
49 Correct 1846 ms 648096 KB Output is correct
50 Correct 1724 ms 647928 KB Output is correct
51 Correct 1963 ms 644788 KB Output is correct
52 Correct 1875 ms 646764 KB Output is correct
53 Correct 1548 ms 647936 KB Output is correct
54 Correct 1455 ms 647924 KB Output is correct
55 Correct 3 ms 4944 KB Output is correct
56 Correct 1589 ms 641892 KB Output is correct
57 Correct 2250 ms 644092 KB Output is correct
58 Correct 612 ms 117820 KB Output is correct
59 Correct 2027 ms 644728 KB Output is correct
60 Correct 700 ms 232180 KB Output is correct
61 Correct 2294 ms 644072 KB Output is correct
62 Correct 1956 ms 647952 KB Output is correct
63 Correct 2017 ms 647688 KB Output is correct
64 Correct 2000 ms 647416 KB Output is correct
65 Correct 2242 ms 644852 KB Output is correct
66 Correct 1838 ms 646744 KB Output is correct
67 Correct 1791 ms 647948 KB Output is correct
68 Correct 1627 ms 647944 KB Output is correct
69 Correct 3 ms 4944 KB Output is correct
70 Correct 3 ms 4944 KB Output is correct
71 Correct 4 ms 5044 KB Output is correct
72 Correct 5 ms 5072 KB Output is correct
73 Correct 4 ms 5072 KB Output is correct
74 Correct 6 ms 5040 KB Output is correct
75 Correct 5 ms 5072 KB Output is correct
76 Correct 3 ms 5028 KB Output is correct
77 Correct 3 ms 4944 KB Output is correct
78 Correct 4 ms 4944 KB Output is correct
79 Correct 6 ms 5088 KB Output is correct
80 Correct 5 ms 5072 KB Output is correct
81 Correct 6 ms 5120 KB Output is correct
82 Correct 6 ms 5072 KB Output is correct
83 Correct 6 ms 5072 KB Output is correct
84 Correct 4 ms 5032 KB Output is correct
85 Correct 5 ms 5072 KB Output is correct
86 Correct 20 ms 10412 KB Output is correct
87 Correct 29 ms 10420 KB Output is correct
88 Correct 33 ms 10448 KB Output is correct
89 Correct 25 ms 10392 KB Output is correct
90 Correct 38 ms 10448 KB Output is correct
91 Correct 4 ms 5072 KB Output is correct
92 Correct 9 ms 8016 KB Output is correct
93 Correct 24 ms 10448 KB Output is correct
94 Correct 34 ms 10432 KB Output is correct
95 Correct 26 ms 10448 KB Output is correct
96 Correct 19 ms 10424 KB Output is correct
97 Correct 28 ms 10448 KB Output is correct
98 Correct 3 ms 4944 KB Output is correct
99 Correct 1745 ms 644716 KB Output is correct
100 Correct 1309 ms 644716 KB Output is correct
101 Correct 1102 ms 647744 KB Output is correct
102 Correct 1577 ms 644364 KB Output is correct
103 Correct 1127 ms 646708 KB Output is correct
104 Correct 793 ms 647956 KB Output is correct
105 Correct 5 ms 4944 KB Output is correct
106 Correct 613 ms 375580 KB Output is correct
107 Correct 1482 ms 644344 KB Output is correct
108 Correct 1029 ms 647812 KB Output is correct
109 Correct 1925 ms 644980 KB Output is correct
110 Correct 1192 ms 646764 KB Output is correct
111 Correct 849 ms 647952 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 1514 ms 517284 KB Output is correct
4 Execution timed out 4098 ms 647996 KB Time limit exceeded
5 Halted 0 ms 0 KB -