oj.uz

Submission #768376

# Submission time Handle Problem Language Result Execution time Memory
768376 2023-06-28T02:52:34 Z SanguineChameleon Werewolf (IOI18_werewolf) C++17
15 / 100
 4000 ms 74344 KB 
#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;

const int maxN = 2e5 + 20;
vector<int> adj[maxN][2];
vector<pair<int, int>> ch[maxN][2];
pair<int, int> par[maxN][2];
int depth[maxN][2];
int cnt[maxN];
int root[2];
int Tin[maxN];
int Tout[maxN];
vector<vector<pair<int, pair<int, int>>>> queries[maxN];
vector<int> res;
int T;

int get_root(int u, int type) {
	if (!par[u][type].second) {
		return u;
	}
	else {
		return get_root(par[u][type].second, type);
	}
}

void update(int u, int v, int w, int type) {
	int ru = get_root(u, type);
	int rv = get_root(v, type);
	if (ru == rv) {
		return;
	}
	if (depth[ru][type] > depth[rv][type]) {
		swap(ru, rv);
	}
	ch[rv][type].emplace_back(w, ru);
	par[ru][type] = make_pair(w, rv);
	if (depth[ru][type] == depth[rv][type]) {
		depth[rv][type]++;
	}
}

void dfs1(int u) {
	Tin[u] = ++T;
	for (auto e: ch[u][1]) {
		dfs1(e.second);
	}
	Tout[u] = T;
}

void dfs2(int u) {
	cnt[Tin[u]]++;
	for (auto e: ch[u][0]) {
		dfs2(e.second);
	}
}

void add(int u, int pref) {
	cnt[Tin[u]]++;
	for (int i = 0; i < pref; i++) {
		dfs2(ch[u][0][i].second);
	}
}

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 M = X.size();
	int Q = S.size();
	for (int i = 0; i < M; i++) {
		X[i]++;
		Y[i]++;
		if (X[i] > Y[i]) {
			swap(X[i], Y[i]);
		}
		adj[X[i]][0].push_back(Y[i]);
		adj[Y[i]][1].push_back(X[i]);
	}
	for (int type = 0; type < 2; type++) {
		for (int u = (type ? 1 : N); (type ? u <= N : u >= 1); u += (type ? 1 : -1)) {
			for (auto v: adj[u][type]) {
				update(u, v, u, type);
			}
		}
		root[type] = get_root(1, type);
	}
	dfs1(root[1]);
	for (int u = 1; u <= N; u++) {
		queries[u].resize(ch[u][0].size() + 1);
	}
	res.resize(Q);
	for (int i = 0; i < Q; i++) {
		L[i]++;
		R[i]++;
		int u = S[i] + 1;
		int v = E[i] + 1;
		while (u != root[0] && par[u][0].first >= L[i]) {
			u = par[u][0].second;
		}
		int pref_u = upper_bound(ch[u][0].begin(), ch[u][0].end(), make_pair(L[i], 0), greater<pair<int, int>>()) - ch[u][0].begin();
		while (v != root[1] && par[v][1].first <= R[i]) {
			v = par[v][1].second;
		}
		int pref_v = upper_bound(ch[v][1].begin(), ch[v][1].end(), make_pair(R[i], N + 1)) - ch[v][1].begin();
		for (int j = 1; j <= N; j++) {
			cnt[j] = 0;
		}
		add(u, pref_u);
		int lt = Tin[v];
		int rt = (pref_v ? Tout[ch[v][1][pref_v - 1].second] : lt);
		for (int j = lt; j <= rt; j++) {
			if (cnt[j] == 1) {
				res[i] = 1;
				break;
			}
		}
	}
	return res;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23764 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Correct 11 ms 23764 KB Output is correct
4 Correct 11 ms 23764 KB Output is correct
5 Correct 10 ms 23764 KB Output is correct
6 Correct 10 ms 23872 KB Output is correct
7 Correct 11 ms 23828 KB Output is correct
8 Correct 11 ms 23764 KB Output is correct
9 Correct 11 ms 23840 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23764 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Correct 11 ms 23764 KB Output is correct
4 Correct 11 ms 23764 KB Output is correct
5 Correct 10 ms 23764 KB Output is correct
6 Correct 10 ms 23872 KB Output is correct
7 Correct 11 ms 23828 KB Output is correct
8 Correct 11 ms 23764 KB Output is correct
9 Correct 11 ms 23840 KB Output is correct
10 Correct 27 ms 24404 KB Output is correct
11 Correct 26 ms 24436 KB Output is correct
12 Correct 15 ms 24404 KB Output is correct
13 Correct 23 ms 24492 KB Output is correct
14 Correct 15 ms 24432 KB Output is correct
15 Correct 24 ms 24464 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3200 ms 67132 KB Output is correct
2 Execution timed out 4053 ms 74344 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23764 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Correct 11 ms 23764 KB Output is correct
4 Correct 11 ms 23764 KB Output is correct
5 Correct 10 ms 23764 KB Output is correct
6 Correct 10 ms 23872 KB Output is correct
7 Correct 11 ms 23828 KB Output is correct
8 Correct 11 ms 23764 KB Output is correct
9 Correct 11 ms 23840 KB Output is correct
10 Correct 27 ms 24404 KB Output is correct
11 Correct 26 ms 24436 KB Output is correct
12 Correct 15 ms 24404 KB Output is correct
13 Correct 23 ms 24492 KB Output is correct
14 Correct 15 ms 24432 KB Output is correct
15 Correct 24 ms 24464 KB Output is correct
16 Correct 3200 ms 67132 KB Output is correct
17 Execution timed out 4053 ms 74344 KB Time limit exceeded
18 Halted 0 ms 0 KB -