oj.uz

Submission #683211

# Submission time Handle Problem Language Result Execution time Memory
683211 2023-01-17T23:21:22 Z NK_ Financial Report (JOI21_financial) C++17
100 / 100
 968 ms 32856 KB 
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'

const int INF = 1e9+10;
struct Seg {
	const int ID = INF; int comb(int a, int b) { return min(a, b); }
	vector<int> seg, lazy; int n;
	void init(int N) {
		n = 1; while(n < N) n *= 2;
		seg.assign(2*n, ID);
		lazy.assign(2*n, ID);
	}

	void pull(int p) { seg[p] = comb(seg[2*p], seg[2*p+1]); }

	void push(int x, int L, int R) {
		if (lazy[x] == ID) return;
		// cout << "LAZY: " << lazy[x] << " " << x << " " << L << " " << R << nl;
		seg[x] = lazy[x];
		// cout << seg[x] << nl;
		if (L != R) for(int i = 0; i < 2; i++) lazy[2*x+i] = lazy[x];
		lazy[x] = ID;
	}

	void upd(int l, int r, int v, int x, int L, int R) {
		push(x, L, R); if (r < L || R < l) return;
		if (l <= L && R <= r) {
			lazy[x] = v;
			push(x, L, R);
			return;
		}
		int M = (L+R)/2;
		upd(l, r, v, 2*x, L, M);
		upd(l, r, v, 2*x+1, M+1, R);
		pull(x);
	}

	int query(int l, int r, int x, int L, int R) {
		push(x, L, R); if (r < L || R < l) return ID;
		if (l <= L && R <= r) return seg[x];
		int M = (L+R)/2;
		return comb(query(l, r, 2*x, L, M), query(l, r, 2*x+1, M+1, R));
	}
	

	int get() { return seg[1]; };
	void upd(int l, int r, int v) { upd(l, r, v, 1, 0, n-1); }
	// void set(int p, int v) { set(p, v, 1, 0, n-1); }
	int query(int l, int r) { return query(l, r, 1, 0, n-1); }
};

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N, K; cin >> N >> K;

	vector<int> A(N); for(auto &x : A) cin >> x;


	int M = -1;
	{	
		map<int, int> mp; int cur = 0;
		for(auto x : A) mp[x]++;
		for(auto &p : mp) p.second = cur++;
		for(auto &x : A) x = mp[x];
		M = cur;
	}


	Seg st; st.init(N);
	for(int i = 0; i < N; i++) st.upd(i, i, A[i]);

	Seg dp; dp.init(M); dp.upd(0, M-1, 0);

	for(int i = 0; i < N; i++) {
		int best = max(0, -dp.query(0, A[i]-1)) + 1;
		best = max(best, -dp.query(A[i], A[i]));
		dp.upd(A[i], A[i], -best);


		int mn = st.query(max(0, i-K+1), i);
		dp.upd(0, mn-1, 0);
	}

	cout << -dp.query(A.back(), M-1) << nl;


    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 212 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 320 KB Output is correct
