oj.uz

Submission #105948

# Submission time Handle Problem Language Result Execution time Memory
105948 2019-04-15T20:00:27 Z Anai Werewolf (IOI18_werewolf) C++14
100 / 100
 3278 ms 179476 KB 
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;

struct Query {
	int start, halt, left, right, idx; };

using pii = pair<int, int>;

const int N = 2e5 + 5;

vector<int> members[N];
map<int, int> dist[N];
int far[N], siz[N], dsu[N], up[N];
unordered_map<int, int> mp[N];

vector<Query> qs;
vector<pii> edgs;
int n, m, q;

static int get_far(int nod) {
	while (far[nod])
		nod = far[nod];
	return nod; }

static bool join(int a, int b) {
	int _up = min(a, b);
	a = get_far(a);
	b = get_far(b);

	if (a == b)
		return false;
	if (siz[b] > siz[a])
		swap(a, b);
	far[b] = a;
	up[b] = _up;
	siz[a]+= siz[b];

	return true; }

static bool magic_join(int a, int b) {
	a = dsu[a];
	b = dsu[b];
	if (a == b)
		return false;
	if (members[b].size() > members[a].size())
		swap(a, b);

	for (auto i: members[b]) {
		dsu[i] = a;
		while (i != 0) {
			auto it = mp[i].find(b);
			if (it == end(mp[i]))
				break;
			auto &ref = mp[i][a];
			ref = max(ref, it->second);
			mp[i].erase(it);
			i = far[i]; } }

	members[a].insert(end(members[a]), begin(members[b]), end(members[b]));
	members[b].clear();
	return true; }

static void build_dsu() {
	sort(begin(edgs), end(edgs), [&](const pii &a, const pii &b) {
		return min(a.x, a.y) > min(b.x, b.y); });

	for (const auto &e: edgs)
		join(e.x, e.y);

	for (int i = 1; i <= n; ++i) {
		int dist = 2e9, nod = i;
		while (nod) {
			mp[nod][i] = dist;
			dist = min(dist, up[nod]);
			nod = far[nod]; } } }

static void initialize() {
	fill(siz, siz + n + 1, 1);
	for (int i = 1; i <= n; ++i) {
		dsu[i] = i;
		mp[i].max_load_factor(0.25);
		members[i].push_back(i); } }

vector<int> check_validity(int N, vector<int> X, vector<int> Y, vector<int> S, vector<int> E, vector<int> L, vector<int> R) {
	vector<int> ant;
	int edg_ptr;
	n = N;
	q = S.size();
	m = X.size();

	qs.resize(q);
	ant.resize(q);
	edgs.resize(m);

	for (int i = 0; i < m; ++i)
		edgs[i] = {X[i] + 1, Y[i] + 1};
	for (int i = 0; i < q; ++i)
		qs[i] = {E[i] + 1, S[i] + 1, L[i] + 1, R[i] + 1, i};

	initialize();
	build_dsu();

	sort(begin(qs), end(qs), [&](const Query &a, const Query &b) { return a.right < b.right; });
	sort(begin(edgs), end(edgs), [&](const pii &a, const pii &b) {
		return max(a.x, a.y) < max(b.x, b.y); });

	edg_ptr = 0;
	for (const auto &query: qs) {
		while (edg_ptr < m && max(edgs[edg_ptr].x, edgs[edg_ptr].y) <= query.right) { // join things accessible in start form
			magic_join(edgs[edg_ptr].x, edgs[edg_ptr].y);
			++edg_ptr; }

		int halt = query.halt, start = query.start, tdist = 1e9, dist = 0;
		while (halt) {
			auto its = mp[halt].find(dsu[query.start]);

			if (its != end(mp[halt]))
				dist = max(dist, min(tdist, its->second));

			tdist = min(tdist, up[halt]);
			halt = far[halt]; }

		if (dsu[query.start] == dsu[query.halt] || dist >= query.left)
			ant[query.idx] = 1; }

	return ant; }

#ifdef HOME
int main() {
	ifstream fi("werewolf.in");
	ofstream fo("werewolf.out");
	int n, m, q;

	fi >> n >> m >> q;
	vector<int> x(m), y(m), s(q), e(q), l(q), r(q);
	for (int j = 0; j < m; ++j)
		fi >> x[j] >> y[j];

	for (int i = 0; i < q; ++i)
		fi >> s[i] >> e[i] >> l[i] >> r[i];

	vector<int> ans = check_validity(n, x, y, s, e, l, r);
	for (auto i: ans)
		fo << i << '\n';

	return 0; }
#endif

Compilation message

werewolf.cpp: In function 'std::vector<int> check_validity(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
werewolf.cpp:115:26: warning: unused variable 'start' [-Wunused-variable]
   int halt = query.halt, start = query.start, tdist = 1e9, dist = 0;
                          ^~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 25472 KB Output is correct
