oj.uz

Submission #465641

# Submission time Handle Problem Language Result Execution time Memory
465641 2021-08-16T15:40:21 Z mariowong Financial Report (JOI21_financial) C++14
100 / 100
 532 ms 25816 KB 
#include <bits/stdc++.h>
 
using namespace std;

int n,d,ct,a[300005],seg[1200005],ans,now,indx[300005],nw[300005];
deque <int> dq;
vector <pair<int,int>  > v; 
priority_queue <pair<int,int>  > pq,del,mn;
void update(int id,int l,int r,int pos,int v){
	if (l == r)
	seg[id]=v;
	else
	{
		int mid=(l+r)/2;
		if (pos <= mid) update(id*2,l,mid,pos,v);
		else update(id*2+1,mid+1,r,pos,v);	
		seg[id]=max(seg[id*2],seg[id*2+1]);
	}
}
int query(int id,int l,int r,int x,int y){
	if (x <= l && y >= r)
	return seg[id];
	if (l > y || r < x)
	return -1;
	int mid=(l+r)/2;
	return max(query(id*2,l,mid,x,y),query(id*2+1,mid+1,r,x,y));
}
void debug(int id,int l,int r){
	cerr << seg[id] << " " << l << " " << r << "\n";
	if (l != r){
		int mid=(l+r)/2;
		debug(id*2,l,mid);
		debug(id*2+1,mid+1,r);	
	}
}
int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	cin >> n >> d;
	for (int i=1;i<=n;i++){
		cin >> a[i];
		indx[i]=n+1;
		v.push_back(make_pair(a[i],i));
	}
	sort(v.begin(),v.end());
	for (int i=0;i<n;i++){
		if (i == 0 || v[i].first != v[i-1].first) ct++;
		a[v[i].second]=ct;
	}
	for (int i=1;i<=n;i++){
		mn.push(make_pair(-a[i],i));
		while (!mn.empty() && i-mn.top().second >= d){
			mn.pop();
		}
		while (!del.empty() && -del.top().first < -mn.top().first){
			indx[del.top().second]=i+1;
			del.pop();
		}
		if (i >= d)
		del.push(make_pair(-a[i-d+1],i-d+1));
	}
/*	for (int i=1;i<=n;i++){
		cerr << a[i] << " ";
	}
	cerr << "\n";
	for (int i=1;i<=n;i++){
		cerr << indx[i] << " ";
	}
	cerr << "\n";*/
	for (int i=1;i<=n;i++){
		while (!pq.empty() && -pq.top().first == i){
			if (-pq.top().first == nw[pq.top().second])
			update(1,0,ct,pq.top().second,0);
			pq.pop(); 
		}
	//	if (i == 8)
	//	debug(1,0,ct);
	//	if (i == 8)
	//	cerr << query(1,0,ct,a[i],a[i]) << " " << query(1,0,ct,0,4) << "\n";
		now=max(query(1,0,ct,a[i],a[i]),query(1,0,ct,0,a[i]-1)+1);
		update(1,0,ct,a[i],now);
	//	cerr <<i <<  " --- " << now << "\n";
		ans=max(ans,now);
		pq.push(make_pair(-indx[i],a[i]));
		nw[a[i]]=indx[i];
	//	cout << a[i] << " " << i << " " << now << "\n";
	}
	cout << ans << "\n";
	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 1 ms 316 KB Output is correct
