oj.uz

Submission #420302

# Submission time Handle Problem Language Result Execution time Memory
420302 2021-06-08T09:23:14 Z IOrtroiii Financial Report (JOI21_financial) C++17
100 / 100
 1179 ms 47856 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); 
	});
	int S = 1;
	while (S < N) S *= 2;
	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 * S);
	auto modify0 = [&](int p) {
		tree0[p += S] = {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 += S, r += S; 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 * S);
	auto modify1 = [&](int p, int v) {
		tree1[p += S] = 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 += S, r += S; 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 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 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 1 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 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 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 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 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 1 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 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 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 268 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 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 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 1 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 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 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 268 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 12 ms 1112 KB Output is correct
43 Correct 11 ms 1008 KB Output is correct
44 Correct 11 ms 976 KB Output is correct
45 Correct 13 ms 1028 KB Output is correct
46 Correct 13 ms 1068 KB Output is correct
47 Correct 11 ms 1100 KB Output is correct
48 Correct 12 ms 1004 KB Output is correct
49 Correct 15 ms 1144 KB Output is correct
50 Correct 14 ms 1100 KB Output is correct
51 Correct 10 ms 1112 KB Output is correct
52 Correct 11 ms 1100 KB Output is correct
53 Correct 9 ms 1088 KB Output is correct
54 Correct 12 ms 1116 KB Output is correct
55 Correct 14 ms 1100 KB Output is correct
56 Correct 14 ms 1100 KB Output is correct
57 Correct 14 ms 1120 KB Output is correct
58 Correct 11 ms 1100 KB Output is correct
59 Correct 11 ms 1100 KB Output is correct
60 Correct 12 ms 1036 KB Output is correct
61 Correct 12 ms 1100 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 709 ms 39888 KB Output is correct
2 Correct 731 ms 42952 KB Output is correct
3 Correct 932 ms 43380 KB Output is correct
4 Correct 1006 ms 43428 KB Output is correct
5 Correct 854 ms 44508 KB Output is correct
6 Correct 1016 ms 43544 KB Output is correct
7 Correct 544 ms 47584 KB Output is correct
8 Correct 708 ms 39648 KB Output is correct
9 Correct 572 ms 45156 KB Output is correct
10 Correct 700 ms 42560 KB Output is correct
11 Correct 802 ms 43356 KB Output is correct
12 Correct 807 ms 43332 KB Output is correct
13 Correct 915 ms 47856 KB Output is correct
14 Correct 1004 ms 40256 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 720 ms 39668 KB Output is correct
2 Correct 994 ms 39888 KB Output is correct
3 Correct 1092 ms 39716 KB Output is correct
4 Correct 1135 ms 39924 KB Output is correct
5 Correct 1014 ms 39932 KB Output is correct
6 Correct 1109 ms 39796 KB Output is correct
7 Correct 733 ms 39848 KB Output is correct
8 Correct 707 ms 39696 KB Output is correct
9 Correct 796 ms 39860 KB Output is correct
10 Correct 966 ms 39940 KB Output is correct
11 Correct 1152 ms 40064 KB Output is correct
12 Correct 1038 ms 39764 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 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 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 1 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 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 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 268 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 12 ms 1112 KB Output is correct
43 Correct 11 ms 1008 KB Output is correct
44 Correct 11 ms 976 KB Output is correct
45 Correct 13 ms 1028 KB Output is correct
46 Correct 13 ms 1068 KB Output is correct
47 Correct 11 ms 1100 KB Output is correct
48 Correct 12 ms 1004 KB Output is correct
49 Correct 15 ms 1144 KB Output is correct
50 Correct 14 ms 1100 KB Output is correct
51 Correct 10 ms 1112 KB Output is correct
52 Correct 11 ms 1100 KB Output is correct
53 Correct 9 ms 1088 KB Output is correct
54 Correct 12 ms 1116 KB Output is correct
55 Correct 14 ms 1100 KB Output is correct
56 Correct 14 ms 1100 KB Output is correct
57 Correct 14 ms 1120 KB Output is correct
58 Correct 11 ms 1100 KB Output is correct
59 Correct 11 ms 1100 KB Output is correct
60 Correct 12 ms 1036 KB Output is correct
61 Correct 12 ms 1100 KB Output is correct
62 Correct 709 ms 39888 KB Output is correct
63 Correct 731 ms 42952 KB Output is correct
64 Correct 932 ms 43380 KB Output is correct
65 Correct 1006 ms 43428 KB Output is correct
66 Correct 854 ms 44508 KB Output is correct
67 Correct 1016 ms 43544 KB Output is correct
68 Correct 544 ms 47584 KB Output is correct
69 Correct 708 ms 39648 KB Output is correct
70 Correct 572 ms 45156 KB Output is correct
71 Correct 700 ms 42560 KB Output is correct
72 Correct 802 ms 43356 KB Output is correct
73 Correct 807 ms 43332 KB Output is correct
74 Correct 915 ms 47856 KB Output is correct
75 Correct 1004 ms 40256 KB Output is correct
76 Correct 720 ms 39668 KB Output is correct
77 Correct 994 ms 39888 KB Output is correct
78 Correct 1092 ms 39716 KB Output is correct
79 Correct 1135 ms 39924 KB Output is correct
80 Correct 1014 ms 39932 KB Output is correct
81 Correct 1109 ms 39796 KB Output is correct
82 Correct 733 ms 39848 KB Output is correct
83 Correct 707 ms 39696 KB Output is correct
84 Correct 796 ms 39860 KB Output is correct
85 Correct 966 ms 39940 KB Output is correct
86 Correct 1152 ms 40064 KB Output is correct
87 Correct 1038 ms 39764 KB Output is correct
88 Correct 1034 ms 42372 KB Output is correct
89 Correct 1030 ms 41628 KB Output is correct
90 Correct 1108 ms 40748 KB Output is correct
91 Correct 1111 ms 39924 KB Output is correct
92 Correct 954 ms 39744 KB Output is correct
93 Correct 1098 ms 39728 KB Output is correct
94 Correct 1095 ms 39876 KB Output is correct
95 Correct 970 ms 42652 KB Output is correct
96 Correct 1004 ms 41192 KB Output is correct
97 Correct 1165 ms 40148 KB Output is correct
98 Correct 1124 ms 39888 KB Output is correct
99 Correct 1153 ms 39676 KB Output is correct
100 Correct 1139 ms 39752 KB Output is correct
101 Correct 598 ms 43076 KB Output is correct
102 Correct 702 ms 40516 KB Output is correct
103 Correct 809 ms 40264 KB Output is correct
104 Correct 935 ms 40388 KB Output is correct
105 Correct 1074 ms 40016 KB Output is correct
106 Correct 900 ms 39748 KB Output is correct
107 Correct 1004 ms 39848 KB Output is correct
108 Correct 1086 ms 39960 KB Output is correct
109 Correct 906 ms 47728 KB Output is correct
110 Correct 1164 ms 41024 KB Output is correct
111 Correct 1101 ms 39704 KB Output is correct
112 Correct 1051 ms 41156 KB Output is correct
113 Correct 1179 ms 39888 KB Output is correct
114 Correct 1150 ms 39708 KB Output is correct
115 Correct 706 ms 40092 KB Output is correct
116 Correct 728 ms 39644 KB Output is correct
117 Correct 785 ms 39924 KB Output is correct
118 Correct 780 ms 39756 KB Output is correct
119 Correct 1070 ms 39924 KB Output is correct
120 Correct 1064 ms 39732 KB Output is correct