oj.uz

Submission #984185

# Submission time Handle Problem Language Result Execution time Memory
984185 2024-05-16T11:13:57 Z OAleksa Stranded Far From Home (BOI22_island) C++14
0 / 100
 154 ms 30264 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);
  	}
  	for (int i = 1;i <= m;i++) {
  		int a, b;
  		cin >> a >> b;
  		g[a].push_back(b);
  		g[b].push_back(a);
  	}   
  	vector<int> ord(n);
  	iota(ord.begin(), ord.end(), 1);
  	sort(ord.begin(), ord.end(), [&](int i, int j) {
  		return a[i] < a[j];
  	});
  	for (int j = 0;j < n;j++) {
  		int i = ord[j];
  		vis[i] = 1;
  		for (auto u : g[i]) {
				if (vis[u]) {
  				int x = root(u);
  				int y = root(i);
  				int ok = 0;
  				if (x != y) {
  					if (sum[x] >= a[i])
  						ok = 1;
  					if (sz[x] < sz[y]) {
  						swap(x, y);
  					}
  					else
  						swap(can[y], can[x]);
  					p[y] = x;
  					sz[x] += sz[y];
  					sum[x] += sum[y];
  					if (ok) {
  						for (auto t : can[y])
  							can[x].push_back(t);
  					}
  				}
  			}
  		}
  	}
  	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 3 ms 12952 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 12888 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 2 ms 12724 KB Output is correct
3 Incorrect 108 ms 30264 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 152 ms 28020 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 12892 KB Output is correct
2 Incorrect 154 ms 28120 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12952 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 12888 KB Output isn't correct
5 Halted 0 ms 0 KB -