oj.uz

Submission #404328

# Submission time Handle Problem Language Result Execution time Memory
404328 2021-05-14T08:07:57 Z SeDunion Werewolf (IOI18_werewolf) C++17
15 / 100
 4000 ms 72424 KB 
#include "werewolf.h"
#include <bits/stdc++.h>
#ifndef LOCAL
#define cerr if(false)cerr
#endif
using namespace std;
using ll = long long;
const int MAXN = 1e6 + 11;
int N, Q, M;

int P[MAXN], sz, par[MAXN], val[MAXN], go[MAXN][2];
int getP(int a) {
	if (a == P[a]) return a;
	return P[a] = getP(P[a]);
}
vector<int>g[MAXN];

int L[MAXN], R[MAXN];

vector<int>G[2];

void dfs(int v, int t) {
	if (!go[v][0] && !go[v][1]) {
		L[v] = R[v] = G[t].size();
		cerr << v << " " << t << " " << L[v] << " " << R[v] << endl;
		G[t].emplace_back(v);
		return;
	}
	dfs(go[v][0], t);
	dfs(go[v][1], t);
	L[v] = L[go[v][0]];
	R[v] = R[go[v][1]];
	cerr << v << " " << t << " " << L[v] << " " << R[v] << endl;
}

vector<int> check_validity(int N_, vector<int> X, vector<int> Y,
                                vector<int> S, vector<int> E,
                                vector<int> Lq, vector<int> Rq) {
	N = N_;
	M = X.size();
	Q = S.size();
	for (int i = 0 ; i < M ; ++ i) {
		g[X[i]].emplace_back(Y[i]);
		g[Y[i]].emplace_back(X[i]);
	}
	sz = N;
	for (int i = 0 ; i < N ; ++ i) P[i] = i;
	for (int i = 0 ; i < N ; ++ i) {
		for (int j : g[i]) if (j < i) {
			int x = getP(i);
			int y = getP(j);
			if (x != y) {
				P[x] = P[y] = P[sz] = sz;
				go[sz][0] = x, go[sz][1] = y;
				par[x] = par[y] = sz;
				val[sz] = i;
				sz++;
			}
		}
	}
	dfs(sz-1, 0);
	int off = sz;
	for (int i = 0 ; i < N ; ++ i) P[i+off] = i+off;
	sz += N;
	for (int i = N-1 ; i >= 0 ; -- i) {
		for (int j : g[i]) if (j > i) {
			int x = getP(i+off);
			int y = getP(j+off);
			if (x != y) {
				P[x] = P[y] = P[sz] = sz;
				go[sz][0] = x, go[sz][1] = y;
				par[x] = par[y] = sz;
				val[sz] = i;
				sz++;
			}
		}
	}
	dfs(sz-1, 1);
	for (int &i : G[1]) i -= off;
	for (int i : G[0]) cerr << i << " ";
	cerr << ": G[0]\n";
	for (int i : G[1]) cerr << i << " ";
	cerr << ": G[1]\n";
	vector<int>ANS(Q);
	for (int q = 0 ; q < Q ; ++ q) {
		int Ls, Rs, Le, Re;
		{
			int v = E[q];
			while (par[v] && val[par[v]] <= Rq[q]) v = par[v];
			Le = L[v], Re = R[v];
		}
		{
			int v = S[q] + off;
			while (par[v] && val[par[v]] >= Lq[q]) v = par[v];
			Ls = L[v], Rs = R[v];
		}
		cerr << Ls << " " << Rs << " " << Le << " " << Re << " LR" << endl;
		bool has = false;
		for (int i = Le ; i <= Re ; ++ i) {
			for (int j = Ls ; j <= Rs ; ++ j) {
				if (G[0][i] == G[1][j]) {
					has = true;
				}
			}
		}
		ANS[q] = has;
	}
	return ANS;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23800 KB Output is correct
2 Correct 15 ms 23832 KB Output is correct
3 Correct 17 ms 23852 KB Output is correct
4 Correct 14 ms 23792 KB Output is correct
5 Correct 16 ms 23752 KB Output is correct
6 Correct 16 ms 23772 KB Output is correct
7 Correct 17 ms 23756 KB Output is correct
8 Correct 15 ms 23796 KB Output is correct
9 Correct 18 ms 23844 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23800 KB Output is correct
2 Correct 15 ms 23832 KB Output is correct
3 Correct 17 ms 23852 KB Output is correct
4 Correct 14 ms 23792 KB Output is correct
5 Correct 16 ms 23752 KB Output is correct
6 Correct 16 ms 23772 KB Output is correct
7 Correct 17 ms 23756 KB Output is correct
8 Correct 15 ms 23796 KB Output is correct
9 Correct 18 ms 23844 KB Output is correct
10 Correct 2803 ms 24544 KB Output is correct
11 Correct 1351 ms 24524 KB Output is correct
12 Correct 23 ms 24476 KB Output is correct
13 Correct 2259 ms 24616 KB Output is correct
14 Correct 154 ms 24524 KB Output is correct
15 Correct 1410 ms 24616 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 2901 ms 67656 KB Output is correct
2 Execution timed out 4094 ms 72424 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23800 KB Output is correct
2 Correct 15 ms 23832 KB Output is correct
3 Correct 17 ms 23852 KB Output is correct
4 Correct 14 ms 23792 KB Output is correct
5 Correct 16 ms 23752 KB Output is correct
6 Correct 16 ms 23772 KB Output is correct
7 Correct 17 ms 23756 KB Output is correct
8 Correct 15 ms 23796 KB Output is correct
9 Correct 18 ms 23844 KB Output is correct
10 Correct 2803 ms 24544 KB Output is correct
11 Correct 1351 ms 24524 KB Output is correct
12 Correct 23 ms 24476 KB Output is correct
13 Correct 2259 ms 24616 KB Output is correct
14 Correct 154 ms 24524 KB Output is correct
15 Correct 1410 ms 24616 KB Output is correct
16 Correct 2901 ms 67656 KB Output is correct
17 Execution timed out 4094 ms 72424 KB Time limit exceeded
18 Halted 0 ms 0 KB -