oj.uz

Submission #768582

# Submission time Handle Problem Language Result Execution time Memory
768582 2023-06-28T09:23:51 Z jmyszka2007 Financial Report (JOI21_financial) C++17
100 / 100
 182 ms 15348 KB 
#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pi pair<int, int>
#define pb push_back
constexpr int LIM = 300'000;
constexpr int base = (1 << 19);
int dp[LIM + 10];
pi tab[LIM + 10];
int ran[LIM + 10];
int tri[2 * base];
int tri2[2 * base];
void upd(int v, int x) {
	v += base;
	while(v > 0) {
		tri[v] = min(tri[v], x);
		v /= 2;
	}
}
int que(int l, int r) {
	l += base;
	r += base;
	int ans = 1e9;
	while(l <= r) {
		if(l & 1) {
			ans = min(ans, tri[l]);
		}
		if(!(r & 1)) {
			ans = min(ans, tri[r]);
		}
		l = (l + 1) / 2;
		r = (r - 1) / 2;
	}
	return ans;
}
void upd2(int l, int r, int x) {
	l += base;
	r += base;
	while(l <= r) {
		if(l & 1) {
			tri2[l] = max(tri2[l], x);
		}
		if(!(r & 1)) {
			tri2[r] = max(tri2[r], x);
		}
		l = (l + 1) / 2;
		r = (r - 1) / 2;
	}
}
int que2(int v) {
	v += base;
	int ans = 0;
	while(v > 0) {
		ans = max(ans, tri2[v]);
		v /= 2;
	}
	return ans;
}
int main() {
	int n, d;
	cin >> n >> d;
	for(int i = 0; i < 2 * base; i++) {
		tri[i] = 1e9;
	}
	for(int i = 1; i <= n; i++) {
		cin >> tab[i].st;
		tab[i].nd = -i;
		upd(i, tab[i].st);
	}
	int ost = tab[n].st;
	vector<pi>prz;
	for(int i = n - d; i >= 1; i--) {
		if(!prz.size() || prz[0].nd <= tab[i].st) {
			ran[i] = n;
		}
		else {
			int l = 0;
			int r = prz.size() - 1;
			while(l < r) {
				int mid = (l + r + 1) / 2;
				if(prz[mid].nd <= tab[i].st) {
					r = mid - 1;
				}
				else {
					l = mid;
				}
			}
			ran[i] = prz[l].st + d - 1;
		}
		int mn = que(i, i + d - 1);
		while(prz.size() && prz.back().nd <= mn) {
			prz.pop_back();
		}
		prz.pb({i, mn});
	}
	for(int i = n; i >= n - d + 1; i--) {
		ran[i] = n;
	}
	sort(tab + 1, tab + n + 1);
	int ans = 0;
	for(int i = 1; i <= n; i++) {
		tab[i].nd *= -1;
		dp[tab[i].nd] = que2(tab[i].nd) + 1;
		upd2(tab[i].nd, ran[tab[i].nd], dp[tab[i].nd]);
		if(tab[i].st >= ost && ran[tab[i].nd] == n) {
			ans = max(ans, dp[tab[i].nd]);
		}
	}
	cout << ans << '\n';
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 2 ms 4412 KB Output is correct
5 Correct 4 ms 4436 KB Output is correct
6 Correct 2 ms 4436 KB Output is correct
7 Correct 2 ms 4436 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 4 ms 4436 KB Output is correct
10 Correct 3 ms 4436 KB Output is correct
11 Correct 2 ms 4436 KB Output is correct
12 Correct 2 ms 4436 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 3 ms 4436 KB Output is correct
16 Correct 3 ms 4436 KB Output is correct
17 Correct 3 ms 4436 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 2 ms 4436 KB Output is correct
21 Correct 2 ms 4436 KB Output is correct
22 Correct 2 ms 4436 KB Output is correct
23 Correct 2 ms 4436 KB Output is correct
24 Correct 3 ms 4436 KB Output is correct
25 Correct 2 ms 4436 KB Output is correct
26 Correct 2 ms 4404 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 2 ms 4412 KB Output is correct
5 Correct 4 ms 4436 KB Output is correct
6 Correct 2 ms 4436 KB Output is correct
7 Correct 2 ms 4436 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 4 ms 4436 KB Output is correct
10 Correct 3 ms 4436 KB Output is correct
11 Correct 2 ms 4436 KB Output is correct
12 Correct 2 ms 4436 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 3 ms 4436 KB Output is correct
16 Correct 3 ms 4436 KB Output is correct
17 Correct 3 ms 4436 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 2 ms 4436 KB Output is correct
21 Correct 2 ms 4436 KB Output is correct
22 Correct 2 ms 4436 KB Output is correct
23 Correct 2 ms 4436 KB Output is correct
24 Correct 3 ms 4436 KB Output is correct
25 Correct 2 ms 4436 KB Output is correct
26 Correct 2 ms 4404 KB Output is correct
27 Correct 2 ms 4436 KB Output is correct
28 Correct 3 ms 4436 KB Output is correct
29 Correct 3 ms 4436 KB Output is correct
30 Correct 2 ms 4436 KB Output is correct
31 Correct 2 ms 4436 KB Output is correct
32 Correct 3 ms 4404 KB Output is correct
33 Correct 3 ms 4436 KB Output is correct
34 Correct 3 ms 4436 KB Output is correct
35 Correct 3 ms 4436 KB Output is correct
36 Correct 3 ms 4436 KB Output is correct
37 Correct 3 ms 4436 KB Output is correct
38 Correct 3 ms 4436 KB Output is correct
39 Correct 3 ms 4436 KB Output is correct
40 Correct 3 ms 4436 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 2 ms 4412 KB Output is correct
5 Correct 4 ms 4436 KB Output is correct
6 Correct 2 ms 4436 KB Output is correct
7 Correct 2 ms 4436 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 4 ms 4436 KB Output is correct
10 Correct 3 ms 4436 KB Output is correct
11 Correct 2 ms 4436 KB Output is correct
12 Correct 2 ms 4436 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 3 ms 4436 KB Output is correct
16 Correct 3 ms 4436 KB Output is correct
17 Correct 3 ms 4436 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 2 ms 4436 KB Output is correct
21 Correct 2 ms 4436 KB Output is correct
22 Correct 2 ms 4436 KB Output is correct
23 Correct 2 ms 4436 KB Output is correct
24 Correct 3 ms 4436 KB Output is correct
25 Correct 2 ms 4436 KB Output is correct
26 Correct 2 ms 4404 KB Output is correct
27 Correct 2 ms 4436 KB Output is correct
28 Correct 3 ms 4436 KB Output is correct
29 Correct 3 ms 4436 KB Output is correct
30 Correct 2 ms 4436 KB Output is correct
31 Correct 2 ms 4436 KB Output is correct
32 Correct 3 ms 4404 KB Output is correct
33 Correct 3 ms 4436 KB Output is correct
34 Correct 3 ms 4436 KB Output is correct
35 Correct 3 ms 4436 KB Output is correct
36 Correct 3 ms 4436 KB Output is correct
37 Correct 3 ms 4436 KB Output is correct
38 Correct 3 ms 4436 KB Output is correct
39 Correct 3 ms 4436 KB Output is correct
40 Correct 3 ms 4436 KB Output is correct
41 Correct 5 ms 4692 KB Output is correct
42 Correct 6 ms 4692 KB Output is correct
43 Correct 6 ms 4564 KB Output is correct
44 Correct 5 ms 4660 KB Output is correct
45 Correct 5 ms 4564 KB Output is correct
46 Correct 5 ms 4692 KB Output is correct
47 Correct 5 ms 4692 KB Output is correct
48 Correct 5 ms 4692 KB Output is correct
49 Correct 6 ms 4692 KB Output is correct
50 Correct 6 ms 4664 KB Output is correct
51 Correct 5 ms 4672 KB Output is correct
52 Correct 6 ms 4692 KB Output is correct
53 Correct 5 ms 4692 KB Output is correct
54 Correct 6 ms 4692 KB Output is correct
55 Correct 6 ms 4672 KB Output is correct
56 Correct 7 ms 4692 KB Output is correct
57 Correct 7 ms 4692 KB Output is correct
58 Correct 5 ms 4692 KB Output is correct
59 Correct 5 ms 4660 KB Output is correct
60 Correct 6 ms 4692 KB Output is correct
61 Correct 6 ms 4656 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 11624 KB Output is correct
2 Correct 135 ms 11480 KB Output is correct
3 Correct 160 ms 11372 KB Output is correct
4 Correct 131 ms 11468 KB Output is correct
5 Correct 136 ms 11404 KB Output is correct
6 Correct 128 ms 11344 KB Output is correct
7 Correct 114 ms 13256 KB Output is correct
8 Correct 146 ms 11480 KB Output is correct
9 Correct 110 ms 12856 KB Output is correct
10 Correct 118 ms 11368 KB Output is correct
11 Correct 125 ms 11400 KB Output is correct
12 Correct 127 ms 11596 KB Output is correct
13 Correct 116 ms 11412 KB Output is correct
14 Correct 151 ms 11352 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 11668 KB Output is correct
2 Correct 149 ms 11628 KB Output is correct
3 Correct 173 ms 11460 KB Output is correct
4 Correct 147 ms 11460 KB Output is correct
5 Correct 148 ms 11372 KB Output is correct
6 Correct 149 ms 11452 KB Output is correct
7 Correct 123 ms 11444 KB Output is correct
8 Correct 123 ms 11428 KB Output is correct
9 Correct 126 ms 11372 KB Output is correct
10 Correct 142 ms 11424 KB Output is correct
11 Correct 145 ms 11456 KB Output is correct
12 Correct 147 ms 11440 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 2 ms 4412 KB Output is correct
5 Correct 4 ms 4436 KB Output is correct
6 Correct 2 ms 4436 KB Output is correct
7 Correct 2 ms 4436 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 4 ms 4436 KB Output is correct
10 Correct 3 ms 4436 KB Output is correct
11 Correct 2 ms 4436 KB Output is correct
12 Correct 2 ms 4436 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 3 ms 4436 KB Output is correct
16 Correct 3 ms 4436 KB Output is correct
17 Correct 3 ms 4436 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 2 ms 4436 KB Output is correct
21 Correct 2 ms 4436 KB Output is correct
22 Correct 2 ms 4436 KB Output is correct
23 Correct 2 ms 4436 KB Output is correct
24 Correct 3 ms 4436 KB Output is correct
25 Correct 2 ms 4436 KB Output is correct
26 Correct 2 ms 4404 KB Output is correct
27 Correct 2 ms 4436 KB Output is correct
28 Correct 3 ms 4436 KB Output is correct
29 Correct 3 ms 4436 KB Output is correct
30 Correct 2 ms 4436 KB Output is correct
31 Correct 2 ms 4436 KB Output is correct
32 Correct 3 ms 4404 KB Output is correct
33 Correct 3 ms 4436 KB Output is correct
34 Correct 3 ms 4436 KB Output is correct
35 Correct 3 ms 4436 KB Output is correct
36 Correct 3 ms 4436 KB Output is correct
37 Correct 3 ms 4436 KB Output is correct
38 Correct 3 ms 4436 KB Output is correct
39 Correct 3 ms 4436 KB Output is correct
40 Correct 3 ms 4436 KB Output is correct
41 Correct 5 ms 4692 KB Output is correct
42 Correct 6 ms 4692 KB Output is correct
43 Correct 6 ms 4564 KB Output is correct
44 Correct 5 ms 4660 KB Output is correct
45 Correct 5 ms 4564 KB Output is correct
46 Correct 5 ms 4692 KB Output is correct
47 Correct 5 ms 4692 KB Output is correct
48 Correct 5 ms 4692 KB Output is correct
49 Correct 6 ms 4692 KB Output is correct
50 Correct 6 ms 4664 KB Output is correct
51 Correct 5 ms 4672 KB Output is correct
52 Correct 6 ms 4692 KB Output is correct
53 Correct 5 ms 4692 KB Output is correct
54 Correct 6 ms 4692 KB Output is correct
55 Correct 6 ms 4672 KB Output is correct
56 Correct 7 ms 4692 KB Output is correct
57 Correct 7 ms 4692 KB Output is correct
58 Correct 5 ms 4692 KB Output is correct
59 Correct 5 ms 4660 KB Output is correct
60 Correct 6 ms 4692 KB Output is correct
61 Correct 6 ms 4656 KB Output is correct
62 Correct 137 ms 11624 KB Output is correct
63 Correct 135 ms 11480 KB Output is correct
64 Correct 160 ms 11372 KB Output is correct
65 Correct 131 ms 11468 KB Output is correct
66 Correct 136 ms 11404 KB Output is correct
67 Correct 128 ms 11344 KB Output is correct
68 Correct 114 ms 13256 KB Output is correct
69 Correct 146 ms 11480 KB Output is correct
70 Correct 110 ms 12856 KB Output is correct
71 Correct 118 ms 11368 KB Output is correct
72 Correct 125 ms 11400 KB Output is correct
73 Correct 127 ms 11596 KB Output is correct
74 Correct 116 ms 11412 KB Output is correct
75 Correct 151 ms 11352 KB Output is correct
76 Correct 130 ms 11668 KB Output is correct
77 Correct 149 ms 11628 KB Output is correct
78 Correct 173 ms 11460 KB Output is correct
79 Correct 147 ms 11460 KB Output is correct
80 Correct 148 ms 11372 KB Output is correct
81 Correct 149 ms 11452 KB Output is correct
82 Correct 123 ms 11444 KB Output is correct
83 Correct 123 ms 11428 KB Output is correct
84 Correct 126 ms 11372 KB Output is correct
85 Correct 142 ms 11424 KB Output is correct
86 Correct 145 ms 11456 KB Output is correct
87 Correct 147 ms 11440 KB Output is correct
88 Correct 142 ms 14280 KB Output is correct
89 Correct 144 ms 14320 KB Output is correct
90 Correct 156 ms 14320 KB Output is correct
91 Correct 155 ms 14328 KB Output is correct
92 Correct 160 ms 14280 KB Output is correct
93 Correct 181 ms 14364 KB Output is correct
94 Correct 156 ms 14284 KB Output is correct
95 Correct 160 ms 14340 KB Output is correct
96 Correct 152 ms 14628 KB Output is correct
97 Correct 163 ms 14408 KB Output is correct
98 Correct 154 ms 14284 KB Output is correct
99 Correct 165 ms 14372 KB Output is correct
100 Correct 173 ms 14268 KB Output is correct
101 Correct 117 ms 15348 KB Output is correct
102 Correct 135 ms 14660 KB Output is correct
103 Correct 149 ms 14376 KB Output is correct
104 Correct 165 ms 14296 KB Output is correct
105 Correct 168 ms 14284 KB Output is correct
106 Correct 141 ms 14356 KB Output is correct
107 Correct 154 ms 14280 KB Output is correct
108 Correct 182 ms 14284 KB Output is correct
109 Correct 125 ms 14412 KB Output is correct
110 Correct 150 ms 14276 KB Output is correct
111 Correct 151 ms 14252 KB Output is correct
112 Correct 170 ms 14420 KB Output is correct
113 Correct 165 ms 14368 KB Output is correct
114 Correct 165 ms 14336 KB Output is correct
115 Correct 123 ms 14292 KB Output is correct
116 Correct 127 ms 14348 KB Output is correct
117 Correct 153 ms 14284 KB Output is correct
118 Correct 152 ms 14256 KB Output is correct
119 Correct 149 ms 14260 KB Output is correct
120 Correct 153 ms 14276 KB Output is correct