oj.uz

Submission #492302

# Submission time Handle Problem Language Result Execution time Memory
492302 2021-12-06T14:50:48 Z mosiashvililuka Financial Report (JOI21_financial) C++14
100 / 100
 726 ms 18788 KB 
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,f[300009],dp[300009],D,pas,seg[1200009],SEG[1200009],seg2[1200009],za,l,r,z,zz,F[300009];
int se[1200009],se2[1200009];
pair <int, int> p[300009];
void pushdown(int q, int w, int rr){
	if(q!=w){
		seg2[rr*2]+=seg2[rr];
		seg2[rr*2+1]+=seg2[rr];
	}
	seg[rr]+=seg2[rr];seg2[rr]=0;
}
void upd(int q, int w, int rr){
	pushdown(q,w,rr);
	if(q>r||w<l) return;
	if(q>=l&&w<=r){
		seg2[rr]+=z;
		pushdown(q,w,rr);
		return;
	}
	upd(q,(q+w)/2,rr*2);
	upd((q+w)/2+1,w,rr*2+1);
	if(seg[rr*2+1]>=seg[rr*2]){
		seg[rr]=seg[rr*2+1];SEG[rr]=SEG[rr*2+1];
	}else{
		seg[rr]=seg[rr*2];SEG[rr]=SEG[rr*2];
	}
}
void read(int q, int w, int rr){
	pushdown(q,w,rr);
	if(q>r||w<l) return;
	if(q>=l&&w<=r){
		if(z<seg[rr]){
			z=seg[rr];zz=SEG[rr];
		}else{
			if(z==seg[rr]){
				zz=max(zz,SEG[rr]);
			}
		}
		return;
	}
	read(q,(q+w)/2,rr*2);
	read((q+w)/2+1,w,rr*2+1);
}
void UPD(int rr){
	if(rr==0) return;
	se[rr]=max(se[rr*2],se[rr*2+1]);
	UPD(rr/2);
}
void READ(int q, int w, int rr){
	if(q>r||w<l) return;
	if(q>=l&&w<=r){
		z=max(z,se[rr]);
		return;
	}
	READ(q,(q+w)/2,rr*2);
	READ((q+w)/2+1,w,rr*2+1);
}
int main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>a>>D;
	for(i=1; i<=a; i++){
		cin>>f[i];
	}
	za=1;
	while(za<a) za*=2;
	for(i=1; i<=a; i++){
		p[i].first=f[i];p[i].second=-i;
	}
	sort(p+1,p+a+1);
	//
	for(i=1; i<=a; i++){
		seg[za+i-1]=0;SEG[za+i-1]=i;
	}
	for(i=1; i<=a; i++){
		l=max(i-D+1,1);r=i;z=1;
		upd(1,za,1);
	}
	for(ii=1; ii<=a; ii++){
		i=-p[ii].second;
		if(i>D){
			l=1;r=i-D;z=0;zz=0;
			read(1,za,1);
			if(z!=D){
				F[i]=1;
			}else{
				F[i]=zz;
			}
		}else{
			F[i]=1;
		}
		l=max(i-D+1,1);r=i;z=-1;
		upd(1,za,1);
	}
	
	//
	for(ii=1; ii<=a; ii++){
		i=-p[ii].second;
		l=F[i];r=i-1;z=0;
		READ(1,za,1);
		dp[i]=z+1;
		se[za+i-1]=dp[i];
		UPD((za+i-1)/2);
	}
	for(i=1; i<=a; i++){
		pas=max(pas,dp[i]);
	}
	/*for(i=1; i<=a; i++){
		cout<<dp[i]<<" ";
	}
	cout<<"\n";*/
	cout<<pas;
	return 0;
}

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 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 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 0 ms 332 KB Output is correct
11 Correct 0 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 0 ms 332 KB Output is correct
16 Correct 1 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 0 ms 328 KB Output is correct
23 Correct 0 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 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 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 0 ms 332 KB Output is correct
11 Correct 0 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 0 ms 332 KB Output is correct
16 Correct 1 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 0 ms 328 KB Output is correct
23 Correct 0 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 320 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 320 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 316 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 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 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 0 ms 332 KB Output is correct
11 Correct 0 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 0 ms 332 KB Output is correct
16 Correct 1 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 0 ms 328 KB Output is correct
23 Correct 0 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 320 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 320 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 316 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 716 KB Output is correct
42 Correct 7 ms 812 KB Output is correct
43 Correct 6 ms 784 KB Output is correct
44 Correct 7 ms 656 KB Output is correct
45 Correct 9 ms 808 KB Output is correct
46 Correct 5 ms 716 KB Output is correct
47 Correct 6 ms 716 KB Output is correct
48 Correct 7 ms 716 KB Output is correct
49 Correct 8 ms 716 KB Output is correct
50 Correct 8 ms 724 KB Output is correct
51 Correct 6 ms 716 KB Output is correct
52 Correct 8 ms 716 KB Output is correct
53 Correct 6 ms 816 KB Output is correct
54 Correct 8 ms 716 KB Output is correct
55 Correct 8 ms 716 KB Output is correct
56 Correct 12 ms 712 KB Output is correct
57 Correct 8 ms 716 KB Output is correct
58 Correct 5 ms 716 KB Output is correct
59 Correct 5 ms 716 KB Output is correct
60 Correct 8 ms 716 KB Output is correct
61 Correct 7 ms 716 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 15836 KB Output is correct
2 Correct 333 ms 15876 KB Output is correct
3 Correct 384 ms 15772 KB Output is correct
4 Correct 424 ms 15940 KB Output is correct
5 Correct 368 ms 15888 KB Output is correct
6 Correct 420 ms 15872 KB Output is correct
7 Correct 291 ms 15704 KB Output is correct
8 Correct 284 ms 18632 KB Output is correct
9 Correct 308 ms 18684 KB Output is correct
10 Correct 297 ms 18640 KB Output is correct
11 Correct 352 ms 18772 KB Output is correct
12 Correct 369 ms 18648 KB Output is correct
13 Correct 395 ms 18656 KB Output is correct
14 Correct 387 ms 18576 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 15868 KB Output is correct
2 Correct 295 ms 18588 KB Output is correct
3 Correct 338 ms 18564 KB Output is correct
4 Correct 313 ms 18616 KB Output is correct
5 Correct 305 ms 18628 KB Output is correct
6 Correct 337 ms 18580 KB Output is correct
7 Correct 241 ms 18644 KB Output is correct
8 Correct 238 ms 18672 KB Output is correct
9 Correct 257 ms 18508 KB Output is correct
10 Correct 296 ms 18528 KB Output is correct
11 Correct 318 ms 18644 KB Output is correct
12 Correct 294 ms 18660 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 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 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 0 ms 332 KB Output is correct
11 Correct 0 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 0 ms 332 KB Output is correct
16 Correct 1 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 0 ms 328 KB Output is correct
23 Correct 0 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 320 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 320 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 316 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 716 KB Output is correct
42 Correct 7 ms 812 KB Output is correct
43 Correct 6 ms 784 KB Output is correct
44 Correct 7 ms 656 KB Output is correct
45 Correct 9 ms 808 KB Output is correct
46 Correct 5 ms 716 KB Output is correct
47 Correct 6 ms 716 KB Output is correct
48 Correct 7 ms 716 KB Output is correct
49 Correct 8 ms 716 KB Output is correct
50 Correct 8 ms 724 KB Output is correct
51 Correct 6 ms 716 KB Output is correct
52 Correct 8 ms 716 KB Output is correct
53 Correct 6 ms 816 KB Output is correct
54 Correct 8 ms 716 KB Output is correct
55 Correct 8 ms 716 KB Output is correct
56 Correct 12 ms 712 KB Output is correct
57 Correct 8 ms 716 KB Output is correct
58 Correct 5 ms 716 KB Output is correct
59 Correct 5 ms 716 KB Output is correct
60 Correct 8 ms 716 KB Output is correct
61 Correct 7 ms 716 KB Output is correct
62 Correct 303 ms 15836 KB Output is correct
63 Correct 333 ms 15876 KB Output is correct
64 Correct 384 ms 15772 KB Output is correct
65 Correct 424 ms 15940 KB Output is correct
66 Correct 368 ms 15888 KB Output is correct
67 Correct 420 ms 15872 KB Output is correct
68 Correct 291 ms 15704 KB Output is correct
69 Correct 284 ms 18632 KB Output is correct
70 Correct 308 ms 18684 KB Output is correct
71 Correct 297 ms 18640 KB Output is correct
72 Correct 352 ms 18772 KB Output is correct
73 Correct 369 ms 18648 KB Output is correct
74 Correct 395 ms 18656 KB Output is correct
75 Correct 387 ms 18576 KB Output is correct
76 Correct 252 ms 15868 KB Output is correct
77 Correct 295 ms 18588 KB Output is correct
78 Correct 338 ms 18564 KB Output is correct
79 Correct 313 ms 18616 KB Output is correct
80 Correct 305 ms 18628 KB Output is correct
81 Correct 337 ms 18580 KB Output is correct
82 Correct 241 ms 18644 KB Output is correct
83 Correct 238 ms 18672 KB Output is correct
84 Correct 257 ms 18508 KB Output is correct
85 Correct 296 ms 18528 KB Output is correct
86 Correct 318 ms 18644 KB Output is correct
87 Correct 294 ms 18660 KB Output is correct
88 Correct 453 ms 18560 KB Output is correct
89 Correct 455 ms 18568 KB Output is correct
90 Correct 484 ms 18780 KB Output is correct
91 Correct 480 ms 18568 KB Output is correct
92 Correct 460 ms 18640 KB Output is correct
93 Correct 593 ms 18684 KB Output is correct
94 Correct 413 ms 18544 KB Output is correct
95 Correct 433 ms 18624 KB Output is correct
96 Correct 445 ms 18636 KB Output is correct
97 Correct 627 ms 18568 KB Output is correct
98 Correct 678 ms 18564 KB Output is correct
99 Correct 726 ms 18576 KB Output is correct
100 Correct 532 ms 18552 KB Output is correct
101 Correct 327 ms 18576 KB Output is correct
102 Correct 333 ms 18628 KB Output is correct
103 Correct 405 ms 18644 KB Output is correct
104 Correct 435 ms 18628 KB Output is correct
105 Correct 483 ms 18616 KB Output is correct
106 Correct 401 ms 18628 KB Output is correct
107 Correct 454 ms 18596 KB Output is correct
108 Correct 519 ms 18788 KB Output is correct
109 Correct 419 ms 18536 KB Output is correct
110 Correct 517 ms 18632 KB Output is correct
111 Correct 450 ms 18628 KB Output is correct
112 Correct 451 ms 18568 KB Output is correct
113 Correct 539 ms 18648 KB Output is correct
114 Correct 617 ms 18568 KB Output is correct
115 Correct 233 ms 18632 KB Output is correct
116 Correct 229 ms 18568 KB Output is correct
117 Correct 352 ms 18756 KB Output is correct
118 Correct 346 ms 18596 KB Output is correct
119 Correct 436 ms 18640 KB Output is correct
120 Correct 426 ms 18620 KB Output is correct