7 Correct 0 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 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 320 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 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 1 ms 332 KB Output is correct
24 Correct 1 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 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 1 ms 316 KB Output is correct
7 Correct 0 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 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 320 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 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 1 ms 332 KB Output is correct
24 Correct 1 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 336 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 324 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 1 ms 316 KB Output is correct
7 Correct 0 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 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 320 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 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 1 ms 332 KB Output is correct
24 Correct 1 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 336 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 324 KB Output is correct
41 Correct 6 ms 588 KB Output is correct
42 Correct 8 ms 680 KB Output is correct
43 Correct 5 ms 548 KB Output is correct
44 Correct 6 ms 588 KB Output is correct
45 Correct 5 ms 716 KB Output is correct
46 Correct 6 ms 716 KB Output is correct
47 Correct 8 ms 588 KB Output is correct
48 Correct 8 ms 676 KB Output is correct
49 Correct 8 ms 716 KB Output is correct
50 Correct 9 ms 716 KB Output is correct
51 Correct 7 ms 588 KB Output is correct
52 Correct 10 ms 588 KB Output is correct
53 Correct 7 ms 588 KB Output is correct
54 Correct 7 ms 588 KB Output is correct
55 Correct 7 ms 844 KB Output is correct
56 Correct 6 ms 844 KB Output is correct
57 Correct 6 ms 844 KB Output is correct
58 Correct 5 ms 716 KB Output is correct
59 Correct 5 ms 716 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 5 ms 816 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 16068 KB Output is correct
2 Correct 194 ms 6968 KB Output is correct
3 Correct 231 ms 6840 KB Output is correct
4 Correct 418 ms 11052 KB Output is correct
5 Correct 363 ms 13232 KB Output is correct
6 Correct 413 ms 13308 KB Output is correct
7 Correct 278 ms 13256 KB Output is correct
8 Correct 256 ms 23500 KB Output is correct
9 Correct 294 ms 13232 KB Output is correct
10 Correct 318 ms 19968 KB Output is correct
11 Correct 381 ms 13372 KB Output is correct
12 Correct 409 ms 13256 KB Output is correct
13 Correct 388 ms 13308 KB Output is correct
14 Correct 430 ms 13312 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 13808 KB Output is correct
2 Correct 157 ms 13740 KB Output is correct
3 Correct 225 ms 13828 KB Output is correct
4 Correct 354 ms 19100 KB Output is correct
5 Correct 318 ms 18952 KB Output is correct
6 Correct 337 ms 19008 KB Output is correct
7 Correct 246 ms 18348 KB Output is correct
8 Correct 239 ms 18348 KB Output is correct
9 Correct 260 ms 18448 KB Output is correct
10 Correct 296 ms 18680 KB Output is correct
11 Correct 367 ms 19032 KB Output is correct
12 Correct 300 ms 18948 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 1 ms 316 KB Output is correct
7 Correct 0 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 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 320 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 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 1 ms 332 KB Output is correct
24 Correct 1 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 336 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 324 KB Output is correct
41 Correct 6 ms 588 KB Output is correct
42 Correct 8 ms 680 KB Output is correct
43 Correct 5 ms 548 KB Output is correct
44 Correct 6 ms 588 KB Output is correct
45 Correct 5 ms 716 KB Output is correct
46 Correct 6 ms 716 KB Output is correct
47 Correct 8 ms 588 KB Output is correct
48 Correct 8 ms 676 KB Output is correct
49 Correct 8 ms 716 KB Output is correct
50 Correct 9 ms 716 KB Output is correct
51 Correct 7 ms 588 KB Output is correct
52 Correct 10 ms 588 KB Output is correct
53 Correct 7 ms 588 KB Output is correct
54 Correct 7 ms 588 KB Output is correct
55 Correct 7 ms 844 KB Output is correct
56 Correct 6 ms 844 KB Output is correct
57 Correct 6 ms 844 KB Output is correct
58 Correct 5 ms 716 KB Output is correct
59 Correct 5 ms 716 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 5 ms 816 KB Output is correct
62 Correct 101 ms 16068 KB Output is correct
63 Correct 194 ms 6968 KB Output is correct
64 Correct 231 ms 6840 KB Output is correct
65 Correct 418 ms 11052 KB Output is correct
66 Correct 363 ms 13232 KB Output is correct
67 Correct 413 ms 13308 KB Output is correct
68 Correct 278 ms 13256 KB Output is correct
69 Correct 256 ms 23500 KB Output is correct
70 Correct 294 ms 13232 KB Output is correct
71 Correct 318 ms 19968 KB Output is correct
72 Correct 381 ms 13372 KB Output is correct
73 Correct 409 ms 13256 KB Output is correct
74 Correct 388 ms 13308 KB Output is correct
75 Correct 430 ms 13312 KB Output is correct
76 Correct 98 ms 13808 KB Output is correct
77 Correct 157 ms 13740 KB Output is correct
78 Correct 225 ms 13828 KB Output is correct
79 Correct 354 ms 19100 KB Output is correct
80 Correct 318 ms 18952 KB Output is correct
81 Correct 337 ms 19008 KB Output is correct
82 Correct 246 ms 18348 KB Output is correct
83 Correct 239 ms 18348 KB Output is correct
84 Correct 260 ms 18448 KB Output is correct
85 Correct 296 ms 18680 KB Output is correct
86 Correct 367 ms 19032 KB Output is correct
87 Correct 300 ms 18948 KB Output is correct
88 Correct 306 ms 9292 KB Output is correct
89 Correct 494 ms 13364 KB Output is correct
90 Correct 423 ms 11796 KB Output is correct
91 Correct 368 ms 23460 KB Output is correct
92 Correct 150 ms 20524 KB Output is correct
93 Correct 251 ms 20616 KB Output is correct
94 Correct 318 ms 20608 KB Output is correct
95 Correct 438 ms 13428 KB Output is correct
96 Correct 466 ms 14940 KB Output is correct
97 Correct 532 ms 17108 KB Output is correct
98 Correct 378 ms 23512 KB Output is correct
99 Correct 363 ms 25748 KB Output is correct
100 Correct 373 ms 25816 KB Output is correct
101 Correct 314 ms 13228 KB Output is correct
102 Correct 345 ms 13320 KB Output is correct
103 Correct 382 ms 13304 KB Output is correct
104 Correct 438 ms 13584 KB Output is correct
105 Correct 440 ms 16716 KB Output is correct
106 Correct 301 ms 23432 KB Output is correct
107 Correct 317 ms 25684 KB Output is correct
108 Correct 343 ms 23976 KB Output is correct
109 Correct 368 ms 13292 KB Output is correct
110 Correct 379 ms 20604 KB Output is correct
111 Correct 382 ms 21552 KB Output is correct
112 Correct 300 ms 21480 KB Output is correct
113 Correct 335 ms 23984 KB Output is correct
114 Correct 359 ms 23956 KB Output is correct
115 Correct 243 ms 21028 KB Output is correct
116 Correct 245 ms 20992 KB Output is correct
117 Correct 291 ms 24036 KB Output is correct
118 Correct 271 ms 24000 KB Output is correct
119 Correct 303 ms 24016 KB Output is correct
120 Correct 307 ms 24012 KB Output is correct