제출 #1038598

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1038598		PM1	Watermelon (INOI20_watermelon)	C++17	100 / 100	94 ms	38488 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define ll long long
const int mxn=1e5+5,szz=(1<<20);
int n,a[mxn],b[mxn],k,L[mxn],R[mxn],sz[mxn],mx[mxn];
vector<int>g[mxn],par[mxn];
set<int>s;
void solve(int m){
	if(s.size()==0 && m<n+1){
		cout<<-1;
		exit(0);
	}
	if(m==n+1){
		k--;
		if(k==0){
			for(int i=1;i<=n;i++)
				cout<<a[i]<<" ";
			cout<<'\n';
			exit(0);	
		}
		return ;
	}
	vector<int>v;
	for(auto i:s){
		v.push_back(i);
		if(v.size()==10)
			break;
	}
	for(auto i:v){
		a[i]=m;
		s.erase(i);
		for(auto j:par[i]){
			sz[j]--;
			if(sz[j]==0)
				s.insert(j);
		}
	
		solve(m+1);

		s.insert(i);
		for(auto j:par[i]){
			sz[j]++;
			if(sz[j]==1)
				s.erase(j);
		}
	}

}
struct segment{
	int val[szz];
	void build(int id,int L,int R){
		if(L+1==R){
			val[id]=b[L];
			return ;
		}
		int mid=(L+R)>>1;
		build(id*2,L,mid);
		build(id*2+1,mid,R);
		val[id]=max(val[id*2],val[id*2+1]);
	}
	int get(int id,int L,int R,int l,int r){
		if(L>=r || l>=R)
			return 0;
		if(l<=L && R<=r)
			return val[id];
		int mid=(L+R)>>1;
		return max(get(id*2,L,mid,l,r),get(id*2+1,mid,R,l,r));
	}
}seg;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>k;
	int cnt=0;
	vector<int>hey;
	for(int i=1;i<=n;i++){
		cin>>b[i];
	}
	if(b[n]!=-1){
		cout<<-1;
		return 0;
	}
	for(int i=n;i>=1;i--){
		if(b[i]==-1){
			b[i]=n+cnt;
			cnt++;
		}
	}
	vector<int>v;
	for(int i=1;i<=n;i++){
		while(v.size() && b[v.back()]<b[i]){
			v.pop_back();
		}
		if(v.size())
			L[i]=v.back();
		v.push_back(i);
	}
	v.clear();
	for(int i=n;i>=1;i--){
		while(v.size() && b[v.back()]<b[i]){
			v.pop_back();
		}
		if(v.size())
			R[i]=v.back();
		v.push_back(i);
	}
	for(int i=1;i<=n;i++){
		if(L[i]!=0 && b[L[i]]>b[i]){
			par[i].push_back(L[i]);
			g[L[i]].push_back(i);
			mx[L[i]]=max(mx[L[i]],b[i]);
		}
		if(R[i]!=0){
			par[i].push_back(R[i]);
			g[R[i]].push_back(i);
		}
	}
	for(int i=1;i<=n;i++){
	//	cout<<L[i]<<" "<<R[i]<<'\n';
		if(b[i]<n && mx[i]+1!=b[i]){
			cout<<-1;
			return 0;
		}
	}
	for(int i=1;i<=n;i++){
		sz[i]=g[i].size();
		if(sz[i]==0)
			s.insert(i);
	}
	solve(1);
	cout<<-1;
	return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 25 / 25
• Subtask 3: 31 / 31
• Subtask 4: 18 / 18
• Subtask 5: 19 / 19