제출 #1122194

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122194		vjudge1	Stranded Far From Home (BOI22_island)	C++17	0 / 100	184 ms	32784 KiB

island

#include<bits/stdc++.h>
#define pb push_back
#define pf push_front
#define mp make_pair
#define F first
#define S second
#define ff first
#define ss second
#define str string
#define ll long long
#define ull unsigned ll
#define ld long double
#define pll pair<ll,ll>
#define plll pair<pll,ll>
#define pllll pair<pll,pll>
#define pii pair<int,int>
#define pld pair<ld,ld>
#define vl vector<ll>
#define vll vector<pll>
#define vlll vector<plll>
#define vllll vector<pllll>
#define vb vector<bool>
#define vi vector<int>
#define vii vector<pii>
#define sz(x) (ll)(x).size()
#define fr front()
#define tp top()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bk back();
#pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
using namespace std;
const ld pi=acos(-1.0);
const ll e5=1e5;
const ll e6=1e6;
const ll e9=1e9;
const ll inf=1e18;
const ll mod=1e9+7;
const ll mod2=998244353;
const ll MOD=106710087877475399;
const ll N=2e5+10;
const ll M=1e6+10;
const ld eps=1e-9;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll bpm(ll x,ll y,ll m){if(y==0)return 1%m;ll p=bpm(x,y/2,m);
if(y%2==0)return p*p%m;else return p*p%m*x%m;}
ll bp(ll x,ll y){if(y==0)return 1;ll p=bp(x,y/2);
if(y%2==0)return p*p;else return p*p*x;}
ll n,m,a[N],s[N],p[N];
vl g[N];
bool u[N];
vl st[N];
ll get(ll v){
    if(v==p[v]) return v;
    return p[v]=get(p[v]);
}
void mrg(ll a,ll b){
    a=get(a), b=get(b);
    if(sz(st[a])<sz(st[b])) swap(a,b);
    s[a]+=s[b];
    s[b]=0;
    p[b]=a;
    for(ll x:st[b]) st[a].pb(x);
    st[b].clear();
}
void solve(){
    cin>>n>>m;
    vll vt;
    for(ll i=1;i<=n;i++){
        cin>>a[i];
        vt.pb({a[i],i});
        p[i]=i;
    }
    for(ll i=1;i<=m;i++){
        ll a,b; cin>>a>>b;
        g[a].pb(b);
        g[b].pb(a);
    }
    sort(all(vt));
    for(auto [x,v]:vt){
        st[v].pb(v);
        u[v]=1; s[v]=a[v];
        set<ll> gr;
        for(ll to:g[v]){
            gr.insert(get(to));
        }
        vl mr={v};
        //cout<<v<<' '<<s[v]<<"  ";
        for(ll to:gr){
            //cout<<to<<' '<<s[to]<<"  ";
            if(s[to]<a[v]){
                for(ll x:st[to]) u[x]=0;
            }
            mr.pb(to);
        }
        for(ll i=1;i<sz(mr);i++){
            mrg(mr[i-1],mr[i]);
        }
        //cout<<s[get(v)]<<'\n';
    }
    for(ll i=1;i<=n;i++) cout<<u[i];
    return;
}
int main(/*Aldk*/){
    ios_base::sync_with_stdio(false);  cin.tie(NULL);
    //freopen("01.in", "r", stdin);
    //freopen("01.out ", "w", stdout);
    //cout<<setprecision(6)<<fixed;
    int test=1;
    //cin>>test;
    for(int i=1;i<=test;i++){
        solve();
        cout<<'\n';
    }
    return 0;
}

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