oj.uz

Submission #420303

# Submission time Handle Problem Language Result Execution time Memory
420303 2021-06-08T09:25:41 Z IOrtroiii Financial Report (JOI21_financial) C++14
100 / 100
 1268 ms 38976 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr);
 
	int N, D; cin >> N >> D;
	vector<int> A(N); for (int &a : A) cin >> a;
	
	vector<int> ord(N); iota(ord.begin(), ord.end(), 0);
	sort(ord.begin(), ord.end(), [&](const int &i, const int &j) { 
		return make_pair(A[i], -i) < make_pair(A[j], -j); 
	});
	vector<int> loc(N);
	for (int i = 0; i < N; ++i) loc[ord[i]] = i;
 
	struct Node {
		int best = 0;
		int pref = 0;
		int suff = 0;
		bool all = false;
	};
 
	auto merge = [&](Node l, Node r) {
		Node ans;
		ans.all = l.all & r.all;
		ans.best = max({l.best, r.best, l.suff + r.pref});
		ans.pref = l.all ? l.pref + r.pref : l.pref;
		ans.suff = r.all ? r.suff + l.suff : r.suff;
		return ans;
	};
 
	vector<Node> tree0(2 * N);
	auto modify0 = [&](int p) {
		tree0[p += N] = {1, 1, 1, true};
		p /= 2;
		while (p > 0) {
			tree0[p] = merge(tree0[2 * p], tree0[2 * p + 1]);
			p /= 2;
		}	
	};
 
	auto query0 = [&](int l, int r) {
		Node ansl{};
		Node ansr{};
		for (l += N, r += N; l <= r; l /= 2, r /= 2) {
			if (l % 2) ansl = merge(ansl, tree0[l++]);
			if (r % 2 == 0) ansr = merge(tree0[r--], ansr);
		}
		return merge(ansl, ansr).best;
	};
 
	vector<vector<int>> evts(N);
	reverse(ord.begin(), ord.end());
	vector<vector<int>> prvs(N); 
	for (int i : ord) {
		int lo = i, hi = N - 1;
		while (lo < hi) {
			int mi = (lo + hi) / 2;
			if (query0(i, mi) >= D) hi = mi;
			else lo = mi + 1;
		}
		evts[lo].push_back(i);
		modify0(i);
	}
 	
	vector<int> tree1(2 * N);
	auto modify1 = [&](int p, int v) {
		tree1[p += N] = v;
		p /= 2;
		while (p > 0) {
			tree1[p] = max(tree1[2 * p], tree1[2 * p + 1]);
			p /= 2;
		}
	};
	auto query1 = [&](int l, int r) {
		int ans = 0;
		for (l += N, r += N; l <= r; l /= 2, r /= 2) {
			if (l % 2) ans = max(ans, tree1[l++]);
			if (r % 2 == 0) ans = max(ans, tree1[r--]);
		}
		return ans;
	};
 
	int ans = 0;
	for (int i = 0; i < N; ++i) {
		int dp = query1(0, loc[i]) + 1;
		ans = max(ans, dp);
		modify1(loc[i], dp);
		for (int j : evts[i]) {
			modify1(loc[j], 0);
		}
	}
	cout << ans << '\n';
	return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 2 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 11 ms 1100 KB Output is correct
