oj.uz

Submission #440605

# Submission time Handle Problem Language Result Execution time Memory
440605 2021-07-02T14:06:17 Z ogibogi2004 Financial Report (JOI21_financial) C++14
100 / 100
 654 ms 15548 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXN=3e5+6;
set<pair<int,int> >s;
int n,d;
int a[MAXN],k[MAXN];
int tree[4*MAXN];
void update(int l,int r,int idx,int q,int val)
{
	if(l>q)return;
	if(r<q)return;
	if(l==r)
	{
		tree[idx]=val;
		return;
	}
	int mid=(l+r)/2;
	update(l,mid,idx*2,q,val);
	update(mid+1,r,idx*2+1,q,val);
	tree[idx]=max(tree[idx*2],tree[idx*2+1]);
}
int query(int l,int r,int idx,int ql,int qr)
{
	if(l>qr)return 0;
	if(r<ql)return 0;
	if(l>=ql&&r<=qr)return tree[idx];
	int mid=(l+r)/2;
	return max(query(l,mid,idx*2,ql,qr),query(mid+1,r,idx*2+1,ql,qr));
}
int maxdp=0;
int main()
{
	cin>>n>>d;
	vector<pair<int,int> >v;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		v.push_back({a[i],-i});
	}
	sort(v.begin(),v.end());
	for(int i=0;i<v.size();i++)
	{
		int t=-v[i].second;
		//cout<<"%% "<<t<<endl;
		auto it=s.lower_bound({t,-1});
		if(it!=s.begin())
		{
			it--;
			if((*it).second>=t)
			{
				k[t]=(*it).second+d;
				continue;
			}
		}
		it=s.lower_bound({t,-1});
		bool flag1=0,flag2=0;
		int l1,r1,l2,r2;
		if(it!=s.end()&&(*it).first-t<=d)
		{
			l2=(*it).first;
			r2=(*it).second;
			flag1=1;
		}
		if(it!=s.begin())
		{
			it--;
			if(t-(*it).second<=d)
			{
				l1=(*it).first;
				r1=(*it).second;
				flag2=1;
			}
		}
		if(flag1&&flag2)
		{
			k[t]=r2+d;
			s.erase({l1,r1});
			s.erase({l2,r2});
			s.insert({l1,r2});
		}
		else if(flag2)
		{
			k[t]=t+d;
			s.erase({l1,r1});
			s.insert({l1,t});
		}
		else if(flag1)
		{
			k[t]=r2+d;
			s.erase({l2,r2});
			s.insert({t,r2});
		}
		else
		{
			k[t]=t+d;
			s.insert({t,t});
		}
		/*for(auto xd:s)
		{
			cout<<xd.first<<" "<<xd.second<<endl;
		}*/
	}
	reverse(v.begin(),v.end());
	for(int i=0;i<v.size();i++)
	{
		int idx=-v[i].second;
		k[idx]=min(k[idx],n);
		int dp=query(1,n,1,idx,k[idx])+1;
		maxdp=max(maxdp,dp);
		//cout<<idx<<" "<<k[idx]<<" "<<dp<<endl;
		update(1,n,1,idx,dp);
	}
	cout<<maxdp<<endl;
return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:41:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for(int i=0;i<v.size();i++)
      |              ~^~~~~~~~~
Main.cpp:104:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |  for(int i=0;i<v.size();i++)
      |              ~^~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 284 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 284 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 13 ms 504 KB Output is correct
