제출 #1166054

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1166054		fryingduc	Stranded Far From Home (BOI22_island)	C++20	0 / 100	67 ms	7088 KiB

island

#include "bits/stdc++.h"

using namespace std;

#ifdef duc_debug
#include "bits/debug.h"
#else
#define debug(...)
#endif

const int maxn = 2e5 + 5;
int n, m, a[maxn];
bool f[maxn];
long long sz[maxn];
int par[maxn];

int find(int u) {
  if (par[u] == u) return u;
  f[u] |= f[par[u]];
  return par[u] = find(par[u]);
}

void solve() {
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    sz[i] = a[i], par[i] = i;
  }
  vector<tuple<int, int, int>> edges;
  for (int i = 1; i <= m; ++i) {
    int u, v; cin >> u >> v;
    if (a[u] < a[v]) swap(u, v);
    edges.emplace_back(a[u], u, v);
  }
  sort(edges.begin(), edges.end());
  for (auto [w, u, v] : edges) {
    u = find(u), v = find(v);
    if (u == v) continue;
    if (sz[v] < a[u]) {
      f[v] = 1;
    } 
    sz[u] += sz[v];
    par[v] = u;
  }
  for (int i = 1; i <= n; ++i) {
    find(i);
    cout << (f[i] ^ 1);
  }
}

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  solve();

  return 0;
}

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