oj.uz

Submission #573675

# Submission time Handle Problem Language Result Execution time Memory
573675 2022-06-07T04:55:31 Z pavement Stranded Far From Home (BOI22_island) C++17
0 / 100
 434 ms 64492 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, M, link[200005], sz[200005], mrk[200005], S[200005], off[200005];
vector<int> adj[200005], nodes[200005];
map<int, vector<int> > vec;

int find(int x) {
	if (x == link[x]) return x;
	return link[x] = find(link[x]);
}

void unite(int a, int b) {
	a = find(a);
	b = find(b);
	if (a == b) return;
	if (sz[b] > sz[a]) swap(a, b);
	sz[a] += sz[b];
	S[a] += S[b];
	for (int i : nodes[b]) {
		mrk[i] += off[b] - off[a];
		nodes[a].pb(i);
	}
	link[b] = a;
}

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M;
	for (int i = 1; i <= N; i++) {
		cin >> S[i];
		link[i] = i;
		sz[i] = 1;
		nodes[i].pb(i);
		vec[S[i]].pb(i);
	}
	for (int i = 1, u, v; i <= M; i++) {
		cin >> u >> v;
		if (S[v] <= S[u]) adj[u].pb(v);
		if (S[u] <= S[v]) adj[v].pb(u);
	}
	for (auto it = vec.begin(); it != vec.end(); ++it) {
		++it;
		int nxt = (it == vec.end() ? -1ll : it->first);
		--it;
		set<int> ss;
		for (auto i : it->second)
			for (int j : adj[i])
				unite(i, j);
		for (auto i : it->second)
			ss.insert(find(i));
		for (auto i : ss)
			if (S[i] < nxt) off[i]++;
	}
	for (int i = 1; i <= N; i++)
		cout << (mrk[i] + off[find(i)] > 0 ? '0' : '1');
	cout << '\n';
}

Compilation message

island.cpp:52:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main() {
      | ^~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9752 KB Output is correct
3 Correct 205 ms 53308 KB Output is correct
4 Correct 144 ms 33524 KB Output is correct
5 Incorrect 236 ms 58816 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 35.0

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