oj.uz

Submission #546578

# Submission time Handle Problem Language Result Execution time Memory
546578 2022-04-07T20:43:11 Z nafis_shifat Financial Report (JOI21_financial) C++14
100 / 100
 709 ms 39740 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=3e5+5;
const int inf=1e9;
int n, D;
int a[mxn];
struct segtree {
	int tree[4 * mxn] = {};
	int pref[4 * mxn] = {};
	int suf[4 * mxn] = {};

	void build(int node,int b,int e) {
		if(b==e) {
			tree[node] = 1;
			suf[node] = 1;
			pref[node] = 1;
			return;
		}
		int mid=b+e>>1;
		int left=node<<1;
		int right=left|1;

		build(left,b,mid);
		build(right,mid+1,e);
		tree[node] = pref[node] = suf[node] = e - b + 1;

	}


	void update(int node,int b,int e,int p) {
		if(e<p || b>p)return;
		if(b == e) {
			tree[node] = 0;
			suf[node] = 0;
			pref[node] = 0;
			return;
		}
		

		int mid=b+e>>1;
		int left=node<<1;
		int right=left|1;

		update(left,b,mid,p);
		update(right,mid+1,e,p);

		tree[node] = max({tree[left], tree[right], suf[left] + pref[right]});
		suf[node] = suf[right];
		pref[node] = pref[left];

		if(suf[right] == e - mid) suf[node] += suf[left];
		if(pref[left] == mid - b + 1) pref[node] += pref[right];

	}

	int query(int node, int b, int e, int p) {
		if(b > p) return -1;
		if(e <= p && suf[node] >= D) {
			return e;
		}

		if(tree[node] < D) return -1;


		int mid = b + e >> 1;
		int left = node << 1;
		int right = left | 1;

		if(p <= mid) return query(left, b, mid, p);

		int vr = query(right, mid + 1, e, p);
		if(vr != -1) return vr;

		if(mid + pref[right] <= p && suf[left] + pref[right] >= D) return mid + pref[right];
	    if(mid + pref[right] > p && p - mid + suf[left] >= D) return p;

		return query(left, b, mid, p);
	}
} st;


struct sgtree {
	int tree[4*mxn] = {};

	void update(int node,int b,int e,int p,int v) {
		if(e<p || b>p)return;
		if(b == e) {
			tree[node] = v;
			return;
		}

		int mid=b+e>>1;
		int left=node<<1;
		int right=left|1;

		update(left,b,mid,p,v);
		update(right,mid+1,e,p,v);
		tree[node]=max(tree[left],tree[right]);
	}

	int query(int node, int b, int e, int l, int r) {
		if(e < l || b > r) return 0;
		if(b >= l && e <= r) return tree[node];
		int mid=b+e>>1;
		int left=node<<1;
		int right=left|1;
		return max(query(left, b, mid, l, r), query(right, mid + 1, e, l, r));
	}
} rmq;
int main() {
	cin >> n >> D;
	vector<int> v;
	vector<int> con[n + 1];
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		v.push_back(a[i]);
	}

	sort(v.begin(),v.end());

	v.erase(unique(v.begin(), v.end()), v.end());

	for(int i = 1; i <= n; i++) {
		a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin() + 1;
		con[a[i]].push_back(i);
	}

	st.build(1, 1, n);

	int dp[n + 1] = {};
	int ans = 0;

	for(int x = 1; x <= n; x++) {
		for(int i : con[x]) {
			int p = st.query(1, 1, n, i - 1);
			if(p == -1) dp[i] = rmq.query(1, 1, n, 1, i - 1) + 1;
			else dp[i] = rmq.query(1, 1, n, p, i - 1) + 1;
		}

		for(int i : con[x]) {
			st.update(1, 1, n, i);
			rmq.update(1, 1, n, i, dp[i]);
			ans = max(ans, dp[i]);
		}
	}

	cout<<ans<<endl;




	
}

