제출 #640587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
640587		CattlemansRanch	Stranded Far From Home (BOI22_island)	C++14	0 / 100	53 ms	8028 KiB

island

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int MAXN=1000005;
pii arr[MAXN];
bool ada[MAXN];
int par[MAXN],sz[MAXN],zero[MAXN],h[MAXN];
long long pref[MAXN];

int find(int x){
	if(par[x]==x)return par[x];
	return par[x]=find(par[x]);
}

void join(int u,int v){
	int repu=find(u),repv=find(v);
	par[repu]=repv;
	sz[repv]+=sz[repu];
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int n,m;
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		cin >> h[i];
		arr[i]={h[i],i};
		par[i]=i;
		sz[i]=1;
		pref[i]=pref[i-1]+h[i];
	}
	sort(arr+1,arr+n+1);
	for(int i=1;i<=n;i++){
		pii isi=arr[i];
		int kiri=0,kanan=0;
		if(ada[isi.second-1]){
			kiri=sz[find(isi.second-1)];
			join(isi.second,isi.second-1);
		}
		if(ada[isi.second+1]){
			kanan=sz[find(isi.second+1)];
			join(isi.second,isi.second+1);
		}
		ada[isi.second]=true;
		int L=i-kiri,R=i+kanan;
		if(L==1 && R==n)continue;
		long long people=pref[R]-pref[L-1];
		bool dominate=false;
		if(L-1>=1){
			if(h[L-1]<=people)dominate=true;
		}
		if(R+1<=n){
			if(h[R+1]<=people)dominate=true;
		}
		if(!dominate){
			zero[L]++;
			zero[R+1]--;
		}
	}
	for(int i=1;i<=n;i++)zero[i]+=zero[i-1];
	for(int i=1;i<=n;i++){
		if(zero[i])cout << '0';
		else cout << '1';
	}
	cout << '\n';
	return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 30
• Subtask 5: 0 / 35