oj.uz

Submission #800100

# Submission time Handle Problem Language Result Execution time Memory
800100 2023-08-01T10:11:26 Z NothingXD Financial Report (JOI21_financial) C++17
100 / 100
 3640 ms 288928 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void debug_out(){cerr<<endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 3e5 + 10;
const int lg = 22;

struct Seg{
	int l, r, ans;
	bool b;
} seg[maxn*lg];

int n, d, a[maxn], dp[maxn], lc[maxn*lg], rc[maxn*lg], root[maxn], vercnt = 1;
vector<pii> val;
void build(int v, int l, int r){
	seg[v].l = seg[v].r = seg[v].b = seg[v].ans = 0;
	if (l + 1 == r){
		return;
	}
	int mid = (l + r) >> 1;
	lc[v] = vercnt++;
	rc[v] = vercnt++;
	build(lc[v], l, mid);
	build(rc[v], mid, r);
}

Seg operator +(Seg a, Seg b){
	Seg res;
	res.l = (a.b? a.l + b.l: a.l);
	res.r = (b.b? b.r + a.r: b.r);
	res.ans = max({a.ans, b.ans, a.r + b.l});
	res.b = (a.b && b.b);
	return res;
}

void change(int v, int newv, int l, int r, int idx){
	if (l + 1 == r){
		seg[newv].l = seg[newv].r = seg[newv].ans = seg[newv].b = 1;
		return;
	}
	int mid = (l + r) >> 1;
	if (idx < mid){
		lc[newv] = vercnt++;
		rc[newv] = rc[v];
		change(lc[v], lc[newv], l, mid, idx);
	}
	else{
		lc[newv] = lc[v];
		rc[newv] = vercnt++;
		change(rc[v], rc[newv], mid, r, idx);
	}
	seg[newv] = seg[lc[newv]] + seg[rc[newv]];
}

Seg get(int v, int l, int r, int ql, int qr){
	if (qr <= l || r <= ql){
		Seg tmp;
		tmp.l = tmp.r = tmp.ans = 0;
		tmp.b = true;
		return tmp;
	}
	if (ql <= l && r <= qr) return seg[v];
	int mid = (l + r) >> 1;
	return get(lc[v], l, mid, ql, qr)
		+ get(rc[v], mid, r, ql, qr);
}

vector<int> num[maxn << 2];
vector<int> mx[maxn << 2];
bool ok[maxn << 2];

void add(int v, int l, int r, int idx){
	if (idx < l || r <= idx) return;
	if (l + 1 == r){
		num[v].resize(1);
		mx[v].resize(1);
		num[v][0] = (a[idx]);
		mx[v][0] = (dp[idx]);
		ok[v] = true;
		return;
	}
	int mid = (l + r) >> 1;
	add(v << 1, l, mid, idx);
	add(v << 1 | 1, mid, r, idx);
	if (!ok[v<<1] || !ok[v<<1|1]) return;
	ok[v] = true;
	int ptl = 0, ptr = 0;
	num[v].resize(r-l);
	mx[v].resize(r-l);
	for (int i = 0; i < r-l; i++){
		if (ptr == num[v<<1|1].size() || (ptl != num[v << 1].size() && num[v<<1][ptl] < num[v<<1|1][ptr])){
			num[v][i] = num[v<<1][ptl];
			mx[v][i] = mx[v<<1][ptl];
			ptl++;
		}
		else{
			num[v][i] = num[v<<1|1][ptr];
			mx[v][i] = mx[v<<1|1][ptr];
			ptr++;
		}
	}
	for (int i = 1; i < r-l; i++){
		mx[v][i] = max(mx[v][i], mx[v][i-1]);
	}
}

int get(int v, int l, int r, int ql, int qr, int val){
	if (qr <= l || r <= ql) return 0;
	if (ql <= l && r <= qr && ok[v]){
		int idx = lower_bound(all(num[v]), val) - num[v].begin();
		if (idx != 0) return mx[v][idx-1];
		return 0;
	}
	int mid = (l + r) >> 1;
	return max(get(v << 1, l, mid, ql, qr, val)
			,get(v << 1 | 1, mid, r, ql, qr, val));
}

int main(){

	cin >> n >> d;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
		val.push_back({a[i], i});
	}

	sort(all(val));

	root[n] = 0;
	build(0, 1, n+1);

	//debug(vercnt);

	for (int i = n-1; ~i; i--){
		root[i] = vercnt++;
		//debug(i, val[i].S);
		change(root[i+1], root[i], 1, n+1, val[i].S);
		//debug(vercnt);
	}

	int ans = 0;

	for (int i = 1; i <= n; i++){
		int idx = lower_bound(all(val), MP(a[i], 0)) - val.begin();
		//debug(i, idx);
		int l = 0, r = i;
		while (l + 1 < r){
			int mid = (l + r) >> 1;
		//	debug(mid, get(root[idx], 1, n+1, mid, i).ans);
			if (get(root[idx], 1, n+1, mid, i).ans < d) r = mid;
			else l = mid;
		}
	//	debug(r);
		dp[i] = get(1, 1, n+1, r, i, a[i]) + 1;
	//	debug(i, dp[i]);
		add(1, 1, n+1, i);
		ans = max(ans, dp[i]);
	}

//	debug(vercnt);

	cout << ans << '\n';

	return 0;
}