30 Correct 2 ms 320 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 2 ms 324 KB Output is correct
33 Correct 2 ms 320 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 320 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 328 KB Output is correct
39 Correct 1 ms 316 KB Output is correct
40 Correct 3 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 212 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 320 KB Output is correct
30 Correct 2 ms 320 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 2 ms 324 KB Output is correct
33 Correct 2 ms 320 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 320 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 328 KB Output is correct
39 Correct 1 ms 316 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 9 ms 588 KB Output is correct
42 Correct 11 ms 872 KB Output is correct
43 Correct 5 ms 468 KB Output is correct
44 Correct 8 ms 620 KB Output is correct
45 Correct 13 ms 628 KB Output is correct
46 Correct 14 ms 748 KB Output is correct
47 Correct 14 ms 780 KB Output is correct
48 Correct 12 ms 724 KB Output is correct
49 Correct 11 ms 768 KB Output is correct
50 Correct 10 ms 760 KB Output is correct
51 Correct 10 ms 724 KB Output is correct
52 Correct 11 ms 748 KB Output is correct
53 Correct 9 ms 724 KB Output is correct
54 Correct 10 ms 728 KB Output is correct
55 Correct 11 ms 736 KB Output is correct
56 Correct 11 ms 868 KB Output is correct
57 Correct 12 ms 768 KB Output is correct
58 Correct 8 ms 724 KB Output is correct
59 Correct 10 ms 724 KB Output is correct
60 Correct 13 ms 724 KB Output is correct
61 Correct 13 ms 728 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 10592 KB Output is correct
2 Correct 232 ms 10616 KB Output is correct
3 Correct 300 ms 10616 KB Output is correct
4 Correct 851 ms 20588 KB Output is correct
5 Correct 752 ms 24700 KB Output is correct
6 Correct 843 ms 28916 KB Output is correct
7 Correct 469 ms 20500 KB Output is correct
8 Correct 489 ms 20440 KB Output is correct
9 Correct 536 ms 20592 KB Output is correct
10 Correct 447 ms 20596 KB Output is correct
11 Correct 680 ms 20580 KB Output is correct
12 Correct 684 ms 20592 KB Output is correct
13 Correct 700 ms 28812 KB Output is correct
14 Correct 798 ms 28816 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 10616 KB Output is correct
2 Correct 235 ms 10612 KB Output is correct
3 Correct 344 ms 10700 KB Output is correct
4 Correct 754 ms 28820 KB Output is correct
5 Correct 637 ms 24736 KB Output is correct
6 Correct 762 ms 32856 KB Output is correct
7 Correct 419 ms 20712 KB Output is correct
8 Correct 478 ms 20600 KB Output is correct
9 Correct 404 ms 20516 KB Output is correct
10 Correct 520 ms 20532 KB Output is correct
11 Correct 690 ms 28768 KB Output is correct
12 Correct 631 ms 28808 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 212 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 320 KB Output is correct
30 Correct 2 ms 320 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 2 ms 324 KB Output is correct
33 Correct 2 ms 320 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 320 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 328 KB Output is correct
39 Correct 1 ms 316 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 9 ms 588 KB Output is correct
42 Correct 11 ms 872 KB Output is correct
43 Correct 5 ms 468 KB Output is correct
44 Correct 8 ms 620 KB Output is correct
45 Correct 13 ms 628 KB Output is correct
46 Correct 14 ms 748 KB Output is correct
47 Correct 14 ms 780 KB Output is correct
48 Correct 12 ms 724 KB Output is correct
49 Correct 11 ms 768 KB Output is correct
50 Correct 10 ms 760 KB Output is correct
51 Correct 10 ms 724 KB Output is correct
52 Correct 11 ms 748 KB Output is correct
53 Correct 9 ms 724 KB Output is correct
54 Correct 10 ms 728 KB Output is correct
55 Correct 11 ms 736 KB Output is correct
56 Correct 11 ms 868 KB Output is correct
57 Correct 12 ms 768 KB Output is correct
58 Correct 8 ms 724 KB Output is correct
59 Correct 10 ms 724 KB Output is correct
60 Correct 13 ms 724 KB Output is correct
61 Correct 13 ms 728 KB Output is correct
62 Correct 153 ms 10592 KB Output is correct
63 Correct 232 ms 10616 KB Output is correct
64 Correct 300 ms 10616 KB Output is correct
65 Correct 851 ms 20588 KB Output is correct
66 Correct 752 ms 24700 KB Output is correct
67 Correct 843 ms 28916 KB Output is correct
68 Correct 469 ms 20500 KB Output is correct
69 Correct 489 ms 20440 KB Output is correct
70 Correct 536 ms 20592 KB Output is correct
71 Correct 447 ms 20596 KB Output is correct
72 Correct 680 ms 20580 KB Output is correct
73 Correct 684 ms 20592 KB Output is correct
74 Correct 700 ms 28812 KB Output is correct
75 Correct 798 ms 28816 KB Output is correct
76 Correct 162 ms 10616 KB Output is correct
77 Correct 235 ms 10612 KB Output is correct
78 Correct 344 ms 10700 KB Output is correct
79 Correct 754 ms 28820 KB Output is correct
80 Correct 637 ms 24736 KB Output is correct
81 Correct 762 ms 32856 KB Output is correct
82 Correct 419 ms 20712 KB Output is correct
83 Correct 478 ms 20600 KB Output is correct
84 Correct 404 ms 20516 KB Output is correct
85 Correct 520 ms 20532 KB Output is correct
86 Correct 690 ms 28768 KB Output is correct
87 Correct 631 ms 28808 KB Output is correct
88 Correct 425 ms 10696 KB Output is correct
89 Correct 968 ms 28428 KB Output is correct
90 Correct 630 ms 13392 KB Output is correct
91 Correct 914 ms 32532 KB Output is correct
92 Correct 257 ms 10268 KB Output is correct
93 Correct 380 ms 10548 KB Output is correct
94 Correct 689 ms 20152 KB Output is correct
95 Correct 795 ms 28460 KB Output is correct
96 Correct 834 ms 28452 KB Output is correct
97 Correct 862 ms 32516 KB Output is correct
98 Correct 836 ms 28456 KB Output is correct
99 Correct 842 ms 28436 KB Output is correct
100 Correct 895 ms 28452 KB Output is correct
101 Correct 490 ms 20252 KB Output is correct
102 Correct 612 ms 20240 KB Output is correct
103 Correct 538 ms 20240 KB Output is correct
104 Correct 643 ms 20244 KB Output is correct
105 Correct 702 ms 20356 KB Output is correct
106 Correct 570 ms 20240 KB Output is correct
107 Correct 657 ms 20240 KB Output is correct
108 Correct 964 ms 24348 KB Output is correct
109 Correct 628 ms 32436 KB Output is correct
110 Correct 819 ms 32568 KB Output is correct
111 Correct 867 ms 28460 KB Output is correct
112 Correct 647 ms 28456 KB Output is correct
113 Correct 768 ms 32540 KB Output is correct
114 Correct 817 ms 32564 KB Output is correct
115 Correct 425 ms 20248 KB Output is correct
116 Correct 434 ms 20224 KB Output is correct
117 Correct 479 ms 24352 KB Output is correct
118 Correct 510 ms 24352 KB Output is correct
119 Correct 520 ms 20296 KB Output is correct
120 Correct 588 ms 20296 KB Output is correct