oj.uz

Submission #536400

# Submission time Handle Problem Language Result Execution time Memory
536400 2022-03-13T07:41:00 Z Arnch Financial Report (JOI21_financial) C++17
100 / 100
 663 ms 25752 KB 
// oooo
/*
 har chi delet mikhad bebar ~
 gitar o ba khodet nabar! ~
 ;Amoo_Hasan;
*/

#include<bits/stdc++.h>
#pragma GCC optimize("O3,no-stack-protector,unroll-loops")
#pragma GCC target("avx2,fma")

using namespace std;

typedef long long ll;
typedef long double ld;

#define Sz(x) int((x).size())
#define All(x) (x).begin(), (x).end()
#define wtf(x) cout<<#x <<" : " <<x

constexpr ll inf = 1e18, N = 1e6 + 10, mod = 1e9 + 7, pr = 1000696969;

int n, d, a[N], l[N], r[N], dp[N];
set<int> bad, to;
vector<pair<int, int> > vc;

bool cmp(pair<int, int> p1, pair<int, int> p2) {
	if(p1.first != p2.first) return p1.first < p2.first;
	return p1.second > p2.second;
}

struct node {
	int val;
} x[N << 2];
void change(int l, int r, int ind, int val, int v) {
	if(r - l < 2) {
		x[v].val = val;
		return;
	}
	int mid = (l + r) >> 1;
	if(ind < mid) change(l, mid, ind, val, 2 * v);
	else change(mid, r, ind, val, 2 * v + 1);
	x[v].val = max(x[2 * v].val, x[2 * v + 1].val);
}	
int get(int l, int r, int s, int e, int v) {
	if(r <= s || l >= e) return 0;
	if(l >= s && r <= e) return x[v].val;
	int mid = (l + r) >> 1;
	return max(get(l, mid, s, e, 2 * v), get(mid, r, s, e, 2 * v + 1));
}

