oj.uz

Submission #419653

# Submission time Handle Problem Language Result Execution time Memory
419653 2021-06-07T10:54:45 Z alishahali1382 Financial Report (JOI21_financial) C++14
100 / 100
 636 ms 23872 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef pair<pii, int> piii;
#define debug(x) {cerr<<#x<<"="<<x<<"\n";}
#define debug2(x, y) {cerr<<"{"<<#x<<", "<<#y<<"}={"<<x<<", "<<y<<"}\n";}
#define debugp(p) {cerr<<#p<<"={"<<p.first<<" "<<p.second<<"}\n";}
#define debugv(abcd) {cerr<<#abcd<<": ";for (auto dcba:abcd) cerr<<dcba<<" ";cerr<<"\n";}
#define pb push_back
#define all(x) x.begin(), x.end()
#define kill(x) return cout<<x<<"\n", 0;
#define SZ(x) ((int)x.size())

const int inf=1000010000;
const int mod=1000000007;
const int MAXN=300010;

struct Node{
	int pref, suff, ans;
	bool full;
} seg[MAXN<<2];
Node getNode(int x){
	Node tmp;
	tmp.pref=tmp.suff=tmp.ans=tmp.full=x;
	return tmp;
}
Node operator +(Node X, Node Y){
	Node Z;
	Z.pref=X.pref+(X.full?Y.pref:0);
	Z.suff=(Y.full?X.suff:0)+Y.suff;
	Z.ans=max({X.ans, Y.ans, X.suff+Y.pref});
	Z.full=X.full&Y.full;
	return Z;
}

int n, m, q, k, u, v, x, y, t, l, r, ans;
int A[MAXN], dp[MAXN];
pii comp[MAXN];

Node Build(int id, int tl, int tr){
	if (tr-tl==1) return seg[id]=getNode(1);
	int mid=(tl+tr)>>1;
	return seg[id]=Build(id<<1, tl, mid)+Build(id<<1 | 1, mid, tr);
}
void Set(int id, int tl, int tr, int pos, int x){
	if (pos<tl || tr<=pos) return ;
	if (tr-tl==1){
		seg[id]=getNode(x);
		return ;
	}
	int mid=(tl+tr)>>1;
	Set(id<<1, tl, mid, pos, x);
	Set(id<<1 | 1, mid, tr, pos, x);
	seg[id]=seg[id<<1] + seg[id<<1 | 1];
}
Node Get(int id, int tl, int tr, int l, int r){
	if (r<=tl || tr<=l) return seg[0];
	if (l<=tl && tr<=r) return seg[id];
	int mid=(tl+tr)>>1;
	return Get(id<<1, tl, mid, l, r) + Get(id<<1 | 1, mid, tr, l, r);
}
pair<Node, int> BS(int id, int tl, int tr, int l, int r, Node X){
	if (r<=tl || tr<=l) return {X, tl};
	if (l<=tl && tr<=r){
		if ((seg[id]+X).ans<k) return {seg[id]+X, tl};
		if (tr-tl==1) return {X, tr};
		int mid=(tl+tr)>>1;
		auto p=BS(id<<1 | 1, mid, tr, l, r, X);
		if (mid<p.second) return p;
		return BS(id<<1, tl, mid, l, r, p.first);
	}
	int mid=(tl+tr)>>1;
	auto p=BS(id<<1 | 1, mid, tr, l, r, X);
	if (mid<p.second) return p;
	return BS(id<<1, tl, mid, l, r, p.first);
}

struct Segment2{
	int seg[MAXN<<1];
	void Set(int pos, int val){
		for (seg[pos+=n]=val; pos>1; pos>>=1) seg[pos>>1]=max(seg[pos], seg[pos^1]);
	}
	int Get(int l, int r){
		int res=0;
		for (l+=n, r+=n; l<r; l>>=1, r>>=1){
			if (l&1) res=max(res, seg[l++]);
			if (r&1) res=max(res, seg[--r]);
		}
		return res;
	}
} seg2;

