제출 #654383

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
654383		erto	Stranded Far From Home (BOI22_island)	C++17	10 / 100	541 ms	105988 KiB

island

#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define INF (int)(1e9 + 7)
#define INF2 998244353
#define N (ll)(2e5 + 5)
//#define f first
//#define s second
#define int ll
#define lsb(x) (x & (-x))
using namespace std;

int n, m, g, h;
int ans[N];
set<pair<int, int>> v[N];
int a[N];
int p[N], sz[N];
bool used[N];

set<int> ss[N];

int get(int x){
    return (p[x] == x ? x : get(p[x]));
}

void unite(int x, int y){
    int a = get(x), b = get(y);
    if(a == b)return;
    if(ss[a].size() < ss[b].size())swap(a, b);
    sz[a] += sz[b];
    p[b] = a;

    for(auto u : ss[b]){
        ss[a].insert(u);
    }
}

void solve(){
    cin >> n >> m;

    int maxx=0, maxnode;

    for(int i=1; i<=n; i++){
        cin >> a[i];
        if(maxx < a[i]){
            maxx = a[i];
            maxnode = i;
        }
    }

    for(int i=1; i<=m; i++){
        cin >> g >> h;
        v[g].insert({a[h], h});
        v[h].insert({a[g], g});
    }

    priority_queue<pair<int, int>> pq;
    for(int i=1; i<=n; i++){
        pq.push({-a[i], i});
    }

    for(int i=1; i<=n; i++){
        ans[i] = 1;
        sz[i] = a[i];
        p[i] = i;
        ss[i].insert(i);
    }

    while(!pq.empty()){
        auto p = pq.top();
        pq.pop();
        int i = p.second;
        used[i] = 1;
        bool bb = 0;
        //cout << i << ' ';

        for(auto z : v[i]){
            int u = z.second; 
            if(used[u])continue;
            //if(i == 4)cout << u << a[u] << sz[get(i)] << '\n';
            //cout << i << u << sz[get(i)] << '\n';
            if(sz[get(i)] < a[u]){
                vector<int> v2;
                for(int u : ss[get(i)]){
                    if(used[u])v2.push_back(u);
                }
                for(int u : v2){
                    ans[u] = 0;
                    ss[get(i)].erase(u);
                }
            }
            unite(i, u);
            bb=1;
        }
        //cout  << i << bb<<'\n';
        if(a[i] != maxx && bb == 0)ans[i] = 0;
    }

    //for(int u : ss[get(maxnode)])ans[u] = 1;


    for(int i=1; i<=n; i++){
        cout << ans[i];
    }
}   


signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    //cin>>T;
    for(int i=1; i<=T; i++){
        solve();
    }
}

컴파일 시 표준 에러 (stderr) 메시지

island.cpp: In function 'void solve()':
island.cpp:41:17: warning: variable 'maxnode' set but not used [-Wunused-but-set-variable]
   41 |     int maxx=0, maxnode;
      |                 ^~~~~~~

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