Compilation message

Main.cpp: In function 'void build(int, int, int)':
Main.cpp:33:46: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   33 |  seg[v].l = seg[v].r = seg[v].b = seg[v].ans = 0;
      |                                   ~~~~~~~~~~~^~~
Main.cpp: In function 'void add(int, int, int, int)':
Main.cpp:108:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |   if (ptr == num[v<<1|1].size() || (ptl != num[v << 1].size() && num[v<<1][ptl] < num[v<<1|1][ptr])){
      |       ~~~~^~~~~~~~~~~~~~~~~~~~~
Main.cpp:108:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |   if (ptr == num[v<<1|1].size() || (ptl != num[v << 1].size() && num[v<<1][ptl] < num[v<<1|1][ptr])){
      |                                     ~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 56660 KB Output is correct
2 Correct 28 ms 56592 KB Output is correct
3 Correct 27 ms 56688 KB Output is correct
4 Correct 27 ms 56684 KB Output is correct
5 Correct 28 ms 56688 KB Output is correct
6 Correct 27 ms 56700 KB Output is correct
7 Correct 26 ms 56608 KB Output is correct
8 Correct 27 ms 56652 KB Output is correct
9 Correct 27 ms 56660 KB Output is correct
10 Correct 27 ms 56652 KB Output is correct
11 Correct 27 ms 56612 KB Output is correct
12 Correct 28 ms 56660 KB Output is correct
13 Correct 27 ms 56672 KB Output is correct
14 Correct 29 ms 56708 KB Output is correct
15 Correct 28 ms 56636 KB Output is correct
16 Correct 28 ms 56660 KB Output is correct
17 Correct 27 ms 56648 KB Output is correct
18 Correct 27 ms 56608 KB Output is correct
19 Correct 29 ms 56716 KB Output is correct
20 Correct 28 ms 56636 KB Output is correct
21 Correct 27 ms 56588 KB Output is correct
22 Correct 29 ms 56676 KB Output is correct
23 Correct 27 ms 56636 KB Output is correct
24 Correct 27 ms 56660 KB Output is correct
25 Correct 27 ms 56600 KB Output is correct
26 Correct 28 ms 56584 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 56660 KB Output is correct
2 Correct 28 ms 56592 KB Output is correct
3 Correct 27 ms 56688 KB Output is correct
4 Correct 27 ms 56684 KB Output is correct
5 Correct 28 ms 56688 KB Output is correct
6 Correct 27 ms 56700 KB Output is correct
7 Correct 26 ms 56608 KB Output is correct
8 Correct 27 ms 56652 KB Output is correct
9 Correct 27 ms 56660 KB Output is correct
10 Correct 27 ms 56652 KB Output is correct
11 Correct 27 ms 56612 KB Output is correct
12 Correct 28 ms 56660 KB Output is correct
13 Correct 27 ms 56672 KB Output is correct
14 Correct 29 ms 56708 KB Output is correct
15 Correct 28 ms 56636 KB Output is correct
16 Correct 28 ms 56660 KB Output is correct
17 Correct 27 ms 56648 KB Output is correct
18 Correct 27 ms 56608 KB Output is correct
19 Correct 29 ms 56716 KB Output is correct
20 Correct 28 ms 56636 KB Output is correct
21 Correct 27 ms 56588 KB Output is correct
22 Correct 29 ms 56676 KB Output is correct
23 Correct 27 ms 56636 KB Output is correct
24 Correct 27 ms 56660 KB Output is correct
25 Correct 27 ms 56600 KB Output is correct
26 Correct 28 ms 56584 KB Output is correct
27 Correct 27 ms 56788 KB Output is correct
28 Correct 29 ms 56764 KB Output is correct
29 Correct 28 ms 56876 KB Output is correct
30 Correct 28 ms 56788 KB Output is correct
31 Correct 29 ms 56856 KB Output is correct
32 Correct 28 ms 56788 KB Output is correct
33 Correct 28 ms 56836 KB Output is correct
34 Correct 29 ms 56788 KB Output is correct
35 Correct 28 ms 56768 KB Output is correct
36 Correct 30 ms 56864 KB Output is correct
37 Correct 32 ms 56948 KB Output is correct
38 Correct 31 ms 56876 KB Output is correct
39 Correct 28 ms 56776 KB Output is correct
40 Correct 28 ms 56788 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 56660 KB Output is correct
2 Correct 28 ms 56592 KB Output is correct
3 Correct 27 ms 56688 KB Output is correct
4 Correct 27 ms 56684 KB Output is correct
5 Correct 28 ms 56688 KB Output is correct
6 Correct 27 ms 56700 KB Output is correct
7 Correct 26 ms 56608 KB Output is correct
8 Correct 27 ms 56652 KB Output is correct
9 Correct 27 ms 56660 KB Output is correct
10 Correct 27 ms 56652 KB Output is correct
11 Correct 27 ms 56612 KB Output is correct
12 Correct 28 ms 56660 KB Output is correct
13 Correct 27 ms 56672 KB Output is correct
14 Correct 29 ms 56708 KB Output is correct
15 Correct 28 ms 56636 KB Output is correct
16 Correct 28 ms 56660 KB Output is correct
17 Correct 27 ms 56648 KB Output is correct
18 Correct 27 ms 56608 KB Output is correct
19 Correct 29 ms 56716 KB Output is correct
20 Correct 28 ms 56636 KB Output is correct
21 Correct 27 ms 56588 KB Output is correct
22 Correct 29 ms 56676 KB Output is correct
23 Correct 27 ms 56636 KB Output is correct
24 Correct 27 ms 56660 KB Output is correct
25 Correct 27 ms 56600 KB Output is correct
26 Correct 28 ms 56584 KB Output is correct
27 Correct 27 ms 56788 KB Output is correct
28 Correct 29 ms 56764 KB Output is correct
29 Correct 28 ms 56876 KB Output is correct
30 Correct 28 ms 56788 KB Output is correct
31 Correct 29 ms 56856 KB Output is correct
32 Correct 28 ms 56788 KB Output is correct
33 Correct 28 ms 56836 KB Output is correct
34 Correct 29 ms 56788 KB Output is correct
35 Correct 28 ms 56768 KB Output is correct
36 Correct 30 ms 56864 KB Output is correct
37 Correct 32 ms 56948 KB Output is correct
38 Correct 31 ms 56876 KB Output is correct
39 Correct 28 ms 56776 KB Output is correct
40 Correct 28 ms 56788 KB Output is correct
41 Correct 50 ms 60840 KB Output is correct
42 Correct 52 ms 60736 KB Output is correct
43 Correct 50 ms 60832 KB Output is correct
44 Correct 49 ms 60244 KB Output is correct
45 Correct 51 ms 60508 KB Output is correct
46 Correct 53 ms 60780 KB Output is correct
47 Correct 59 ms 60624 KB Output is correct
48 Correct 54 ms 60728 KB Output is correct
49 Correct 53 ms 60716 KB Output is correct
50 Correct 55 ms 60784 KB Output is correct
51 Correct 51 ms 60812 KB Output is correct
52 Correct 53 ms 60836 KB Output is correct
53 Correct 50 ms 60796 KB Output is correct
54 Correct 53 ms 60804 KB Output is correct
55 Correct 55 ms 60748 KB Output is correct
56 Correct 54 ms 60760 KB Output is correct
57 Correct 55 ms 60820 KB Output is correct
58 Correct 51 ms 60776 KB Output is correct
59 Correct 51 ms 60872 KB Output is correct
60 Correct 58 ms 60692 KB Output is correct
61 Correct 51 ms 60672 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1716 ms 285916 KB Output is correct
2 Correct 1944 ms 288412 KB Output is correct
3 Correct 2283 ms 288656 KB Output is correct
4 Correct 3102 ms 288716 KB Output is correct
5 Correct 2373 ms 288692 KB Output is correct
6 Correct 3023 ms 288668 KB Output is correct
7 Correct 1776 ms 287284 KB Output is correct
8 Correct 1853 ms 288052 KB Output is correct
9 Correct 1797 ms 288720 KB Output is correct
10 Correct 1705 ms 288704 KB Output is correct
11 Correct 1950 ms 288908 KB Output is correct
12 Correct 2286 ms 288752 KB Output is correct
13 Correct 2522 ms 288728 KB Output is correct
14 Correct 2747 ms 288712 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1839 ms 285732 KB Output is correct
2 Correct 2538 ms 288696 KB Output is correct
3 Correct 3276 ms 288636 KB Output is correct
4 Correct 3390 ms 288776 KB Output is correct
5 Correct 2888 ms 288700 KB Output is correct
6 Correct 3372 ms 288816 KB Output is correct
7 Correct 1816 ms 288856 KB Output is correct
8 Correct 1843 ms 288704 KB Output is correct
9 Correct 1839 ms 287008 KB Output is correct
10 Correct 2076 ms 287864 KB Output is correct
11 Correct 3025 ms 288876 KB Output is correct
12 Correct 2643 ms 288668 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 56660 KB Output is correct
2 Correct 28 ms 56592 KB Output is correct
3 Correct 27 ms 56688 KB Output is correct
4 Correct 27 ms 56684 KB Output is correct
5 Correct 28 ms 56688 KB Output is correct
6 Correct 27 ms 56700 KB Output is correct
7 Correct 26 ms 56608 KB Output is correct
8 Correct 27 ms 56652 KB Output is correct
9 Correct 27 ms 56660 KB Output is correct
10 Correct 27 ms 56652 KB Output is correct
11 Correct 27 ms 56612 KB Output is correct
12 Correct 28 ms 56660 KB Output is correct
13 Correct 27 ms 56672 KB Output is correct
14 Correct 29 ms 56708 KB Output is correct
15 Correct 28 ms 56636 KB Output is correct
16 Correct 28 ms 56660 KB Output is correct
17 Correct 27 ms 56648 KB Output is correct
18 Correct 27 ms 56608 KB Output is correct
19 Correct 29 ms 56716 KB Output is correct
20 Correct 28 ms 56636 KB Output is correct
21 Correct 27 ms 56588 KB Output is correct
22 Correct 29 ms 56676 KB Output is correct
23 Correct 27 ms 56636 KB Output is correct
24 Correct 27 ms 56660 KB Output is correct
25 Correct 27 ms 56600 KB Output is correct
26 Correct 28 ms 56584 KB Output is correct
27 Correct 27 ms 56788 KB Output is correct
28 Correct 29 ms 56764 KB Output is correct
29 Correct 28 ms 56876 KB Output is correct
30 Correct 28 ms 56788 KB Output is correct
31 Correct 29 ms 56856 KB Output is correct
32 Correct 28 ms 56788 KB Output is correct
33 Correct 28 ms 56836 KB Output is correct
34 Correct 29 ms 56788 KB Output is correct
35 Correct 28 ms 56768 KB Output is correct
36 Correct 30 ms 56864 KB Output is correct
37 Correct 32 ms 56948 KB Output is correct
38 Correct 31 ms 56876 KB Output is correct
39 Correct 28 ms 56776 KB Output is correct
40 Correct 28 ms 56788 KB Output is correct
41 Correct 50 ms 60840 KB Output is correct
42 Correct 52 ms 60736 KB Output is correct
43 Correct 50 ms 60832 KB Output is correct
44 Correct 49 ms 60244 KB Output is correct
45 Correct 51 ms 60508 KB Output is correct
46 Correct 53 ms 60780 KB Output is correct
47 Correct 59 ms 60624 KB Output is correct
48 Correct 54 ms 60728 KB Output is correct
49 Correct 53 ms 60716 KB Output is correct
50 Correct 55 ms 60784 KB Output is correct
51 Correct 51 ms 60812 KB Output is correct
52 Correct 53 ms 60836 KB Output is correct
53 Correct 50 ms 60796 KB Output is correct
54 Correct 53 ms 60804 KB Output is correct
55 Correct 55 ms 60748 KB Output is correct
56 Correct 54 ms 60760 KB Output is correct
57 Correct 55 ms 60820 KB Output is correct
58 Correct 51 ms 60776 KB Output is correct
59 Correct 51 ms 60872 KB Output is correct
60 Correct 58 ms 60692 KB Output is correct
61 Correct 51 ms 60672 KB Output is correct
62 Correct 1716 ms 285916 KB Output is correct
63 Correct 1944 ms 288412 KB Output is correct
64 Correct 2283 ms 288656 KB Output is correct
65 Correct 3102 ms 288716 KB Output is correct
66 Correct 2373 ms 288692 KB Output is correct
67 Correct 3023 ms 288668 KB Output is correct
68 Correct 1776 ms 287284 KB Output is correct
69 Correct 1853 ms 288052 KB Output is correct
70 Correct 1797 ms 288720 KB Output is correct
71 Correct 1705 ms 288704 KB Output is correct
72 Correct 1950 ms 288908 KB Output is correct
73 Correct 2286 ms 288752 KB Output is correct
74 Correct 2522 ms 288728 KB Output is correct
75 Correct 2747 ms 288712 KB Output is correct
76 Correct 1839 ms 285732 KB Output is correct
77 Correct 2538 ms 288696 KB Output is correct
78 Correct 3276 ms 288636 KB Output is correct
79 Correct 3390 ms 288776 KB Output is correct
80 Correct 2888 ms 288700 KB Output is correct
81 Correct 3372 ms 288816 KB Output is correct
82 Correct 1816 ms 288856 KB Output is correct
83 Correct 1843 ms 288704 KB Output is correct
84 Correct 1839 ms 287008 KB Output is correct
85 Correct 2076 ms 287864 KB Output is correct
86 Correct 3025 ms 288876 KB Output is correct
87 Correct 2643 ms 288668 KB Output is correct
88 Correct 2830 ms 288736 KB Output is correct
89 Correct 3304 ms 288664 KB Output is correct
90 Correct 3639 ms 288708 KB Output is correct
91 Correct 3617 ms 288712 KB Output is correct
92 Correct 2431 ms 288732 KB Output is correct
93 Correct 3424 ms 288644 KB Output is correct
94 Correct 3335 ms 288808 KB Output is correct
95 Correct 2645 ms 288752 KB Output is correct
96 Correct 3113 ms 288728 KB Output is correct
97 Correct 3361 ms 288736 KB Output is correct
98 Correct 3446 ms 288900 KB Output is correct
99 Correct 3640 ms 288664 KB Output is correct
100 Correct 3495 ms 288684 KB Output is correct
101 Correct 1830 ms 288684 KB Output is correct
102 Correct 1872 ms 288764 KB Output is correct
103 Correct 1954 ms 288752 KB Output is correct
104 Correct 2082 ms 288872 KB Output is correct
105 Correct 2248 ms 288668 KB Output is correct
106 Correct 2251 ms 288684 KB Output is correct
107 Correct 2752 ms 288828 KB Output is correct
108 Correct 3141 ms 288784 KB Output is correct
109 Correct 2349 ms 288716 KB Output is correct
110 Correct 3160 ms 288632 KB Output is correct
111 Correct 3203 ms 288664 KB Output is correct
112 Correct 2354 ms 288660 KB Output is correct
113 Correct 3082 ms 288752 KB Output is correct
114 Correct 3137 ms 288716 KB Output is correct
115 Correct 1924 ms 288928 KB Output is correct
116 Correct 1825 ms 288724 KB Output is correct
117 Correct 1883 ms 288720 KB Output is correct
118 Correct 1876 ms 288764 KB Output is correct
119 Correct 2333 ms 288432 KB Output is correct
120 Correct 2264 ms 288380 KB Output is correct