oj.uz

Submission #319236

# Submission time Handle Problem Language Result Execution time Memory
319236 2020-11-04T14:39:22 Z kshitij_sodani Money (IZhO17_money) C++14
45 / 100
 1500 ms 217176 KB 
#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'
int n;
int it[1000001];
int tree[1000001*4];
int mi[1000001][20];
void build(int no,int l,int r){
	if(l==r){
		tree[no]=it[l];
	}
	else{
		int 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]);
	}
}
int query(int no,int l,int r,int aa,int bb){
	if(r<aa){
		return -1;
	}
	if(aa<=l){
		if(tree[no]<=bb){
			return -1;
		}
		if(l==r){
			return l;
		}
	}
	int mid=(l+r)/2;
	int x=query(no*2+1,l,mid,aa,bb);
	if(x==-1){
		return query(no*2+2,mid+1,r,aa,bb);
	}
	else{
		return x;
	}
}
vector<int> pre[1000001];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	for(int i=0;i<n;i++){
		for(int j=0;j<20;j++){
			mi[i][j]=1;
		}
	}
	for(int i=0;i<n;i++){
		cin>>it[i];
	}
	vector<pair<int,int>> ss;
	vector<pair<pair<int,int>,int>> tt;
	set<int> kk;
	build(0,0,n-1);
	int cur=0;
	for(int i=0;i<n;i++){
		while(ss.size()){
			if(ss.back().a<=it[i]){
				ss.pop_back();
			}
			else{
				break;
			}
		}
		if(ss.size()){
			int ne=ss.back().b;
			tt.pb({{ne,i-1},cur});
			cur++;
			int jj=*kk.upper_bound(it[i]);
			int low=query(0,0,n-1,i,jj);
			if(low!=-1){
				tt.pb({{i,low-1},cur});
				cur++;
			}
		}
		kk.insert(it[i]);
		ss.pb({it[i],i});
	}
	for(auto j:tt){
		pre[j.a.b].pb(j.a.a);
	}
	int ans=1;
	
	int ma=-1;
	for(int i=0;i<n-1;i++){
		for(auto j:pre[i]){
			if(j<=ma){
				continue;
			}
			ans+=1;
			ma=i;
		}
	}
	cout<<ans<<endl;
 
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23788 KB Output is correct
2 Correct 16 ms 23788 KB Output is correct
3 Correct 17 ms 23936 KB Output is correct
4 Correct 16 ms 23788 KB Output is correct
5 Correct 17 ms 23788 KB Output is correct
6 Correct 16 ms 23788 KB Output is correct
7 Correct 16 ms 23788 KB Output is correct
8 Correct 17 ms 23788 KB Output is correct
9 Correct 17 ms 23788 KB Output is correct
10 Correct 17 ms 23788 KB Output is correct
11 Correct 17 ms 23788 KB Output is correct
12 Correct 17 ms 23788 KB Output is correct
13 Correct 17 ms 23788 KB Output is correct
14 Correct 16 ms 23788 KB Output is correct
15 Correct 17 ms 23808 KB Output is correct
16 Correct 17 ms 23788 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23788 KB Output is correct
2 Correct 16 ms 23788 KB Output is correct
3 Correct 17 ms 23936 KB Output is correct
4 Correct 16 ms 23788 KB Output is correct
5 Correct 17 ms 23788 KB Output is correct
6 Correct 16 ms 23788 KB Output is correct
7 Correct 16 ms 23788 KB Output is correct
8 Correct 17 ms 23788 KB Output is correct
9 Correct 17 ms 23788 KB Output is correct
10 Correct 17 ms 23788 KB Output is correct
11 Correct 17 ms 23788 KB Output is correct
12 Correct 17 ms 23788 KB Output is correct
13 Correct 17 ms 23788 KB Output is correct
14 Correct 16 ms 23788 KB Output is correct
15 Correct 17 ms 23808 KB Output is correct
16 Correct 17 ms 23788 KB Output is correct
17 Correct 16 ms 23788 KB Output is correct
18 Correct 17 ms 23788 KB Output is correct
19 Correct 16 ms 23916 KB Output is correct
20 Correct 17 ms 23800 KB Output is correct
21 Correct 16 ms 23788 KB Output is correct
22 Correct 17 ms 23788 KB Output is correct
23 Correct 18 ms 23916 KB Output is correct
24 Correct 16 ms 23788 KB Output is correct
25 Correct 16 ms 23788 KB Output is correct
26 Correct 17 ms 23788 KB Output is correct
27 Correct 17 ms 23916 KB Output is correct
28 Correct 17 ms 23948 KB Output is correct
29 Correct 17 ms 23916 KB Output is correct
30 Correct 16 ms 23916 KB Output is correct
31 Correct 17 ms 23916 KB Output is correct
32 Correct 17 ms 23916 KB Output is correct
33 Correct 17 ms 23916 KB Output is correct
34 Correct 16 ms 23916 KB Output is correct
35 Correct 17 ms 23916 KB Output is correct
36 Correct 17 ms 23916 KB Output is correct
37 Correct 17 ms 23916 KB Output is correct
38 Correct 17 ms 23916 KB Output is correct
39 Correct 225 ms 89780 KB Output is correct
40 Correct 398 ms 138012 KB Output is correct
41 Correct 167 ms 76740 KB Output is correct
42 Correct 190 ms 74424 KB Output is correct
43 Correct 138 ms 58696 KB Output is correct
44 Correct 472 ms 164808 KB Output is correct
45 Correct 459 ms 162548 KB Output is correct
46 Correct 477 ms 164636 KB Output is correct
47 Correct 298 ms 135748 KB Output is correct
48 Correct 369 ms 152244 KB Output is correct
49 Correct 1029 ms 185624 KB Output is correct
50 Correct 1008 ms 182296 KB Output is correct
51 Correct 1042 ms 186528 KB Output is correct
52 Correct 1000 ms 182292 KB Output is correct
53 Correct 1026 ms 184348 KB Output is correct
54 Correct 992 ms 182424 KB Output is correct
55 Execution timed out 1611 ms 217176 KB Time limit exceeded
56 Halted 0 ms 0 KB -