int main(){
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	seg[0].full=1;
	cin>>n>>k;
	for (int i=1; i<=n; i++) cin>>A[i], comp[i]={A[i], -i};
	sort(comp+1, comp+n+1);
	for (int i=1; i<=n; i++) A[-comp[i].second]=i;
	// cerr<<"A: ";for (int i=1; i<=n; i++) cerr<<A[i]<<" \n"[i==n];
	Build(1, 1, n+1);
	for (int ii=1; ii<=n; ii++){
		int i=-comp[ii].second;
		Set(1, 1, n+1, i, 0);
		/*
		int dwn=0, up=i;
		while (up-dwn>1){
			int mid=(dwn+up)>>1;
			if (Get(1, 1, n+1, mid, i).ans>=k) dwn=mid;
			else up=mid;
		}*/
		int up=BS(1, 1, n+1, 1, i, seg[0]).second;
		// for (int j=up; j<i; j++) dp[i]=max(dp[i], dp[j]);
		dp[i]=seg2.Get(up, i);
		dp[i]++;
		seg2.Set(i, dp[i]);
		ans=max(ans, dp[i]);
	}
	cout<<ans<<"\n";

	return 0;
}
/*
7 1
1 6 6 2 3 5 5

6 6
100 500 200 400 600 300


*/

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 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 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 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 6 ms 772 KB Output is correct
42 Correct 7 ms 716 KB Output is correct
43 Correct 6 ms 764 KB Output is correct
44 Correct 6 ms 748 KB Output is correct
45 Correct 8 ms 752 KB Output is correct
46 Correct 7 ms 716 KB Output is correct
47 Correct 7 ms 716 KB Output is correct
48 Correct 8 ms 716 KB Output is correct
49 Correct 7 ms 716 KB Output is correct
50 Correct 7 ms 716 KB Output is correct
51 Correct 6 ms 740 KB Output is correct
52 Correct 7 ms 668 KB Output is correct
53 Correct 7 ms 720 KB Output is correct
54 Correct 7 ms 720 KB Output is correct
55 Correct 7 ms 732 KB Output is correct
56 Correct 7 ms 684 KB Output is correct
57 Correct 7 ms 772 KB Output is correct
58 Correct 6 ms 716 KB Output is correct
59 Correct 6 ms 716 KB Output is correct
60 Correct 13 ms 756 KB Output is correct
61 Correct 9 ms 764 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 23760 KB Output is correct
2 Correct 320 ms 23768 KB Output is correct
3 Correct 476 ms 23764 KB Output is correct
4 Correct 488 ms 23772 KB Output is correct
5 Correct 388 ms 23764 KB Output is correct
6 Correct 513 ms 23748 KB Output is correct
7 Correct 306 ms 23656 KB Output is correct
8 Correct 261 ms 23648 KB Output is correct
9 Correct 338 ms 23736 KB Output is correct
10 Correct 320 ms 23732 KB Output is correct
11 Correct 368 ms 23716 KB Output is correct
12 Correct 348 ms 23764 KB Output is correct
13 Correct 469 ms 23768 KB Output is correct
14 Correct 393 ms 23756 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 330 ms 23664 KB Output is correct
2 Correct 422 ms 23772 KB Output is correct
3 Correct 478 ms 23772 KB Output is correct
4 Correct 511 ms 23772 KB Output is correct
5 Correct 475 ms 23676 KB Output is correct
6 Correct 527 ms 23772 KB Output is correct
7 Correct 354 ms 23680 KB Output is correct
8 Correct 348 ms 23684 KB Output is correct
9 Correct 321 ms 23652 KB Output is correct
10 Correct 385 ms 23704 KB Output is correct
11 Correct 443 ms 23764 KB Output is correct
12 Correct 391 ms 23744 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 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 6 ms 772 KB Output is correct
42 Correct 7 ms 716 KB Output is correct
43 Correct 6 ms 764 KB Output is correct
44 Correct 6 ms 748 KB Output is correct
45 Correct 8 ms 752 KB Output is correct
46 Correct 7 ms 716 KB Output is correct
47 Correct 7 ms 716 KB Output is correct
48 Correct 8 ms 716 KB Output is correct
49 Correct 7 ms 716 KB Output is correct
50 Correct 7 ms 716 KB Output is correct
51 Correct 6 ms 740 KB Output is correct
52 Correct 7 ms 668 KB Output is correct
53 Correct 7 ms 720 KB Output is correct
54 Correct 7 ms 720 KB Output is correct
55 Correct 7 ms 732 KB Output is correct
56 Correct 7 ms 684 KB Output is correct
57 Correct 7 ms 772 KB Output is correct
58 Correct 6 ms 716 KB Output is correct
59 Correct 6 ms 716 KB Output is correct
60 Correct 13 ms 756 KB Output is correct
61 Correct 9 ms 764 KB Output is correct
62 Correct 297 ms 23760 KB Output is correct
63 Correct 320 ms 23768 KB Output is correct
64 Correct 476 ms 23764 KB Output is correct
65 Correct 488 ms 23772 KB Output is correct
66 Correct 388 ms 23764 KB Output is correct
67 Correct 513 ms 23748 KB Output is correct
68 Correct 306 ms 23656 KB Output is correct
69 Correct 261 ms 23648 KB Output is correct
70 Correct 338 ms 23736 KB Output is correct
71 Correct 320 ms 23732 KB Output is correct
72 Correct 368 ms 23716 KB Output is correct
73 Correct 348 ms 23764 KB Output is correct
74 Correct 469 ms 23768 KB Output is correct
75 Correct 393 ms 23756 KB Output is correct
76 Correct 330 ms 23664 KB Output is correct
77 Correct 422 ms 23772 KB Output is correct
78 Correct 478 ms 23772 KB Output is correct
79 Correct 511 ms 23772 KB Output is correct
80 Correct 475 ms 23676 KB Output is correct
81 Correct 527 ms 23772 KB Output is correct
82 Correct 354 ms 23680 KB Output is correct
83 Correct 348 ms 23684 KB Output is correct
84 Correct 321 ms 23652 KB Output is correct
85 Correct 385 ms 23704 KB Output is correct
86 Correct 443 ms 23764 KB Output is correct
87 Correct 391 ms 23744 KB Output is correct
88 Correct 499 ms 23764 KB Output is correct
89 Correct 524 ms 23764 KB Output is correct
90 Correct 636 ms 23768 KB Output is correct
91 Correct 495 ms 23764 KB Output is correct
92 Correct 409 ms 23768 KB Output is correct
93 Correct 465 ms 23684 KB Output is correct
94 Correct 533 ms 23772 KB Output is correct
95 Correct 474 ms 23872 KB Output is correct
96 Correct 580 ms 23768 KB Output is correct
97 Correct 528 ms 23768 KB Output is correct
98 Correct 509 ms 23772 KB Output is correct
99 Correct 498 ms 23764 KB Output is correct
100 Correct 495 ms 23764 KB Output is correct
101 Correct 337 ms 23656 KB Output is correct
102 Correct 397 ms 23736 KB Output is correct
103 Correct 354 ms 23792 KB Output is correct
104 Correct 359 ms 23800 KB Output is correct
105 Correct 489 ms 23772 KB Output is correct
106 Correct 434 ms 23684 KB Output is correct
107 Correct 495 ms 23720 KB Output is correct
108 Correct 547 ms 23744 KB Output is correct
109 Correct 517 ms 23768 KB Output is correct
110 Correct 490 ms 23768 KB Output is correct
111 Correct 532 ms 23764 KB Output is correct
112 Correct 417 ms 23700 KB Output is correct
113 Correct 491 ms 23864 KB Output is correct
114 Correct 475 ms 23772 KB Output is correct
115 Correct 327 ms 23740 KB Output is correct
116 Correct 350 ms 23720 KB Output is correct
117 Correct 365 ms 23720 KB Output is correct
118 Correct 362 ms 23732 KB Output is correct
119 Correct 441 ms 23772 KB Output is correct
120 Correct 444 ms 23768 KB Output is correct