oj.uz

Submission #417927

# Submission time Handle Problem Language Result Execution time Memory
417927 2021-06-04T14:42:00 Z aymanrs Rainforest Jumps (APIO21_jumps) C++14
21 / 100
 2876 ms 1048580 KB 
#include <bits/stdc++.h>
using namespace std;
struct node {
	int l, r, v = 1e9, i, lz = 0;
	node *le = nullptr, *ri = nullptr, *c;
};
vector<node*> versions;
void prop(node* n){
	if(n->l == n->r) goto gh;
	if(n->le->i != n->i){
		prop(n->le);
		prop(n->c->le);
		n->le = new node(*n->le);
		n->le->i = n->i;
		n->le->c = n->c->le;
		n->le->v = min(n->le->v, n->le->c->v);
	}
	if(n->ri->i != n->i){
		prop(n->ri);
		prop(n->c->ri);
		n->ri = new node(*n->ri);
		n->ri->i = n->i;
		n->ri->c = n->c->ri;
		n->ri->v = min(n->ri->v, n->ri->c->v);
	}
	gh:
	if(n->lz){
		n->v += n->lz;
		if(n->l != n->r){
			n->le->lz += n->lz;
			n->ri->lz += n->lz;
		}
		n->lz = 0;
	}
}
int get(node* n, int a, int b){
	if(n->v >= 1e9) {
		n->lz = 0;
		return 1e9;
	}
	prop(n);
	if(n->r < a || b < n->l) return 1e9;
	if(a <= n->l && n->r <= b){
		return n->v;
	}
	return min(get(n->le, a, b), get(n->ri, a, b));
}
void upd(node* n){
	prop(n);
	n->v = 0;
	if(n->l == n->r) return;
	if(n->i <= n->le->r) upd(n->le);
	else upd(n->ri);
}
void cons(node* n){
	if(n->l <= n->i && n->i <= n->r) n->v = 0;
	else n->v = 1e9;
	if(n->l == n->r) return;
	int mid = (n->l+n->r)/2;
	n->le = new node;
	n->le->i = n->i;
	n->le->l = n->l;
	n->le->r = mid;
	cons(n->le);
	n->ri = new node;
	n->ri->i = n->i;
	n->ri->l = mid+1;
	n->ri->r = n->r;
	cons(n->ri);
}
void init(int N, vector<int> H){
	int sparse[N][18];
	for(int i = 0;i < N;i++){
		sparse[i][0] = H[i];
	}
	for(int k = 1;k < 18;k++){
		for(int i = 0;i + (1 << k) - 1 < N;i++){
			sparse[i][k] = max(sparse[i][k-1], sparse[i + (1 << (k-1))][k-1]);
		}
	}
	int bl[N+1] = {0};
	for(int i = 2;i <= N;i++){
		bl[i] = bl[i-1];
		if((i&-i) == i) bl[i]++;
	}
	versions.resize(N, nullptr);
	int mx = max_element(H.begin(), H.end()) - H.begin();
	node* inst = new node;
	inst->i = mx;
	inst->l = 0;
	inst->r = N-1;
	cons(inst);
	versions[mx] = inst;
	int f, t;
	pair<int, int> tem[N];
	for(int i= 0;i < N;i++) tem[i] = {H[i], i};
	sort(tem, tem+N, greater<pair<int, int>>());
	for(int j = 1;j < N;j++){
		int i = tem[j].second;
		f = t = -1;
		int l = 0, r = i-1, m, b = -1;
		while(l <= r){
			m = (l+r)/2;
			int d = r-m+1;
			if(max(sparse[m][bl[d]], sparse[r - (1 << bl[d]) + 1][bl[d]]) > H[i]){
				l = m+1;
				if(H[m] > H[i]) b = max(b, m);
			} else r = m-1;
		}
		if(b!=-1) f = b;
		l = i+1, r = N-1,b = N;
		while(l <= r){
			m = (l+r)/2;
			int d = m-l+1;
			if(max(sparse[l][bl[d]], sparse[m - (1 << bl[d]) + 1][bl[d]]) > H[i]){
				r = m-1;
				if(H[m] > H[i]) b = min(b, m);
			} else l = m+1;
		}
		if(b!=N) t = b;
		if(f == -1) {
			versions[i] = new node(*versions[t]);
			versions[i]->i = i;
			versions[i]->c = versions[t];
		} else if (t == -1){
			versions[i] = new node(*versions[f]);
			versions[i]->i = i;
			versions[i]->c = versions[f];
		} else {
			versions[i] = new node(*versions[f]);
			versions[i]->i = i;
			versions[i]->c = versions[t];
		}
		versions[i]->lz++;
		upd(versions[i]);
	}
}
int minimum_jumps(int A, int B, int C, int D){
	int a = 1e9;
	for(int i = A;i <= B;i++){
		a = min(a, get(versions[i], C, D));
	}
	return a >= 1e9 ? -1 : a;
}
// int main(){
// 	init(7, {3, 2, 1, 6, 4, 5, 7});
// 	cout << minimum_jumps(4, 4, 6, 6) << '\n';
// 	cout << minimum_jumps(1, 3, 5, 6) << '\n';
// 	cout << minimum_jumps(0, 1, 2, 2) << '\n';
// }

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Runtime error 1840 ms 1048580 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 6 ms 1992 KB Output is correct
7 Correct 5 ms 1480 KB Output is correct
8 Correct 6 ms 1864 KB Output is correct
9 Correct 3 ms 1352 KB Output is correct
10 Correct 6 ms 2228 KB Output is correct
11 Correct 11 ms 5192 KB Output is correct
12 Correct 13 ms 5064 KB Output is correct
13 Correct 12 ms 5044 KB Output is correct
14 Correct 7 ms 2248 KB Output is correct
15 Correct 11 ms 5224 KB Output is correct
16 Correct 10 ms 5088 KB Output is correct
17 Correct 9 ms 5104 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 2 ms 328 KB Output is correct
20 Correct 6 ms 1992 KB Output is correct
21 Correct 12 ms 5064 KB Output is correct
22 Correct 7 ms 2220 KB Output is correct
23 Correct 10 ms 5152 KB Output is correct
24 Correct 9 ms 5192 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 0 ms 200 KB Output is correct
27 Correct 2 ms 200 KB Output is correct
28 Correct 4 ms 1608 KB Output is correct
29 Correct 8 ms 5064 KB Output is correct
30 Correct 6 ms 1992 KB Output is correct
31 Correct 9 ms 5192 KB Output is correct
32 Correct 7 ms 5064 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 2 ms 1096 KB Output is correct
35 Correct 3 ms 1608 KB Output is correct
36 Correct 7 ms 5064 KB Output is correct
37 Correct 3 ms 1736 KB Output is correct
38 Correct 8 ms 5192 KB Output is correct
39 Correct 7 ms 5064 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 6 ms 1992 KB Output is correct
7 Correct 5 ms 1480 KB Output is correct
8 Correct 6 ms 1864 KB Output is correct
9 Correct 3 ms 1352 KB Output is correct
10 Correct 6 ms 2228 KB Output is correct
11 Correct 11 ms 5192 KB Output is correct
12 Correct 13 ms 5064 KB Output is correct
13 Correct 12 ms 5044 KB Output is correct
14 Correct 7 ms 2248 KB Output is correct
15 Correct 11 ms 5224 KB Output is correct
16 Correct 10 ms 5088 KB Output is correct
17 Correct 9 ms 5104 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 2 ms 328 KB Output is correct
20 Correct 6 ms 1992 KB Output is correct
21 Correct 12 ms 5064 KB Output is correct
22 Correct 7 ms 2220 KB Output is correct
23 Correct 10 ms 5152 KB Output is correct
24 Correct 9 ms 5192 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 0 ms 200 KB Output is correct
27 Correct 2 ms 200 KB Output is correct
28 Correct 4 ms 1608 KB Output is correct
29 Correct 8 ms 5064 KB Output is correct
30 Correct 6 ms 1992 KB Output is correct
31 Correct 9 ms 5192 KB Output is correct
32 Correct 7 ms 5064 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 2 ms 1096 KB Output is correct
35 Correct 3 ms 1608 KB Output is correct
36 Correct 7 ms 5064 KB Output is correct
37 Correct 3 ms 1736 KB Output is correct
38 Correct 8 ms 5192 KB Output is correct
39 Correct 7 ms 5064 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 0 ms 200 KB Output is correct
42 Correct 0 ms 200 KB Output is correct
43 Correct 1 ms 200 KB Output is correct
44 Correct 3 ms 200 KB Output is correct
45 Correct 6 ms 1992 KB Output is correct
46 Correct 4 ms 1480 KB Output is correct
47 Correct 7 ms 1864 KB Output is correct
48 Correct 3 ms 1352 KB Output is correct
49 Correct 7 ms 2248 KB Output is correct
50 Correct 14 ms 5224 KB Output is correct
51 Correct 12 ms 5108 KB Output is correct
52 Correct 11 ms 5064 KB Output is correct
53 Correct 6 ms 2248 KB Output is correct
54 Correct 11 ms 5192 KB Output is correct
55 Correct 9 ms 5200 KB Output is correct
56 Correct 10 ms 5064 KB Output is correct
57 Correct 2 ms 1480 KB Output is correct
58 Correct 216 ms 54620 KB Output is correct
59 Correct 477 ms 80144 KB Output is correct
60 Correct 61 ms 19640 KB Output is correct
61 Correct 360 ms 70424 KB Output is correct
62 Correct 21 ms 1984 KB Output is correct
63 Correct 410 ms 79516 KB Output is correct
64 Correct 2876 ms 500332 KB Output is correct
65 Correct 2735 ms 499828 KB Output is correct
66 Correct 2782 ms 497512 KB Output is correct
67 Correct 308 ms 78740 KB Output is correct
68 Correct 2428 ms 500472 KB Output is correct
69 Correct 1454 ms 499596 KB Output is correct
70 Correct 800 ms 499640 KB Output is correct
71 Correct 0 ms 200 KB Output is correct
72 Correct 1 ms 328 KB Output is correct
73 Correct 6 ms 2120 KB Output is correct
74 Correct 10 ms 5080 KB Output is correct
75 Correct 6 ms 2176 KB Output is correct
76 Correct 10 ms 5248 KB Output is correct
77 Correct 9 ms 5192 KB Output is correct
78 Correct 0 ms 200 KB Output is correct
79 Correct 0 ms 200 KB Output is correct
80 Correct 2 ms 200 KB Output is correct
81 Correct 4 ms 1608 KB Output is correct
82 Correct 10 ms 5064 KB Output is correct
83 Correct 5 ms 1992 KB Output is correct
84 Correct 9 ms 5192 KB Output is correct
85 Correct 8 ms 5064 KB Output is correct
86 Correct 0 ms 200 KB Output is correct
87 Correct 1 ms 1096 KB Output is correct
88 Correct 2 ms 1608 KB Output is correct
89 Correct 6 ms 5064 KB Output is correct
90 Correct 3 ms 1664 KB Output is correct
91 Correct 6 ms 5192 KB Output is correct
92 Correct 7 ms 5064 KB Output is correct
93 Correct 2 ms 1480 KB Output is correct
94 Correct 9 ms 2376 KB Output is correct
95 Correct 313 ms 70688 KB Output is correct
96 Correct 1719 ms 498708 KB Output is correct
97 Correct 433 ms 90068 KB Output is correct
98 Correct 1883 ms 500520 KB Output is correct
99 Correct 698 ms 499492 KB Output is correct
100 Correct 2 ms 1480 KB Output is correct
101 Correct 16 ms 10456 KB Output is correct
102 Correct 144 ms 63940 KB Output is correct
103 Correct 578 ms 497752 KB Output is correct
104 Correct 154 ms 76036 KB Output is correct
105 Correct 602 ms 499700 KB Output is correct
106 Correct 592 ms 499216 KB Output is correct
107 Correct 2 ms 1608 KB Output is correct
108 Correct 30 ms 15296 KB Output is correct
109 Correct 120 ms 59344 KB Output is correct
110 Correct 571 ms 497324 KB Output is correct
111 Correct 134 ms 75840 KB Output is correct
112 Correct 572 ms 499684 KB Output is correct
113 Correct 574 ms 499220 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Runtime error 2045 ms 1048580 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Runtime error 2027 ms 1048580 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Runtime error 2027 ms 1048580 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Runtime error 1840 ms 1048580 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -