oj.uz

Submission #108163

# Submission time Handle Problem Language Result Execution time Memory
108163 2019-04-27T19:30:07 Z Noam527 Werewolf (IOI18_werewolf) C++17
100 / 100
 2366 ms 123432 KB 
#include <bits/stdc++.h>
#define CHECK cout << "ok" << endl
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 1e18;
const int OO = 0;
const int OOO = 1;
using namespace std;

const int mxn = 2e5 + 5;

int n;
vector<int> g[mxn];
int num[mxn];
int denum[mxn];

int good[mxn];
int root[mxn], sz[mxn];

vector<int> compv[mxn];
vector<vector<int>> ranges[mxn];
vector<pair<int, int>> roots[mxn];

set<int> comps[mxn];

vector<int> add(int v) {
	good[v] = 1;
	vector<int> rtn;
	for (const auto &i : g[v])
		if (good[i])
			rtn.push_back(i);
	return rtn;
}

void numerate() {
	vector<int> a;
	for (int i = 0; i < n; i++) {
		num[i] = good[i] = 0;
		sz[i] = 1;
		root[i] = i;
		compv[i].push_back(i);
	}
	for (int i = n - 1; i >= 0; i--) {
		a = add(i);
		for (const auto &v : a) {
			// connect v, i
			int x = root[i], y = root[v];
			if (x == y) continue;
			if (sz[x] > sz[y]) swap(x, y);
			for (const auto &u : compv[x]) {
				root[u] = y;
				num[u] += sz[y];
				compv[y].push_back(u);
			}
			sz[y] += sz[x];
			compv[x].clear();
		}
	}
	for (int i = 0; i < n; i++)
		denum[num[i]] = i;
	for (int i = 0; i < n; i++) compv[i].clear();
	// numerated. now ranges
	for (int i = 0; i < n; i++) {
		good[i] = 0;
		sz[i] = 1;
		root[i] = i;
		compv[i].push_back(i);
		ranges[i].push_back({ n, num[i], num[i] });
		roots[i].emplace_back(n, i);
	}
	for (int i = n - 1; i >= 0; i--) {
		a = add(i);
		for (const auto &v : a) {
			int x = root[i], y = root[v];
			if (x == y) continue;
			if (sz[x] > sz[y]) swap(x, y);
			for (const auto &u : compv[x]) {
				root[u] = y;
				compv[y].push_back(u);
				roots[u].emplace_back(i, y);
			}
			sz[y] += sz[x];
			compv[x].clear();
			ranges[y].push_back({ i, min(ranges[x].back()[1], ranges[y].back()[1]), max(ranges[x].back()[2], ranges[y].back()[2]) });
		}
	}
}

pair<int, int> getrange(int time, int v) {
	int lo, hi, mid;
	lo = 0, hi = (int)roots[v].size() - 1;
	while (lo < hi) {
		mid = (lo + hi + 1) / 2;
		if (roots[v][mid].first >= time) lo = mid;
		else hi = mid - 1;
	}
	v = roots[v][lo].second;

	lo = 0, hi = (int)ranges[v].size() - 1;
	while (lo < hi) {
		mid = (lo + hi + 1) / 2;
		if (ranges[v][mid][0] >= time) lo = mid;
		else hi = mid - 1;
	}
	return{ ranges[v][lo][1], ranges[v][lo][2] };
}

struct query {
	int l, r, s, e, ind;
	query() {}
	query(int ll, int rr, int ss, int ee, int ii) : l(ll), r(rr), s(ss), e(ee), ind(ii) {}
	bool operator < (const query &a) const {
		return r < a.r;
	}
};

vector<int> check_validity(int N, vector<int> X, vector<int> Y,
	vector<int> S, vector<int> E,
	vector<int> L, vector<int> R) {
	n = N;
	for (int i = 0; i < X.size(); i++) {
		g[X[i]].push_back(Y[i]);
		g[Y[i]].push_back(X[i]);
	}
	
	numerate();
	if (OO) {
		/*
		cout << "numerated: ";
		for (int i = 0; i < n; i++) cout << num[i] << " "; cout << '\n';
		while (1) {
			cout << "L, v: ";
			int tim, v;
			cin >> tim >> v;
			pair<int, int> tmp = getrange(tim, v);
			cout << "[" << tmp.first << ", " << tmp.second << "]\n";
		}
		*/
	}

	for (int i = 0; i < n; i++) {
		good[i] = 0;
		sz[i] = 1;
		root[i] = i;
		comps[i].insert(num[i]);
	}
	vector<int> a;

	int q = S.size();
	vector<int> ans(q);
	vector<query> Q(q);
	for (int i = 0; i < q; i++)
		Q[i] = query(L[i], R[i], S[i], E[i], i);
	sort(Q.begin(), Q.end());
	int nxt = 0;
	for (const auto &i : Q) {
		if (OO) {
			cout << "processing query:\n";
			cout << "(S, E, L, R) = " << i.s << " " << i.e << " " << i.l << " " << i.r << '\n';
		}
		while (nxt <= i.r) {
			a = add(nxt);
			if (OO) {
				cout << nxt << " becomes good: ";
				for (const auto &j : a) cout << j << " "; cout << '\n';
			}
			for (const auto &v : a) {
				int x = root[nxt], y = root[v];
				if (OO) cout << "merging " << nxt << " " << v << " = " << x << " " << y << '\n';
				if (x == y) continue;
				if (sz[x] > sz[y]) swap(x, y);
				for (const auto &u : comps[x]) {
					root[denum[u]] = y;
					comps[y].insert(u);
				}
				sz[y] += sz[x];
				comps[x].clear();
			}
			nxt++;
		}
		if (OO) {
			cout << "roots: ";
			for (int j = 0; j < n; j++) cout << root[j] << " "; cout << '\n';
		}
		pair<int, int> tmp = getrange(i.l, i.s);
		auto it = comps[root[i.e]].lower_bound(tmp.first);
		if (it == comps[root[i.e]].end() || tmp.second < *it) ans[i.ind] = 0;
		else ans[i.ind] = 1;
	}
	return ans;
}

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:123:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < X.size(); i++) {
                  ~~^~~~~~~~~~
werewolf.cpp:167:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for (const auto &j : a) cout << j << " "; cout << '\n';
     ^~~
werewolf.cpp:167:47: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     for (const auto &j : a) cout << j << " "; cout << '\n';
                                               ^~~~
werewolf.cpp:185:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    for (int j = 0; j < n; j++) cout << root[j] << " "; cout << '\n';
    ^~~
werewolf.cpp:185:56: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
    for (int j = 0; j < n; j++) cout << root[j] << " "; cout << '\n';
                                                        ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 28664 KB Output is correct
2 Correct 30 ms 28544 KB Output is correct
3 Correct 31 ms 28664 KB Output is correct
4 Correct 26 ms 28544 KB Output is correct
5 Correct 27 ms 28536 KB Output is correct
6 Correct 29 ms 28540 KB Output is correct
7 Correct 30 ms 28544 KB Output is correct
8 Correct 27 ms 28544 KB Output is correct
9 Correct 27 ms 28544 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 28664 KB Output is correct
2 Correct 30 ms 28544 KB Output is correct
3 Correct 31 ms 28664 KB Output is correct
4 Correct 26 ms 28544 KB Output is correct
5 Correct 27 ms 28536 KB Output is correct
6 Correct 29 ms 28540 KB Output is correct
7 Correct 30 ms 28544 KB Output is correct
8 Correct 27 ms 28544 KB Output is correct
9 Correct 27 ms 28544 KB Output is correct
10 Correct 35 ms 29788 KB Output is correct
11 Correct 36 ms 29816 KB Output is correct
12 Correct 39 ms 29944 KB Output is correct
13 Correct 35 ms 29816 KB Output is correct
14 Correct 36 ms 29820 KB Output is correct
15 Correct 38 ms 29948 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 2366 ms 122780 KB Output is correct
2 Correct 1068 ms 105460 KB Output is correct
3 Correct 959 ms 110572 KB Output is correct
4 Correct 1325 ms 115532 KB Output is correct
5 Correct 1596 ms 116356 KB Output is correct
6 Correct 2069 ms 118780 KB Output is correct
7 Correct 2274 ms 123432 KB Output is correct
8 Correct 938 ms 105580 KB Output is correct
9 Correct 901 ms 110724 KB Output is correct
10 Correct 1108 ms 115568 KB Output is correct
11 Correct 1049 ms 116076 KB Output is correct
12 Correct 1575 ms 119276 KB Output is correct
13 Correct 912 ms 107152 KB Output is correct
14 Correct 916 ms 107072 KB Output is correct
15 Correct 807 ms 107024 KB Output is correct
16 Correct 907 ms 107092 KB Output is correct
17 Correct 2183 ms 122468 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 28664 KB Output is correct
2 Correct 30 ms 28544 KB Output is correct
3 Correct 31 ms 28664 KB Output is correct
4 Correct 26 ms 28544 KB Output is correct
5 Correct 27 ms 28536 KB Output is correct
6 Correct 29 ms 28540 KB Output is correct
7 Correct 30 ms 28544 KB Output is correct
8 Correct 27 ms 28544 KB Output is correct
9 Correct 27 ms 28544 KB Output is correct
10 Correct 35 ms 29788 KB Output is correct
11 Correct 36 ms 29816 KB Output is correct
12 Correct 39 ms 29944 KB Output is correct
13 Correct 35 ms 29816 KB Output is correct
14 Correct 36 ms 29820 KB Output is correct
15 Correct 38 ms 29948 KB Output is correct
16 Correct 2366 ms 122780 KB Output is correct
17 Correct 1068 ms 105460 KB Output is correct
18 Correct 959 ms 110572 KB Output is correct
19 Correct 1325 ms 115532 KB Output is correct
20 Correct 1596 ms 116356 KB Output is correct
21 Correct 2069 ms 118780 KB Output is correct
22 Correct 2274 ms 123432 KB Output is correct
23 Correct 938 ms 105580 KB Output is correct
24 Correct 901 ms 110724 KB Output is correct
25 Correct 1108 ms 115568 KB Output is correct
26 Correct 1049 ms 116076 KB Output is correct
27 Correct 1575 ms 119276 KB Output is correct
28 Correct 912 ms 107152 KB Output is correct
29 Correct 916 ms 107072 KB Output is correct
30 Correct 807 ms 107024 KB Output is correct
31 Correct 907 ms 107092 KB Output is correct
32 Correct 2183 ms 122468 KB Output is correct
33 Correct 1718 ms 109064 KB Output is correct
34 Correct 319 ms 52600 KB Output is correct
35 Correct 1659 ms 104036 KB Output is correct
36 Correct 1870 ms 109904 KB Output is correct
37 Correct 1754 ms 104404 KB Output is correct
38 Correct 2135 ms 108628 KB Output is correct
39 Correct 1999 ms 112056 KB Output is correct
40 Correct 1638 ms 112768 KB Output is correct
41 Correct 1454 ms 104836 KB Output is correct
42 Correct 1493 ms 110160 KB Output is correct
43 Correct 1682 ms 104420 KB Output is correct
44 Correct 1775 ms 104344 KB Output is correct
45 Correct 1488 ms 108460 KB Output is correct
46 Correct 1839 ms 112272 KB Output is correct
47 Correct 940 ms 107372 KB Output is correct
48 Correct 908 ms 107052 KB Output is correct
49 Correct 918 ms 107092 KB Output is correct
50 Correct 895 ms 106956 KB Output is correct
51 Correct 1564 ms 113728 KB Output is correct
52 Correct 1484 ms 113756 KB Output is correct