oj.uz

답안 #388408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
388408 2021-04-11T11:39:09 Z morato 늑대인간 (IOI18_werewolf) C++17
100 / 100
 1280 ms 212888 KB 
#include <bits/stdc++.h>
#include "werewolf.h"

using namespace std;

const int MAXL = 20;
const int INF = 1e9;
const int MAXN = 4e5 + 5;

class FenwickTree
{
	public:

		FenwickTree(int _n = MAXN - 1) {
			n = _n;
			for (int i = 0; i <= n; i++) {
				bit[i] = 0;
			}
		}

		void update(int x, int val) {
			for (; x <= n; x += x & -x)
				bit[x] += val;
		}

		int query(int x) {
			int ans = 0;
			for (; x > 0; x -= x & -x) 
				ans += bit[x];
			return ans;
		}

	private:

		int n;

		int bit[MAXN];

} bit;

class KRT
{
	public:

		KRT(int _n = 0): n(_n) {
			curTimer = 0;
			for (int i = 1; i <= n; i++) {
				p[i] = i;
			}
		}

		void init(int _n) {
			n = _n;
			for (int i = 1; i <= n; i++) {
				p[i] = i;
			}
		}

		int getTin(int v) { return tin[v]; }
		int getTout(int v) { return tout[v]; }
		int getRoot(int v) { return p[v] == v ? v : p[v] = getRoot(p[v]); }

		void addEdge(int v, int u, int w, int flag) {
			v = getRoot(v);
			u = getRoot(u);
			if (u == v) return;
			++n;
			p[n] = p[u] = p[v] = n;
			adj[n].push_back(v);
			adj[n].push_back(u);
			anc[v][0] = anc[u][0] = {n, w};
            anc[n][0] = make_pair(n, (flag ? 0 : INF));
		}

		void dfs(int cur) {
			tin[cur] = ++curTimer;
			for (int viz : adj[cur]) {
				dfs(viz);
			}
			tout[cur] = curTimer;
		}

		int get(int a, int b, int flag) {
			return flag ? max(a, b) : min(a, b);
		}

		void buildKRT(int flag) {
			for (int d = 1; d < MAXL; d++) {
				for (int i = 1; i <= n; i++) {
					auto mid = anc[i][d - 1];
					auto target = anc[mid.first][d - 1];
					anc[i][d] = {target.first, get(mid.second, target.second, flag)};
				}
			}
			dfs(n);
		}

		bool compare(int limit, int value, int flag) {
			return flag ? limit >= value : limit <= value;
		}

		int goUp(int v, int limit, int flag) {
			for (int j = MAXL - 1; j >= 0; j--) {
				if (compare(limit, anc[v][j].second, flag)) {
					v = anc[v][j].first;
				}
			}
			return v;
		}

	private:

		int n;
		int curLen;
		int curTimer;

		int p[MAXN];
		int tin[MAXN];
		int tout[MAXN];

		vector<int> adj[MAXN];

		pair<int, int> anc[MAXN][MAXL];

} krtMin, krtMax;

struct Event
{
	int tipo, idx;
	int x, y;

	Event() {}

	Event(int _t, int _i, int _x, int _y): tipo(_t), idx(_i), x(_x), y(_y) {}

	bool operator <(const Event &e) const {
		if (x == e.x) return tipo < e.tipo;
		return x < e.x;
	}
};