2 Correct 26 ms 25512 KB Output is correct
3 Correct 23 ms 25472 KB Output is correct
4 Correct 28 ms 25336 KB Output is correct
5 Correct 27 ms 25464 KB Output is correct
6 Correct 27 ms 25380 KB Output is correct
7 Correct 30 ms 25464 KB Output is correct
8 Correct 25 ms 25392 KB Output is correct
9 Correct 32 ms 25464 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 25472 KB Output is correct
2 Correct 26 ms 25512 KB Output is correct
3 Correct 23 ms 25472 KB Output is correct
4 Correct 28 ms 25336 KB Output is correct
5 Correct 27 ms 25464 KB Output is correct
6 Correct 27 ms 25380 KB Output is correct
7 Correct 30 ms 25464 KB Output is correct
8 Correct 25 ms 25392 KB Output is correct
9 Correct 32 ms 25464 KB Output is correct
10 Correct 40 ms 26880 KB Output is correct
11 Correct 42 ms 26876 KB Output is correct
12 Correct 49 ms 27388 KB Output is correct
13 Correct 35 ms 27004 KB Output is correct
14 Correct 38 ms 27128 KB Output is correct
15 Correct 41 ms 27128 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3226 ms 168716 KB Output is correct
2 Correct 841 ms 124756 KB Output is correct
3 Correct 1000 ms 135876 KB Output is correct
4 Correct 1594 ms 156340 KB Output is correct
5 Correct 1986 ms 161440 KB Output is correct
6 Correct 2703 ms 170532 KB Output is correct
7 Correct 3278 ms 179476 KB Output is correct
8 Correct 726 ms 124832 KB Output is correct
9 Correct 834 ms 136044 KB Output is correct
10 Correct 1286 ms 156988 KB Output is correct
11 Correct 1750 ms 158800 KB Output is correct
12 Correct 2166 ms 170736 KB Output is correct
13 Correct 653 ms 127472 KB Output is correct
14 Correct 619 ms 127488 KB Output is correct
15 Correct 632 ms 127420 KB Output is correct
16 Correct 718 ms 127672 KB Output is correct
17 Correct 3258 ms 175556 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 25472 KB Output is correct
2 Correct 26 ms 25512 KB Output is correct
3 Correct 23 ms 25472 KB Output is correct
4 Correct 28 ms 25336 KB Output is correct
5 Correct 27 ms 25464 KB Output is correct
6 Correct 27 ms 25380 KB Output is correct
7 Correct 30 ms 25464 KB Output is correct
8 Correct 25 ms 25392 KB Output is correct
9 Correct 32 ms 25464 KB Output is correct
10 Correct 40 ms 26880 KB Output is correct
11 Correct 42 ms 26876 KB Output is correct
12 Correct 49 ms 27388 KB Output is correct
13 Correct 35 ms 27004 KB Output is correct
14 Correct 38 ms 27128 KB Output is correct
15 Correct 41 ms 27128 KB Output is correct
16 Correct 3226 ms 168716 KB Output is correct
17 Correct 841 ms 124756 KB Output is correct
18 Correct 1000 ms 135876 KB Output is correct
19 Correct 1594 ms 156340 KB Output is correct
20 Correct 1986 ms 161440 KB Output is correct
21 Correct 2703 ms 170532 KB Output is correct
22 Correct 3278 ms 179476 KB Output is correct
23 Correct 726 ms 124832 KB Output is correct
24 Correct 834 ms 136044 KB Output is correct
25 Correct 1286 ms 156988 KB Output is correct
26 Correct 1750 ms 158800 KB Output is correct
27 Correct 2166 ms 170736 KB Output is correct
28 Correct 653 ms 127472 KB Output is correct
29 Correct 619 ms 127488 KB Output is correct
30 Correct 632 ms 127420 KB Output is correct
31 Correct 718 ms 127672 KB Output is correct
32 Correct 3258 ms 175556 KB Output is correct
33 Correct 1712 ms 132648 KB Output is correct
34 Correct 357 ms 57948 KB Output is correct
35 Correct 1425 ms 122360 KB Output is correct
36 Correct 1913 ms 134868 KB Output is correct
37 Correct 1533 ms 123148 KB Output is correct
38 Correct 1598 ms 131640 KB Output is correct
39 Correct 1635 ms 139320 KB Output is correct
40 Correct 1199 ms 136960 KB Output is correct
41 Correct 1328 ms 124564 KB Output is correct
42 Correct 1830 ms 135124 KB Output is correct
43 Correct 1071 ms 124916 KB Output is correct
44 Correct 1278 ms 123500 KB Output is correct
45 Correct 1119 ms 129544 KB Output is correct
46 Correct 1546 ms 140752 KB Output is correct
47 Correct 716 ms 127648 KB Output is correct
48 Correct 648 ms 127332 KB Output is correct
49 Correct 729 ms 127652 KB Output is correct
50 Correct 734 ms 127504 KB Output is correct
51 Correct 1153 ms 134416 KB Output is correct
52 Correct 1273 ms 134640 KB Output is correct