oj.uz

Submission #984237

# Submission time Handle Problem Language Result Execution time Memory
984237 2024-05-16T11:56:38 Z OAleksa Stranded Far From Home (BOI22_island) C++14
0 / 100
 147 ms 29960 KB 
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N = 2e5 + 69;
int n, m, a[N], p[N], sz[N], sum[N], vis[N], ans[N];
vector<int> g[N], can[N];
int root(int v) {
	if (p[v] == v)
		return v;
	return p[v] = root(p[v]);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n >> m;
  	for (int i = 1;i <= n;i++) {
  		cin >> a[i];
  		p[i] = i, sz[i] = 1;
  		sum[i] = a[i];
  		can[i].push_back(i);
  	}
  	vector<tuple<int, int, int>> edges;
  	for (int i = 1;i <= m;i++) {
  		int x, y;
  		cin >> x >> y;
  		g[x].push_back(y);
  		g[y].push_back(x);
  		int c = max(a[x], a[y]);
  		edges.push_back({c, x, y});
  	}   
  	sort(edges.begin(), edges.end());
  	for (auto u : edges) {
  		int a, b, c;
  		tie(c, a, b) = u;
  		int x = root(a);
  		int y = root(b);
  		if (x != y) {
  			if (sum[x] >= c && sum[y] >= c) {
  				if (sz[x] < sz[y])
  					swap(x, y);
  				for (auto j : can[y])
  					can[x].push_back(j);
  				p[y] = x;
  				sz[x] += sz[y];
  				sum[x] += sum[y];
  			}
  			else if (sum[x] >= c) {
  				p[y] = x;
  				sum[x] += sum[y];
  				sz[x] += sz[y];
  			}
  			else {
  				//assert(sum[y] >= c);
  				p[x] = y;
  				sum[y] += sum[x];
  				sz[y] += sz[x];
  			}
  		}
  	}
  	// int ok = 1;
  	// for (int i = 2;i <= n;i++)
  	// 	ok &= (root(i) == root(i - 1));
  	// assert(ok);
  	for (auto j : can[root(1)])
  		ans[j] = 1;
  	for (int i = 1;i <= n;i++)
  		cout << ans[i];
  	cout << '\n';
  }
  return 0; 
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Incorrect 3 ms 12892 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Incorrect 124 ms 29960 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Incorrect 147 ms 29428 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Incorrect 128 ms 29380 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Incorrect 3 ms 12892 KB Output isn't correct
5 Halted 0 ms 0 KB -