oj.uz

Submission #419776

# Submission time Handle Problem Language Result Execution time Memory
419776 2021-06-07T12:47:48 Z kshitij_sodani Financial Report (JOI21_financial) C++14
100 / 100
 1203 ms 56736 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
llo n,d;
llo it[300001];
llo dp[7001][7001];






llo tree[4*300001];
llo tree2[4*300001];

llo lazy[4*300001];
llo dp2[300001];
void push(llo no,llo l,llo r){
	if(lazy[no]){
		tree[no]=0;
		if(l<r){
			lazy[no*2+1]=lazy[no];
			lazy[no*2+2]=lazy[no];
		}


		lazy[no]=0;
	}

}
void build(llo no,llo l,llo r){
	if(l==r){
		tree[no]=0;
	}
	else{
		llo mid=(l+r)/2;
		build(no*2+1,l,mid);
		build(no*2+2,mid+1,r);
		tree[no]=max(tree[no*2+1],tree[no*2+2]);
	}
}
void update(llo no,llo l,llo r,llo aa,llo bb,llo j){
	push(no,l,r);
	if(r<aa or l>bb){
		return ;
	}
	if(aa<=l and r<=bb){
		if(j==0){
			lazy[no]=1;
			push(no,l,r);
		}
		else{
			tree[no]=max(tree[no],j);
		}
	}
	else{
		llo mid=(l+r)/2;
		update(no*2+1,l,mid,aa,bb,j);
		update(no*2+2,mid+1,r,aa,bb,j);
		tree[no]=max(tree[no*2+1],tree[no*2+2]);
	}
}
llo query(llo no,llo l,llo r,llo aa,llo bb){
	push(no,l,r);
	if(r<aa or l>bb){
		return 0;
	}
	if(aa<=l and r<=bb){
		return tree[no];
	}
	else{
		llo mid=(l+r)/2;
		return max(query(no*2+1,l,mid,aa,bb),query(no*2+2,mid+1,r,aa,bb));
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>d;
	llo ma=-1;
	//llo ans=0;
	map<llo,llo> sss;
	for(llo i=0;i<n;i++){
		
		cin>>it[i];
		sss[it[i]]++;
	//	dp[i][
/*		if(it[i]>ma){
			ans++;
		}
		ma=max(ma,it[i]);*/
	}
	map<llo,llo> tt;
	llo ind5=-1;
	for(auto j:sss){
		ind5++;
		tt[j.a]=ind5;
	}
	vector<pair<llo,llo>> kk;
	for(llo i=0;i<n;i++){
		it[i]=tt[it[i]];

	}

	llo ans=0;
	//build(0,0,n-1);
	/*for(llo i=0;i<n;i++){
		tree[i]={{0,n},i};
	}*/
	deque<pair<llo,llo>> xx;

	/*for(llo i=0;i<n;i++){
		cout<<it[i]<<":";
	}
	cout<<endl;*/
	for(llo i=0;i<n;i++){
		//le=i;
		while(xx.size()){
			if(xx.front().b<=i-d){
				xx.pop_front();
			}
			else{
				break;
			}
		}
		//cout<<i-d<<endl;
		while(xx.size()){
			if(xx.back().a>=it[i]){
				xx.pop_back();
			}
			else{
				break;
			}
		}
		xx.pb({it[i],i});


		/*}
		for(llo j=0;j<n;j++){
			if(tree[j].a.b<i-d){
				tree[j]={{(llo)0,n},j};
			}
		}*/
	/*	for(llo j=it[i];j<n;j++){
			tree[j].a.b=max(tree[j].a.b,i);
		}*/
		//update2(0,0,n-1,it[i],n-1,i);

		//if(it[i]>0){
			//llo x=0;
			llo x=0;
			if(it[i]>0){
				x=query(0,0,n-1,0,it[i]-1);
				/*for(llo j=0;j<it[i];j++){
					x=max(x,tree[j].a.a);
				}*/
				//x=query(0,0,n-1,0,it[i]-1);
			}
			//update(0,0,n-1,it[i],x+1);
			update(0,0,n-1,it[i],it[i],x+1);
			//tree[it[i]]=max(tree[it[i]],{{x+1,i},it[i]});
			ans=max(ans,x+1);

			if(i>=d){
				//cout<<i<<":"<<xx.front().a<<endl;
				if(xx.front().a>0){
					update(0,0,n-1,0,xx.front().a-1,0);
				}
				/*for(llo j=0;j<xx.front().a;j++){
					tree[j]={{(llo)0,n},j};
				}*/
			}
	}

	cout<<ans<<endl;
	//cout<<ans<<endl;





	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:87:6: warning: unused variable 'ma' [-Wunused-variable]
   87 |  llo ma=-1;
      |      ^~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 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 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 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 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 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 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 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 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 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 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 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 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 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 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 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 8 ms 588 KB Output is correct
42 Correct 11 ms 1520 KB Output is correct
43 Correct 4 ms 332 KB Output is correct
44 Correct 8 ms 844 KB Output is correct
45 Correct 11 ms 876 KB Output is correct
46 Correct 10 ms 1356 KB Output is correct
47 Correct 14 ms 1492 KB Output is correct
48 Correct 14 ms 1492 KB Output is correct
49 Correct 13 ms 1504 KB Output is correct
50 Correct 13 ms 1476 KB Output is correct
51 Correct 12 ms 1524 KB Output is correct
52 Correct 12 ms 1420 KB Output is correct
53 Correct 10 ms 1484 KB Output is correct
54 Correct 10 ms 1484 KB Output is correct
55 Correct 14 ms 1356 KB Output is correct
56 Correct 10 ms 1424 KB Output is correct
57 Correct 10 ms 1360 KB Output is correct
58 Correct 7 ms 1356 KB Output is correct
59 Correct 7 ms 1356 KB Output is correct
60 Correct 9 ms 1356 KB Output is correct
61 Correct 9 ms 1356 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 2720 KB Output is correct
2 Correct 255 ms 2736 KB Output is correct
3 Correct 338 ms 2776 KB Output is correct
4 Correct 977 ms 48780 KB Output is correct
5 Correct 850 ms 56612 KB Output is correct
6 Correct 1064 ms 56648 KB Output is correct
7 Correct 544 ms 56376 KB Output is correct
8 Correct 566 ms 56524 KB Output is correct
9 Correct 520 ms 56596 KB Output is correct
10 Correct 543 ms 56600 KB Output is correct
11 Correct 676 ms 56592 KB Output is correct
12 Correct 765 ms 56556 KB Output is correct
13 Correct 918 ms 56536 KB Output is correct
14 Correct 1018 ms 56616 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 2616 KB Output is correct
2 Correct 228 ms 2736 KB Output is correct
3 Correct 301 ms 3296 KB Output is correct
4 Correct 932 ms 48404 KB Output is correct
5 Correct 845 ms 48356 KB Output is correct
6 Correct 883 ms 48428 KB Output is correct
7 Correct 471 ms 53296 KB Output is correct
8 Correct 477 ms 48444 KB Output is correct
9 Correct 528 ms 48884 KB Output is correct
10 Correct 693 ms 48328 KB Output is correct
11 Correct 1090 ms 48456 KB Output is correct
12 Correct 978 ms 48448 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 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 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 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 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 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 8 ms 588 KB Output is correct
42 Correct 11 ms 1520 KB Output is correct
43 Correct 4 ms 332 KB Output is correct
44 Correct 8 ms 844 KB Output is correct
45 Correct 11 ms 876 KB Output is correct
46 Correct 10 ms 1356 KB Output is correct
47 Correct 14 ms 1492 KB Output is correct
48 Correct 14 ms 1492 KB Output is correct
49 Correct 13 ms 1504 KB Output is correct
50 Correct 13 ms 1476 KB Output is correct
51 Correct 12 ms 1524 KB Output is correct
52 Correct 12 ms 1420 KB Output is correct
53 Correct 10 ms 1484 KB Output is correct
54 Correct 10 ms 1484 KB Output is correct
55 Correct 14 ms 1356 KB Output is correct
56 Correct 10 ms 1424 KB Output is correct
57 Correct 10 ms 1360 KB Output is correct
58 Correct 7 ms 1356 KB Output is correct
59 Correct 7 ms 1356 KB Output is correct
60 Correct 9 ms 1356 KB Output is correct
61 Correct 9 ms 1356 KB Output is correct
62 Correct 137 ms 2720 KB Output is correct
63 Correct 255 ms 2736 KB Output is correct
64 Correct 338 ms 2776 KB Output is correct
65 Correct 977 ms 48780 KB Output is correct
66 Correct 850 ms 56612 KB Output is correct
67 Correct 1064 ms 56648 KB Output is correct
68 Correct 544 ms 56376 KB Output is correct
69 Correct 566 ms 56524 KB Output is correct
70 Correct 520 ms 56596 KB Output is correct
71 Correct 543 ms 56600 KB Output is correct
72 Correct 676 ms 56592 KB Output is correct
73 Correct 765 ms 56556 KB Output is correct
74 Correct 918 ms 56536 KB Output is correct
75 Correct 1018 ms 56616 KB Output is correct
76 Correct 164 ms 2616 KB Output is correct
77 Correct 228 ms 2736 KB Output is correct
78 Correct 301 ms 3296 KB Output is correct
79 Correct 932 ms 48404 KB Output is correct
80 Correct 845 ms 48356 KB Output is correct
81 Correct 883 ms 48428 KB Output is correct
82 Correct 471 ms 53296 KB Output is correct
83 Correct 477 ms 48444 KB Output is correct
84 Correct 528 ms 48884 KB Output is correct
85 Correct 693 ms 48328 KB Output is correct
86 Correct 1090 ms 48456 KB Output is correct
87 Correct 978 ms 48448 KB Output is correct
88 Correct 376 ms 2968 KB Output is correct
89 Correct 1203 ms 54536 KB Output is correct
90 Correct 630 ms 10804 KB Output is correct
91 Correct 1099 ms 49404 KB Output is correct
92 Correct 203 ms 2728 KB Output is correct
93 Correct 313 ms 3672 KB Output is correct
94 Correct 809 ms 34784 KB Output is correct
95 Correct 900 ms 56644 KB Output is correct
96 Correct 966 ms 56580 KB Output is correct
97 Correct 1061 ms 56524 KB Output is correct
98 Correct 1081 ms 49508 KB Output is correct
99 Correct 1096 ms 48612 KB Output is correct
100 Correct 1145 ms 48596 KB Output is correct
101 Correct 558 ms 56604 KB Output is correct
102 Correct 596 ms 56640 KB Output is correct
103 Correct 575 ms 55396 KB Output is correct
104 Correct 664 ms 51752 KB Output is correct
105 Correct 706 ms 49368 KB Output is correct
106 Correct 580 ms 56552 KB Output is correct
107 Correct 672 ms 56028 KB Output is correct
108 Correct 950 ms 50436 KB Output is correct
109 Correct 721 ms 56736 KB Output is correct
110 Correct 997 ms 51380 KB Output is correct
111 Correct 1016 ms 49768 KB Output is correct
112 Correct 711 ms 50032 KB Output is correct
113 Correct 968 ms 48500 KB Output is correct
114 Correct 996 ms 48444 KB Output is correct
115 Correct 425 ms 48532 KB Output is correct
116 Correct 426 ms 48336 KB Output is correct
117 Correct 464 ms 48472 KB Output is correct
118 Correct 468 ms 48468 KB Output is correct
119 Correct 709 ms 48600 KB Output is correct
120 Correct 704 ms 48364 KB Output is correct