42 Correct 11 ms 972 KB Output is correct
43 Correct 11 ms 972 KB Output is correct
44 Correct 11 ms 912 KB Output is correct
45 Correct 13 ms 972 KB Output is correct
46 Correct 14 ms 1024 KB Output is correct
47 Correct 11 ms 1096 KB Output is correct
48 Correct 14 ms 960 KB Output is correct
49 Correct 16 ms 972 KB Output is correct
50 Correct 14 ms 992 KB Output is correct
51 Correct 10 ms 1056 KB Output is correct
52 Correct 11 ms 988 KB Output is correct
53 Correct 9 ms 1100 KB Output is correct
54 Correct 12 ms 972 KB Output is correct
55 Correct 14 ms 1016 KB Output is correct
56 Correct 14 ms 972 KB Output is correct
57 Correct 14 ms 972 KB Output is correct
58 Correct 13 ms 980 KB Output is correct
59 Correct 13 ms 1008 KB Output is correct
60 Correct 12 ms 960 KB Output is correct
61 Correct 12 ms 972 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 702 ms 30940 KB Output is correct
2 Correct 710 ms 33988 KB Output is correct
3 Correct 973 ms 34488 KB Output is correct
4 Correct 1046 ms 34636 KB Output is correct
5 Correct 877 ms 35696 KB Output is correct
6 Correct 1002 ms 34472 KB Output is correct
7 Correct 529 ms 38740 KB Output is correct
8 Correct 737 ms 30776 KB Output is correct
9 Correct 559 ms 36528 KB Output is correct
10 Correct 663 ms 33608 KB Output is correct
11 Correct 835 ms 34592 KB Output is correct
12 Correct 801 ms 34516 KB Output is correct
13 Correct 949 ms 38976 KB Output is correct
14 Correct 1103 ms 31328 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 711 ms 30984 KB Output is correct
2 Correct 1006 ms 30936 KB Output is correct
3 Correct 1122 ms 31092 KB Output is correct
4 Correct 1185 ms 30848 KB Output is correct
5 Correct 1039 ms 30900 KB Output is correct
6 Correct 1145 ms 30904 KB Output is correct
7 Correct 732 ms 30988 KB Output is correct
8 Correct 700 ms 30936 KB Output is correct
9 Correct 784 ms 30788 KB Output is correct
10 Correct 963 ms 30868 KB Output is correct
11 Correct 1164 ms 31040 KB Output is correct
12 Correct 1043 ms 31000 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 2 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 11 ms 1100 KB Output is correct
42 Correct 11 ms 972 KB Output is correct
43 Correct 11 ms 972 KB Output is correct
44 Correct 11 ms 912 KB Output is correct
45 Correct 13 ms 972 KB Output is correct
46 Correct 14 ms 1024 KB Output is correct
47 Correct 11 ms 1096 KB Output is correct
48 Correct 14 ms 960 KB Output is correct
49 Correct 16 ms 972 KB Output is correct
50 Correct 14 ms 992 KB Output is correct
51 Correct 10 ms 1056 KB Output is correct
52 Correct 11 ms 988 KB Output is correct
53 Correct 9 ms 1100 KB Output is correct
54 Correct 12 ms 972 KB Output is correct
55 Correct 14 ms 1016 KB Output is correct
56 Correct 14 ms 972 KB Output is correct
57 Correct 14 ms 972 KB Output is correct
58 Correct 13 ms 980 KB Output is correct
59 Correct 13 ms 1008 KB Output is correct
60 Correct 12 ms 960 KB Output is correct
61 Correct 12 ms 972 KB Output is correct
62 Correct 702 ms 30940 KB Output is correct
63 Correct 710 ms 33988 KB Output is correct
64 Correct 973 ms 34488 KB Output is correct
65 Correct 1046 ms 34636 KB Output is correct
66 Correct 877 ms 35696 KB Output is correct
67 Correct 1002 ms 34472 KB Output is correct
68 Correct 529 ms 38740 KB Output is correct
69 Correct 737 ms 30776 KB Output is correct
70 Correct 559 ms 36528 KB Output is correct
71 Correct 663 ms 33608 KB Output is correct
72 Correct 835 ms 34592 KB Output is correct
73 Correct 801 ms 34516 KB Output is correct
74 Correct 949 ms 38976 KB Output is correct
75 Correct 1103 ms 31328 KB Output is correct
76 Correct 711 ms 30984 KB Output is correct
77 Correct 1006 ms 30936 KB Output is correct
78 Correct 1122 ms 31092 KB Output is correct
79 Correct 1185 ms 30848 KB Output is correct
80 Correct 1039 ms 30900 KB Output is correct
81 Correct 1145 ms 30904 KB Output is correct
82 Correct 732 ms 30988 KB Output is correct
83 Correct 700 ms 30936 KB Output is correct
84 Correct 784 ms 30788 KB Output is correct
85 Correct 963 ms 30868 KB Output is correct
86 Correct 1164 ms 31040 KB Output is correct
87 Correct 1043 ms 31000 KB Output is correct
88 Correct 1014 ms 33312 KB Output is correct
89 Correct 1114 ms 32836 KB Output is correct
90 Correct 1190 ms 31864 KB Output is correct
91 Correct 1161 ms 30980 KB Output is correct
92 Correct 1010 ms 31156 KB Output is correct
93 Correct 1102 ms 31096 KB Output is correct
94 Correct 1131 ms 30868 KB Output is correct
95 Correct 941 ms 34016 KB Output is correct
96 Correct 1121 ms 32168 KB Output is correct
97 Correct 1137 ms 31172 KB Output is correct
98 Correct 1105 ms 30884 KB Output is correct
99 Correct 1160 ms 31244 KB Output is correct
100 Correct 1111 ms 31132 KB Output is correct
101 Correct 597 ms 34312 KB Output is correct
102 Correct 697 ms 31752 KB Output is correct
103 Correct 874 ms 31372 KB Output is correct
104 Correct 959 ms 31472 KB Output is correct
105 Correct 1083 ms 31072 KB Output is correct
106 Correct 883 ms 30936 KB Output is correct
107 Correct 1049 ms 30908 KB Output is correct
108 Correct 1100 ms 31024 KB Output is correct
109 Correct 941 ms 38968 KB Output is correct
110 Correct 1268 ms 32144 KB Output is correct
111 Correct 1187 ms 31112 KB Output is correct
112 Correct 1075 ms 32196 KB Output is correct
113 Correct 1200 ms 30908 KB Output is correct
114 Correct 1161 ms 31080 KB Output is correct
115 Correct 693 ms 31020 KB Output is correct
116 Correct 693 ms 31060 KB Output is correct
117 Correct 797 ms 31100 KB Output is correct
118 Correct 757 ms 31048 KB Output is correct
119 Correct 1068 ms 30912 KB Output is correct
120 Correct 1044 ms 30960 KB Output is correct