42 Correct 11 ms 536 KB Output is correct
43 Correct 7 ms 548 KB Output is correct
44 Correct 7 ms 460 KB Output is correct
45 Correct 6 ms 460 KB Output is correct
46 Correct 7 ms 436 KB Output is correct
47 Correct 9 ms 452 KB Output is correct
48 Correct 7 ms 480 KB Output is correct
49 Correct 7 ms 496 KB Output is correct
50 Correct 7 ms 460 KB Output is correct
51 Correct 8 ms 512 KB Output is correct
52 Correct 9 ms 460 KB Output is correct
53 Correct 6 ms 460 KB Output is correct
54 Correct 7 ms 460 KB Output is correct
55 Correct 7 ms 452 KB Output is correct
56 Correct 9 ms 552 KB Output is correct
57 Correct 7 ms 460 KB Output is correct
58 Correct 6 ms 440 KB Output is correct
59 Correct 8 ms 460 KB Output is correct
60 Correct 8 ms 460 KB Output is correct
61 Correct 6 ms 460 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 9144 KB Output is correct
2 Correct 432 ms 15084 KB Output is correct
3 Correct 553 ms 15512 KB Output is correct
4 Correct 616 ms 15548 KB Output is correct
5 Correct 510 ms 14560 KB Output is correct
6 Correct 654 ms 15532 KB Output is correct
7 Correct 310 ms 12112 KB Output is correct
8 Correct 299 ms 12028 KB Output is correct
9 Correct 300 ms 12108 KB Output is correct
10 Correct 311 ms 12004 KB Output is correct
11 Correct 488 ms 12328 KB Output is correct
12 Correct 517 ms 12324 KB Output is correct
13 Correct 457 ms 12016 KB Output is correct
14 Correct 567 ms 12236 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 315 ms 9128 KB Output is correct
2 Correct 380 ms 12088 KB Output is correct
3 Correct 427 ms 12124 KB Output is correct
4 Correct 382 ms 12200 KB Output is correct
5 Correct 370 ms 12256 KB Output is correct
6 Correct 405 ms 12216 KB Output is correct
7 Correct 304 ms 12096 KB Output is correct
8 Correct 291 ms 12056 KB Output is correct
9 Correct 292 ms 12052 KB Output is correct
10 Correct 323 ms 11992 KB Output is correct
11 Correct 370 ms 12128 KB Output is correct
12 Correct 354 ms 12124 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 284 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 13 ms 504 KB Output is correct
42 Correct 11 ms 536 KB Output is correct
43 Correct 7 ms 548 KB Output is correct
44 Correct 7 ms 460 KB Output is correct
45 Correct 6 ms 460 KB Output is correct
46 Correct 7 ms 436 KB Output is correct
47 Correct 9 ms 452 KB Output is correct
48 Correct 7 ms 480 KB Output is correct
49 Correct 7 ms 496 KB Output is correct
50 Correct 7 ms 460 KB Output is correct
51 Correct 8 ms 512 KB Output is correct
52 Correct 9 ms 460 KB Output is correct
53 Correct 6 ms 460 KB Output is correct
54 Correct 7 ms 460 KB Output is correct
55 Correct 7 ms 452 KB Output is correct
56 Correct 9 ms 552 KB Output is correct
57 Correct 7 ms 460 KB Output is correct
58 Correct 6 ms 440 KB Output is correct
59 Correct 8 ms 460 KB Output is correct
60 Correct 8 ms 460 KB Output is correct
61 Correct 6 ms 460 KB Output is correct
62 Correct 293 ms 9144 KB Output is correct
63 Correct 432 ms 15084 KB Output is correct
64 Correct 553 ms 15512 KB Output is correct
65 Correct 616 ms 15548 KB Output is correct
66 Correct 510 ms 14560 KB Output is correct
67 Correct 654 ms 15532 KB Output is correct
68 Correct 310 ms 12112 KB Output is correct
69 Correct 299 ms 12028 KB Output is correct
70 Correct 300 ms 12108 KB Output is correct
71 Correct 311 ms 12004 KB Output is correct
72 Correct 488 ms 12328 KB Output is correct
73 Correct 517 ms 12324 KB Output is correct
74 Correct 457 ms 12016 KB Output is correct
75 Correct 567 ms 12236 KB Output is correct
76 Correct 315 ms 9128 KB Output is correct
77 Correct 380 ms 12088 KB Output is correct
78 Correct 427 ms 12124 KB Output is correct
79 Correct 382 ms 12200 KB Output is correct
80 Correct 370 ms 12256 KB Output is correct
81 Correct 405 ms 12216 KB Output is correct
82 Correct 304 ms 12096 KB Output is correct
83 Correct 291 ms 12056 KB Output is correct
84 Correct 292 ms 12052 KB Output is correct
85 Correct 323 ms 11992 KB Output is correct
86 Correct 370 ms 12128 KB Output is correct
87 Correct 354 ms 12124 KB Output is correct
88 Correct 564 ms 13976 KB Output is correct
89 Correct 573 ms 13484 KB Output is correct
90 Correct 474 ms 12432 KB Output is correct
91 Correct 434 ms 12184 KB Output is correct
92 Correct 324 ms 12100 KB Output is correct
93 Correct 423 ms 12024 KB Output is correct
94 Correct 378 ms 12128 KB Output is correct
95 Correct 497 ms 13672 KB Output is correct
96 Correct 472 ms 12572 KB Output is correct
97 Correct 453 ms 12128 KB Output is correct
98 Correct 449 ms 12040 KB Output is correct
99 Correct 397 ms 12140 KB Output is correct
100 Correct 406 ms 12192 KB Output is correct
101 Correct 296 ms 12008 KB Output is correct
102 Correct 303 ms 12120 KB Output is correct
103 Correct 323 ms 12120 KB Output is correct
104 Correct 336 ms 12064 KB Output is correct
105 Correct 390 ms 12040 KB Output is correct
106 Correct 312 ms 12040 KB Output is correct
107 Correct 333 ms 12096 KB Output is correct
108 Correct 374 ms 12136 KB Output is correct
109 Correct 428 ms 12120 KB Output is correct
110 Correct 391 ms 12184 KB Output is correct
111 Correct 410 ms 12052 KB Output is correct
112 Correct 348 ms 12124 KB Output is correct
113 Correct 373 ms 12260 KB Output is correct
114 Correct 361 ms 12128 KB Output is correct
115 Correct 316 ms 12072 KB Output is correct
116 Correct 277 ms 12132 KB Output is correct
117 Correct 303 ms 12072 KB Output is correct
118 Correct 358 ms 12296 KB Output is correct
119 Correct 349 ms 12124 KB Output is correct
120 Correct 317 ms 12276 KB Output is correct