vector<int> check_validity(int N, vector<int> X, vector<int> Y, vector<int> S, vector<int> E, vector<int> L, vector<int> R) {
	int n = N;
	krtMin.init(n);
	krtMax.init(n);
	vector<pair<int, pair<int, int>>> edges[2];
	int m = (int) X.size();
	for (int i = 0; i < m; i++) {
		X[i]++, Y[i]++;
		edges[0].push_back(make_pair(min(X[i], Y[i]), make_pair(X[i], Y[i])));
		edges[1].push_back(make_pair(max(X[i], Y[i]), make_pair(X[i], Y[i])));
	}
	for (int i : {0, 1}) {
		sort(edges[i].begin(), edges[i].end());
	}
    reverse(edges[0].begin(), edges[0].end());
	for (int i = 0; i < m; i++) {
		int w = edges[0][i].first;
		int v = edges[0][i].second.first;
		int u = edges[0][i].second.second;
		krtMin.addEdge(v, u, w, 0);
	}
	for (int i = 0; i < m; i++) {
		int w = edges[1][i].first;
		int v = edges[1][i].second.first;
		int u = edges[1][i].second.second;
		krtMax.addEdge(v, u, w, 1);
	}
	krtMin.buildKRT(0);
	krtMax.buildKRT(1);
	int q = (int) S.size();
	vector<Event> sweep;
	for (int i = 1; i <= n; i++) {
		int x = krtMax.getTin(i);
		int y = krtMin.getTin(i);
		sweep.emplace_back(0, -1, x, y);
	}
	vector<int> ans(q);
	for (int i = 0; i < q; i++) {
		S[i]++, E[i]++, L[i]++, R[i]++;
		int maxHuman = krtMin.goUp(S[i], L[i], 0);
		int maxWerewolf = krtMax.goUp(E[i], R[i], 1);
		int y1 = krtMin.getTin(maxHuman);
		int y2 = krtMin.getTout(maxHuman);
		int x1 = krtMax.getTin(maxWerewolf);
		int x2 = krtMax.getTout(maxWerewolf);
		sweep.emplace_back(1, i, x1 - 1, y2);
		sweep.emplace_back(1, i, x2, y1 - 1);
		sweep.emplace_back(2, i, x1 - 1, y1 - 1);
		sweep.emplace_back(2, i, x2, y2);
	}
	sort(sweep.begin(), sweep.end());
	for (auto event : sweep) {
		if (event.tipo == 0) {
			bit.update(event.y, 1);
		} else if (event.tipo == 1) {
			ans[event.idx] -= bit.query(event.y);
		} else {
			ans[event.idx] += bit.query(event.y);
		}
	}
	for (int& x : ans) {
		x = !!x;
	}
	return ans;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 145988 KB Output is correct
2 Correct 63 ms 145864 KB Output is correct
3 Correct 73 ms 145848 KB Output is correct
4 Correct 63 ms 145856 KB Output is correct
5 Correct 63 ms 145940 KB Output is correct
6 Correct 63 ms 145840 KB Output is correct
7 Correct 65 ms 145880 KB Output is correct
8 Correct 64 ms 145860 KB Output is correct
9 Correct 64 ms 145916 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 145988 KB Output is correct
2 Correct 63 ms 145864 KB Output is correct
3 Correct 73 ms 145848 KB Output is correct
4 Correct 63 ms 145856 KB Output is correct
5 Correct 63 ms 145940 KB Output is correct
6 Correct 63 ms 145840 KB Output is correct
7 Correct 65 ms 145880 KB Output is correct
8 Correct 64 ms 145860 KB Output is correct
9 Correct 64 ms 145916 KB Output is correct
10 Correct 82 ms 146848 KB Output is correct
11 Correct 72 ms 146796 KB Output is correct
12 Correct 73 ms 146928 KB Output is correct
13 Correct 71 ms 146960 KB Output is correct
14 Correct 71 ms 146912 KB Output is correct
15 Correct 72 ms 147012 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 992 ms 200296 KB Output is correct
2 Correct 1165 ms 205084 KB Output is correct
3 Correct 1060 ms 201992 KB Output is correct
4 Correct 978 ms 200708 KB Output is correct
5 Correct 968 ms 200664 KB Output is correct
6 Correct 984 ms 200380 KB Output is correct
7 Correct 998 ms 200372 KB Output is correct
8 Correct 1059 ms 205072 KB Output is correct
9 Correct 888 ms 202016 KB Output is correct
10 Correct 803 ms 200764 KB Output is correct
11 Correct 845 ms 200720 KB Output is correct
12 Correct 862 ms 200520 KB Output is correct
13 Correct 1210 ms 205112 KB Output is correct
14 Correct 1215 ms 205076 KB Output is correct
15 Correct 1187 ms 205008 KB Output is correct
16 Correct 1232 ms 205124 KB Output is correct
17 Correct 947 ms 200512 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 145988 KB Output is correct
2 Correct 63 ms 145864 KB Output is correct
3 Correct 73 ms 145848 KB Output is correct
4 Correct 63 ms 145856 KB Output is correct
5 Correct 63 ms 145940 KB Output is correct
6 Correct 63 ms 145840 KB Output is correct
7 Correct 65 ms 145880 KB Output is correct
8 Correct 64 ms 145860 KB Output is correct
9 Correct 64 ms 145916 KB Output is correct
10 Correct 82 ms 146848 KB Output is correct
11 Correct 72 ms 146796 KB Output is correct
12 Correct 73 ms 146928 KB Output is correct
13 Correct 71 ms 146960 KB Output is correct
14 Correct 71 ms 146912 KB Output is correct
15 Correct 72 ms 147012 KB Output is correct
16 Correct 992 ms 200296 KB Output is correct
17 Correct 1165 ms 205084 KB Output is correct
18 Correct 1060 ms 201992 KB Output is correct
19 Correct 978 ms 200708 KB Output is correct
20 Correct 968 ms 200664 KB Output is correct
21 Correct 984 ms 200380 KB Output is correct
22 Correct 998 ms 200372 KB Output is correct
23 Correct 1059 ms 205072 KB Output is correct
24 Correct 888 ms 202016 KB Output is correct
25 Correct 803 ms 200764 KB Output is correct
26 Correct 845 ms 200720 KB Output is correct
27 Correct 862 ms 200520 KB Output is correct
28 Correct 1210 ms 205112 KB Output is correct
29 Correct 1215 ms 205076 KB Output is correct
30 Correct 1187 ms 205008 KB Output is correct
31 Correct 1232 ms 205124 KB Output is correct
32 Correct 947 ms 200512 KB Output is correct
33 Correct 1117 ms 201536 KB Output is correct
34 Correct 590 ms 189436 KB Output is correct
35 Correct 1234 ms 204968 KB Output is correct
36 Correct 1042 ms 201164 KB Output is correct
37 Correct 1197 ms 204060 KB Output is correct
38 Correct 1107 ms 201928 KB Output is correct
39 Correct 1154 ms 209760 KB Output is correct
40 Correct 1239 ms 212740 KB Output is correct
41 Correct 1008 ms 203300 KB Output is correct
42 Correct 889 ms 201228 KB Output is correct
43 Correct 1257 ms 211332 KB Output is correct
44 Correct 1122 ms 204140 KB Output is correct
45 Correct 1028 ms 210128 KB Output is correct
46 Correct 1042 ms 209736 KB Output is correct
47 Correct 1232 ms 205356 KB Output is correct
48 Correct 1221 ms 205012 KB Output is correct
49 Correct 1204 ms 205248 KB Output is correct
50 Correct 1217 ms 205132 KB Output is correct
51 Correct 1226 ms 212888 KB Output is correct
52 Correct 1280 ms 212856 KB Output is correct