Submission #867989

#	Time	Username	Problem	Language	Result	Execution time	Memory
867989		TAhmed33	Stranded Far From Home (BOI22_island)	C++98	0 / 100	4 ms	604 KiB

island

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e3 + 25;
vector <int> adj[MAXN];
int cnt[MAXN];
bool vis[MAXN];
int sze;
int main () {
	int n, m;
	cin >> n >> m;
	int l = 0;
	for (int i = 1; i <= n; i++) cin >> cnt[i], l += cnt[i];
	for (int i = 1; i <= m; i++) {
		int a, b;
		cin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	for (int i = 1; i <= n; i++) {
		sort(adj[i].begin(), adj[i].end(), [&] (int &a, int &b) {
			return cnt[a] < cnt[b];
		});
	}
	for (int i = 1; i <= n; i++) {
		sze = cnt[i]; memset(vis, 0, sizeof(vis));
		set <pair <int, int>> dd; vis[i] = 1;
		for (auto j : adj[i]) dd.insert({cnt[j], j});
		while (!dd.empty()) {
			auto g = *(dd.begin());
			if (g.first > sze) break;
			sze += g.first;
			dd.erase(g); vis[g.second] = 1;
			for (auto j : adj[g.second]) {
				if (!vis[j]) dd.insert({cnt[j], j});
			}
		}
		cout << (sze == l);
	}
	cout << '\n';
}

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