제출 #1209718

#제출 시각아이디문제언어결과실행 시간메모리
1209718MalixStranded Far From Home (BOI22_island)C++20
100 / 100
618 ms60712 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vii; typedef pair<int,int> pi; typedef vector<pi> pii; typedef tuple<int,int,int> ti; typedef vector<ll> li; typedef vector<li> lii; #define REP(i,a,b) for(int i=a;i<b;i++) #define F first #define S second #define PB push_back #define LSOne(s) ((s)&(-s)) ll INF=1000000000000000010; int inf=1e9+10; ll M=1e9+7; int n,m; vector<set<int>> a; vi p,s; vii nd; vector<ll> b,d; string ans; int parent(int x){ if(p[x]==x)return x; return p[x]=parent(p[x]); } void merge(int x,int y){ x=parent(x); y=parent(y); if(x==y)return; if(s[x]<s[y])swap(x,y); for(auto u:nd[y])nd[x].PB(u); nd[y].clear(); s[x]+=s[y]; d[x]+=d[y]; p[y]=x; } int main() { // ios::sync_with_stdio(0); // cin.tie(0); cin>>n>>m; a.resize(n); b.resize(n); nd.resize(n); REP(i,0,n)nd[i].PB(i); REP(i,0,n)cin>>b[i]; d=b; REP(i,0,m){ int x,y;cin>>x>>y; x--;y--; a[x].insert(y); a[y].insert(x); } p.resize(n);s.resize(n,1); REP(i,0,n)p[i]=i; set<pair<ll,int>> c; REP(i,0,n)c.insert({d[i],i}); ll mx=0; REP(i,0,n)mx=max(mx,b[i]); ans.resize(n,'1'); while(!c.empty()&&c.begin()->F<mx){ ll y=c.begin()->F; int x=c.begin()->S; c.erase(c.begin()); x=parent(x); bool flag=1; REP(i,0,nd[x].size())for(auto u:a[nd[x][i]])if(parent(u)!=parent(x)){ if(b[u]<=y){ flag=0; u=parent(u); c.erase({d[u],u}); merge(u,x); } } x=parent(x); if(flag)for(auto u:nd[x])ans[u]='0'; else c.insert({d[x],x}); } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...