int main() {
    ios :: sync_with_stdio(0), cin.tie(0);
	
	cin >>n >>d;
	for(int i = 0; i < n; i++) cin >>a[i], vc.push_back({a[i], i});
	sort(All(vc), cmp);
	
	for(int i = 0; i < n; i++) l[i] = -1, r[i] = n;

	for(auto i : vc) {
		int ind = i.second;
		auto it = to.lower_bound(ind);
		if(it != to.end()) {
			l[*it] = ind, r[ind] = *it;
			if(*it - ind <= d) {
				bad.erase(*it);
			}
		}
		if(it != to.begin()) {
			it--;
			l[ind] = *it, r[*it] = ind;
		}
		to.insert(ind);
		if(ind - l[ind] > d) bad.insert(ind);
		dp[ind] = 1;
		if(ind != 0) {
			auto pos = bad.upper_bound(ind);
			if(pos == bad.begin()) {
				dp[ind] += get(0, n, 0, ind, 1);
			}
			else {
				pos--;
				int j = *pos;
				if(j != ind) 
					dp[ind] += get(0, n, j, ind, 1);
			}
		}
		change(0, n, ind, dp[ind], 1);
	}
	
	int ans = 0;
	for(int i = 0; i < n; i++) ans = max(ans, dp[i]);

	cout<<ans;

    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 25472 KB Output is correct
2 Correct 256 ms 25504 KB Output is correct
3 Correct 469 ms 25560 KB Output is correct
4 Correct 603 ms 25584 KB Output is correct
5 Correct 423 ms 25492 KB Output is correct
6 Correct 663 ms 25652 KB Output is correct
7 Correct 209 ms 25528 KB Output is correct
8 Correct 204 ms 25496 KB Output is correct
9 Correct 176 ms 25520 KB Output is correct
10 Correct 206 ms 25524 KB Output is correct
11 Correct 348 ms 25516 KB Output is correct
12 Correct 380 ms 25556 KB Output is correct
13 Correct 382 ms 25500 KB Output is correct
14 Correct 575 ms 25500 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 25536 KB Output is correct
2 Correct 394 ms 25492 KB Output is correct
3 Correct 405 ms 25572 KB Output is correct
4 Correct 473 ms 25656 KB Output is correct
5 Correct 372 ms 25572 KB Output is correct
6 Correct 424 ms 25484 KB Output is correct
7 Correct 213 ms 25572 KB Output is correct
8 Correct 216 ms 25632 KB Output is correct
9 Correct 196 ms 25432 KB Output is correct
10 Correct 261 ms 25444 KB Output is correct
11 Correct 537 ms 25540 KB Output is correct
12 Correct 350 ms 25480 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 7 ms 852 KB Output is correct
42 Correct 6 ms 852 KB Output is correct
43 Correct 5 ms 852 KB Output is correct
44 Correct 5 ms 852 KB Output is correct
45 Correct 6 ms 888 KB Output is correct
46 Correct 5 ms 916 KB Output is correct
47 Correct 5 ms 852 KB Output is correct
48 Correct 5 ms 852 KB Output is correct
49 Correct 6 ms 852 KB Output is correct
50 Correct 6 ms 852 KB Output is correct
51 Correct 6 ms 852 KB Output is correct
52 Correct 9 ms 888 KB Output is correct
53 Correct 6 ms 852 KB Output is correct
54 Correct 5 ms 852 KB Output is correct
55 Correct 6 ms 844 KB Output is correct
56 Correct 7 ms 852 KB Output is correct
57 Correct 5 ms 852 KB Output is correct
58 Correct 4 ms 852 KB Output is correct
59 Correct 4 ms 852 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 4 ms 852 KB Output is correct
62 Correct 205 ms 25472 KB Output is correct
63 Correct 256 ms 25504 KB Output is correct
64 Correct 469 ms 25560 KB Output is correct
65 Correct 603 ms 25584 KB Output is correct
66 Correct 423 ms 25492 KB Output is correct
67 Correct 663 ms 25652 KB Output is correct
68 Correct 209 ms 25528 KB Output is correct
69 Correct 204 ms 25496 KB Output is correct
70 Correct 176 ms 25520 KB Output is correct
71 Correct 206 ms 25524 KB Output is correct
72 Correct 348 ms 25516 KB Output is correct
73 Correct 380 ms 25556 KB Output is correct
74 Correct 382 ms 25500 KB Output is correct
75 Correct 575 ms 25500 KB Output is correct
76 Correct 225 ms 25536 KB Output is correct
77 Correct 394 ms 25492 KB Output is correct
78 Correct 405 ms 25572 KB Output is correct
79 Correct 473 ms 25656 KB Output is correct
80 Correct 372 ms 25572 KB Output is correct
81 Correct 424 ms 25484 KB Output is correct
82 Correct 213 ms 25572 KB Output is correct
83 Correct 216 ms 25632 KB Output is correct
84 Correct 196 ms 25432 KB Output is correct
85 Correct 261 ms 25444 KB Output is correct
86 Correct 537 ms 25540 KB Output is correct
87 Correct 350 ms 25480 KB Output is correct
88 Correct 601 ms 25588 KB Output is correct
89 Correct 657 ms 25592 KB Output is correct
90 Correct 567 ms 25552 KB Output is correct
91 Correct 515 ms 25500 KB Output is correct
92 Correct 309 ms 25524 KB Output is correct
93 Correct 507 ms 25504 KB Output is correct
94 Correct 489 ms 25616 KB Output is correct
95 Correct 504 ms 25528 KB Output is correct
96 Correct 505 ms 25528 KB Output is correct
97 Correct 474 ms 25540 KB Output is correct
98 Correct 495 ms 25504 KB Output is correct
99 Correct 469 ms 25476 KB Output is correct
100 Correct 421 ms 25476 KB Output is correct
101 Correct 205 ms 25604 KB Output is correct
102 Correct 203 ms 25564 KB Output is correct
103 Correct 205 ms 25528 KB Output is correct
104 Correct 229 ms 25504 KB Output is correct
105 Correct 332 ms 25544 KB Output is correct
106 Correct 244 ms 25544 KB Output is correct
107 Correct 305 ms 25540 KB Output is correct
108 Correct 435 ms 25528 KB Output is correct
109 Correct 353 ms 25568 KB Output is correct
110 Correct 435 ms 25480 KB Output is correct
111 Correct 498 ms 25752 KB Output is correct
112 Correct 267 ms 25472 KB Output is correct
113 Correct 495 ms 25480 KB Output is correct
114 Correct 458 ms 25516 KB Output is correct
115 Correct 239 ms 25536 KB Output is correct
116 Correct 206 ms 25572 KB Output is correct
117 Correct 259 ms 25568 KB Output is correct
118 Correct 289 ms 25568 KB Output is correct
119 Correct 235 ms 25476 KB Output is correct
120 Correct 254 ms 25512 KB Output is correct