Compilation message

Main.cpp: In member function 'void segtree::build(int, int, int)':
Main.cpp:21:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |   int mid=b+e>>1;
      |           ~^~
Main.cpp: In member function 'void segtree::update(int, int, int, int)':
Main.cpp:42:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   42 |   int mid=b+e>>1;
      |           ~^~
Main.cpp: In member function 'int segtree::query(int, int, int, int)':
Main.cpp:67:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   67 |   int mid = b + e >> 1;
      |             ~~^~~
Main.cpp: In member function 'void sgtree::update(int, int, int, int, int)':
Main.cpp:94:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   94 |   int mid=b+e>>1;
      |           ~^~
Main.cpp: In member function 'int sgtree::query(int, int, int, int, int)':
Main.cpp:106:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  106 |   int mid=b+e>>1;
      |           ~^~

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 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 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 340 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 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 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 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 340 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 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 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 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 340 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 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 9 ms 860 KB Output is correct
42 Correct 8 ms 980 KB Output is correct
43 Correct 6 ms 852 KB Output is correct
44 Correct 7 ms 852 KB Output is correct
45 Correct 8 ms 852 KB Output is correct
46 Correct 8 ms 1052 KB Output is correct
47 Correct 8 ms 980 KB Output is correct
48 Correct 10 ms 1048 KB Output is correct
49 Correct 9 ms 1052 KB Output is correct
50 Correct 8 ms 980 KB Output is correct
51 Correct 9 ms 980 KB Output is correct
52 Correct 9 ms 980 KB Output is correct
53 Correct 7 ms 980 KB Output is correct
54 Correct 7 ms 980 KB Output is correct
55 Correct 8 ms 980 KB Output is correct
56 Correct 8 ms 980 KB Output is correct
57 Correct 7 ms 980 KB Output is correct
58 Correct 7 ms 1032 KB Output is correct
59 Correct 6 ms 980 KB Output is correct
60 Correct 7 ms 1048 KB Output is correct
61 Correct 8 ms 980 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 29348 KB Output is correct
2 Correct 320 ms 31704 KB Output is correct
3 Correct 446 ms 32016 KB Output is correct
4 Correct 671 ms 38356 KB Output is correct
5 Correct 497 ms 39476 KB Output is correct
6 Correct 709 ms 39612 KB Output is correct
7 Correct 310 ms 39512 KB Output is correct
8 Correct 328 ms 39544 KB Output is correct
9 Correct 339 ms 39684 KB Output is correct
10 Correct 329 ms 39740 KB Output is correct
11 Correct 463 ms 39532 KB Output is correct
12 Correct 510 ms 39576 KB Output is correct
13 Correct 522 ms 39480 KB Output is correct
14 Correct 641 ms 39600 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 29456 KB Output is correct
2 Correct 411 ms 31592 KB Output is correct
3 Correct 421 ms 32444 KB Output is correct
4 Correct 591 ms 39636 KB Output is correct
5 Correct 488 ms 39600 KB Output is correct
6 Correct 547 ms 39720 KB Output is correct
7 Correct 296 ms 39532 KB Output is correct
8 Correct 296 ms 39584 KB Output is correct
9 Correct 321 ms 39444 KB Output is correct
10 Correct 374 ms 39624 KB Output is correct
11 Correct 520 ms 39600 KB Output is correct
12 Correct 443 ms 39604 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 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 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 340 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 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 9 ms 860 KB Output is correct
42 Correct 8 ms 980 KB Output is correct
43 Correct 6 ms 852 KB Output is correct
44 Correct 7 ms 852 KB Output is correct
45 Correct 8 ms 852 KB Output is correct
46 Correct 8 ms 1052 KB Output is correct
47 Correct 8 ms 980 KB Output is correct
48 Correct 10 ms 1048 KB Output is correct
49 Correct 9 ms 1052 KB Output is correct
50 Correct 8 ms 980 KB Output is correct
51 Correct 9 ms 980 KB Output is correct
52 Correct 9 ms 980 KB Output is correct
53 Correct 7 ms 980 KB Output is correct
54 Correct 7 ms 980 KB Output is correct
55 Correct 8 ms 980 KB Output is correct
56 Correct 8 ms 980 KB Output is correct
57 Correct 7 ms 980 KB Output is correct
58 Correct 7 ms 1032 KB Output is correct
59 Correct 6 ms 980 KB Output is correct
60 Correct 7 ms 1048 KB Output is correct
61 Correct 8 ms 980 KB Output is correct
62 Correct 348 ms 29348 KB Output is correct
63 Correct 320 ms 31704 KB Output is correct
64 Correct 446 ms 32016 KB Output is correct
65 Correct 671 ms 38356 KB Output is correct
66 Correct 497 ms 39476 KB Output is correct
67 Correct 709 ms 39612 KB Output is correct
68 Correct 310 ms 39512 KB Output is correct
69 Correct 328 ms 39544 KB Output is correct
70 Correct 339 ms 39684 KB Output is correct
71 Correct 329 ms 39740 KB Output is correct
72 Correct 463 ms 39532 KB Output is correct
73 Correct 510 ms 39576 KB Output is correct
74 Correct 522 ms 39480 KB Output is correct
75 Correct 641 ms 39600 KB Output is correct
76 Correct 273 ms 29456 KB Output is correct
77 Correct 411 ms 31592 KB Output is correct
78 Correct 421 ms 32444 KB Output is correct
79 Correct 591 ms 39636 KB Output is correct
80 Correct 488 ms 39600 KB Output is correct
81 Correct 547 ms 39720 KB Output is correct
82 Correct 296 ms 39532 KB Output is correct
83 Correct 296 ms 39584 KB Output is correct
84 Correct 321 ms 39444 KB Output is correct
85 Correct 374 ms 39624 KB Output is correct
86 Correct 520 ms 39600 KB Output is correct
87 Correct 443 ms 39604 KB Output is correct
88 Correct 517 ms 32084 KB Output is correct
89 Correct 612 ms 39244 KB Output is correct
90 Correct 543 ms 32928 KB Output is correct
91 Correct 589 ms 39596 KB Output is correct
92 Correct 344 ms 32168 KB Output is correct
93 Correct 416 ms 32072 KB Output is correct
94 Correct 545 ms 36808 KB Output is correct
95 Correct 570 ms 39608 KB Output is correct
96 Correct 585 ms 39592 KB Output is correct
97 Correct 577 ms 39604 KB Output is correct
98 Correct 585 ms 39596 KB Output is correct
99 Correct 527 ms 39596 KB Output is correct
100 Correct 506 ms 39616 KB Output is correct
101 Correct 331 ms 39596 KB Output is correct
102 Correct 350 ms 39592 KB Output is correct
103 Correct 377 ms 39544 KB Output is correct
104 Correct 384 ms 39568 KB Output is correct
105 Correct 445 ms 39600 KB Output is correct
106 Correct 471 ms 39592 KB Output is correct
107 Correct 497 ms 39480 KB Output is correct
108 Correct 530 ms 39736 KB Output is correct
109 Correct 457 ms 39572 KB Output is correct
110 Correct 590 ms 39640 KB Output is correct
111 Correct 599 ms 39596 KB Output is correct
112 Correct 398 ms 39536 KB Output is correct
113 Correct 564 ms 39564 KB Output is correct
114 Correct 575 ms 39560 KB Output is correct
115 Correct 300 ms 39528 KB Output is correct
116 Correct 283 ms 39504 KB Output is correct
117 Correct 316 ms 39624 KB Output is correct
118 Correct 304 ms 39600 KB Output is correct
119 Correct 398 ms 39576 KB Output is correct
120 Correct 394 ms 39584 KB Output is correct