답안 #319232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
319232 2020-11-04T14:31:56 Z kshitij_sodani Money (IZhO17_money) C++14
45 / 100
1500 ms 138980 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 vis[1000001*2];
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;
	}
}
bool cmp(pair<pair<int,int>,int> aa,pair<pair<int,int>,int> bb){
	return aa.a.b<bb.a.b;
}
vector<int> pre[1000001];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	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=i;
			for(int j=19;j>=0;j--){
				if(low+(1<<j)<n){
					if(query(0,0,n-1,i,low+(1<<j))<=jj){
						low+=(1<<j);
					}
				}
			}*/
			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});
	}
	//vector<pair<pair<int,int>,int>> mm;
	/*for(auto j:tt){
		mm.pb(j);
	}
	sort(mm.begin(),mm.end());*/
	for(auto j:tt){
		pre[j.a.b].pb(j.a.a);
	}
	//sort(tt.begin(),tt.end(),cmp);
	int ans=1;
	
	int ma=-1;
	for(int i=0;i<n-1;i++){
		//if(vis[j.b]==0){
		for(auto j:pre[i]){
			if(j<=ma){
				continue;
			}
			ans+=1;
			ma=i;
		}
		//}
	}
	cout<<ans<<endl;
 
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB Output is correct
2 Correct 16 ms 23788 KB Output is correct
3 Correct 17 ms 23788 KB Output is correct
4 Correct 16 ms 23788 KB Output is correct
5 Correct 16 ms 23916 KB Output is correct
6 Correct 16 ms 23788 KB Output is correct
7 Correct 16 ms 23788 KB Output is correct
8 Correct 16 ms 23788 KB Output is correct
9 Correct 18 ms 23788 KB Output is correct
10 Correct 19 ms 23788 KB Output is correct
11 Correct 17 ms 23788 KB Output is correct
12 Correct 16 ms 23788 KB Output is correct
13 Correct 19 ms 23780 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23788 KB Output is correct
16 Correct 17 ms 23788 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB Output is correct
2 Correct 16 ms 23788 KB Output is correct
3 Correct 17 ms 23788 KB Output is correct
4 Correct 16 ms 23788 KB Output is correct
5 Correct 16 ms 23916 KB Output is correct
6 Correct 16 ms 23788 KB Output is correct
7 Correct 16 ms 23788 KB Output is correct
8 Correct 16 ms 23788 KB Output is correct
9 Correct 18 ms 23788 KB Output is correct
10 Correct 19 ms 23788 KB Output is correct
11 Correct 17 ms 23788 KB Output is correct
12 Correct 16 ms 23788 KB Output is correct
13 Correct 19 ms 23780 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23788 KB Output is correct
16 Correct 17 ms 23788 KB Output is correct
17 Correct 16 ms 23788 KB Output is correct
18 Correct 16 ms 23788 KB Output is correct
19 Correct 16 ms 23788 KB Output is correct
20 Correct 17 ms 23788 KB Output is correct
21 Correct 17 ms 23788 KB Output is correct
22 Correct 16 ms 23788 KB Output is correct
23 Correct 17 ms 23788 KB Output is correct
24 Correct 16 ms 23788 KB Output is correct
25 Correct 16 ms 23916 KB Output is correct
26 Correct 16 ms 23788 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB Output is correct
2 Correct 16 ms 23788 KB Output is correct
3 Correct 17 ms 23788 KB Output is correct
4 Correct 16 ms 23788 KB Output is correct
5 Correct 16 ms 23916 KB Output is correct
6 Correct 16 ms 23788 KB Output is correct
7 Correct 16 ms 23788 KB Output is correct
8 Correct 16 ms 23788 KB Output is correct
9 Correct 18 ms 23788 KB Output is correct
10 Correct 19 ms 23788 KB Output is correct
11 Correct 17 ms 23788 KB Output is correct
12 Correct 16 ms 23788 KB Output is correct
13 Correct 19 ms 23780 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23788 KB Output is correct
16 Correct 17 ms 23788 KB Output is correct
17 Correct 16 ms 23788 KB Output is correct
18 Correct 16 ms 23788 KB Output is correct
19 Correct 16 ms 23788 KB Output is correct
20 Correct 17 ms 23788 KB Output is correct
21 Correct 17 ms 23788 KB Output is correct
22 Correct 16 ms 23788 KB Output is correct
23 Correct 17 ms 23788 KB Output is correct
24 Correct 16 ms 23788 KB Output is correct
25 Correct 16 ms 23916 KB Output is correct
26 Correct 16 ms 23788 KB Output is correct
27 Correct 17 ms 23916 KB Output is correct
28 Correct 17 ms 23916 KB Output is correct
29 Correct 18 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 16 ms 23916 KB Output is correct
33 Correct 17 ms 23916 KB Output is correct
34 Correct 17 ms 23936 KB Output is correct
35 Correct 16 ms 23788 KB Output is correct
36 Correct 16 ms 23916 KB Output is correct
37 Correct 16 ms 23916 KB Output is correct
38 Correct 16 ms 23916 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB Output is correct
2 Correct 16 ms 23788 KB Output is correct
3 Correct 17 ms 23788 KB Output is correct
4 Correct 16 ms 23788 KB Output is correct
5 Correct 16 ms 23916 KB Output is correct
6 Correct 16 ms 23788 KB Output is correct
7 Correct 16 ms 23788 KB Output is correct
8 Correct 16 ms 23788 KB Output is correct
9 Correct 18 ms 23788 KB Output is correct
10 Correct 19 ms 23788 KB Output is correct
11 Correct 17 ms 23788 KB Output is correct
12 Correct 16 ms 23788 KB Output is correct
13 Correct 19 ms 23780 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23788 KB Output is correct
16 Correct 17 ms 23788 KB Output is correct
17 Correct 16 ms 23788 KB Output is correct
18 Correct 16 ms 23788 KB Output is correct
19 Correct 16 ms 23788 KB Output is correct
20 Correct 17 ms 23788 KB Output is correct
21 Correct 17 ms 23788 KB Output is correct
22 Correct 16 ms 23788 KB Output is correct
23 Correct 17 ms 23788 KB Output is correct
24 Correct 16 ms 23788 KB Output is correct
25 Correct 16 ms 23916 KB Output is correct
26 Correct 16 ms 23788 KB Output is correct
27 Correct 17 ms 23916 KB Output is correct
28 Correct 17 ms 23916 KB Output is correct
29 Correct 18 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 16 ms 23916 KB Output is correct
33 Correct 17 ms 23916 KB Output is correct
34 Correct 17 ms 23936 KB Output is correct
35 Correct 16 ms 23788 KB Output is correct
36 Correct 16 ms 23916 KB Output is correct
37 Correct 16 ms 23916 KB Output is correct
38 Correct 16 ms 23916 KB Output is correct
39 Correct 193 ms 52316 KB Output is correct
40 Correct 350 ms 76188 KB Output is correct
41 Correct 149 ms 46404 KB Output is correct
42 Correct 168 ms 47676 KB Output is correct
43 Correct 120 ms 39748 KB Output is correct
44 Correct 423 ms 86428 KB Output is correct
45 Correct 405 ms 84248 KB Output is correct
46 Correct 422 ms 86400 KB Output is correct
47 Correct 240 ms 57540 KB Output is correct
48 Correct 325 ms 74056 KB Output is correct
49 Correct 955 ms 107132 KB Output is correct
50 Correct 945 ms 104008 KB Output is correct
51 Correct 996 ms 108548 KB Output is correct
52 Correct 971 ms 104072 KB Output is correct
53 Correct 940 ms 106124 KB Output is correct
54 Correct 921 ms 104012 KB Output is correct
55 Execution timed out 1597 ms 138980 KB Time limit exceeded
56 Halted 0 ms 0 KB -