oj.uz

답안 #773192

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
773192 2023-07-04T16:26:19 Z amunduzbaev 늑대인간 (IOI18_werewolf) C++17
100 / 100
 566 ms 104584 KB 
#include "werewolf.h"

#include "bits/stdc++.h"
using namespace std;

#ifndef EVAL
#include "grader.cpp"
#endif

#define ar array
typedef int64_t ll;
typedef int32_t ii;
//~ #define int ll

const int N = 2e5 + 5;

struct ST{
	int tree[N << 2];
	
	void set(int i, int v, int lx, int rx, int x){
		if(lx == rx) { tree[x] = v; return; }
		int m = (lx + rx) >> 1;
		if(i <= m) set(i, v, lx, m, x << 1);
		else set(i, v, m + 1, rx, x << 1 | 1);
		tree[x] = max(tree[x << 1], tree[x << 1 | 1]);
	}
	
	void set(int i, int v){
		set(i, v, 0, N, 1);
	}
	
	int get(int l, int r, int lx, int rx, int x){
		if(lx > r || rx < l) return 0;
		if(lx >= l && rx <= r){
			return tree[x];
		}
		
		int m = (lx + rx) >> 1;
		return max(get(l, r, lx, m, x << 1), get(l, r, m + 1, rx, x << 1 | 1));
	}
	
	int get(int l, int r){
		return get(l, r, 0, N, 1);
	}
}tree;

const int M = 18;
vector<int> qwe[N], edges[2][N];
int tin[2][N], tout[2][N];
int par[2][N][M];

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(), q = s.size();
	for(int i=0;i<m;i++){
		qwe[x[i]].push_back(y[i]);
		qwe[y[i]].push_back(x[i]);
	}
	
	{ // building trees
		vector<int> par(n), sz(n, 1), root(n);
		iota(par.begin(), par.end(), 0);
		iota(root.begin(), root.end(), 0);
		
		function<int(int)> f = [&](int x) { return (par[x] == x ? x : par[x] = f(par[x])); };
		auto merge = [&](int a, int b, int r){
			a = f(a), b = f(b);
			if(a == b) return;
			if(sz[a] < sz[b]) swap(a, b);
			par[b] = a;
			root[a] = r;
			sz[a] += sz[b];
		};
		
		for(int i=n - 1;~i;i--){
			for(auto x : qwe[i]){
				if(x > i && root[f(x)] != i){
					edges[0][i].push_back(root[f(x)]);
					merge(x, i, i);
				}
			}
		}
		
		iota(par.begin(), par.end(), 0);
		iota(root.begin(), root.end(), 0);
		fill(sz.begin(), sz.end(), 1);
		
		for(int i=0;i<n;i++){
			for(auto x : qwe[i]){
				if(x < i && root[f(x)] != i){
					edges[1][i].push_back(root[f(x)]);
					merge(x, i, i);
				}
			}
		}
	}
	
	//~ for(int t=0;t<2;t++){
		//~ for(int i=0;i<n;i++){
			//~ for(auto x : edges[t][i]){
				//~ cout<<t<<" "<<i<<" "<<x<<"\n";
			//~ }
		//~ }
		
		//~ cout<<"\n";
	//~ }
	
	ar<int, 2> root = {0, n - 1};

	for(int t=0;t<2;t++){
		int t_ = 0;
		function<void(int)> dfs = [&](int u){
			for(int j=1;j<M;j++){
				par[t][u][j] = par[t][par[t][u][j - 1]][j - 1];
			}
			tin[t][u] = ++t_;
			for(auto x : edges[t][u]){
				par[t][x][0] = u;
				dfs(x);
			}
			tout[t][u] = t_;
		};
		
		par[t][root[t]][0] = root[t];
		dfs(root[t]);
	}
	
	vector<ar<int, 2>> ver(q);
	
	auto get = [&](int t, int u, int l, int r){
		for(int j=M - 1;~j;j--){
			if(l <= par[t][u][j] && par[t][u][j] <= r){
				u = par[t][u][j];
			}
		}
		
		return u;
	};
	
	for(int i=0;i<q;i++){
		ver[i][0] = get(0, s[i], l[i], n);
		ver[i][1] = get(1, e[i], 0, r[i]);
	}
	
	vector<int> p(q);
	iota(p.begin(), p.end(), 0);
	sort(p.begin(), p.end(), [&](int i, int j){
		return tout[0][ver[i][0]] < tout[0][ver[j][0]];
	});
	
	vector<int> tot(n);
	iota(tot.begin(), tot.end(), 0);
	sort(tot.begin(), tot.end(), [&](int i, int j){
		return tout[0][i] < tout[0][j];
	});
	
	vector<int> res(q);
	int j = 0;
	for(auto i : p){
		while(j < n && tin[0][tot[j]] <= tout[0][ver[i][0]]){
			tree.set(tin[1][tot[j]], tin[0][tot[j]]);
			j++;
		}
		
		if(tree.get(tin[1][ver[i][1]], tout[1][ver[i][1]]) >= tin[0][ver[i][0]]){
			res[i] = 1;
		}
	}
	
	return res;
}

/*

6 6 3
5 1
1 2
1 3
3 4
3 0
2 5
4 2 1 2
4 2 2 2
5 4 3 4

5 4 4
4 1
1 0
0 3
3 2
4 0 1 1 
4 3 1 3
2 0 1 1
3 1 3 3

*/

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14468 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 7 ms 14404 KB Output is correct
6 Correct 7 ms 14404 KB Output is correct
7 Correct 7 ms 14408 KB Output is correct
8 Correct 7 ms 14404 KB Output is correct
9 Correct 7 ms 14400 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14468 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 7 ms 14404 KB Output is correct
6 Correct 7 ms 14404 KB Output is correct
7 Correct 7 ms 14408 KB Output is correct
8 Correct 7 ms 14404 KB Output is correct
9 Correct 7 ms 14400 KB Output is correct
10 Correct 12 ms 15600 KB Output is correct
11 Correct 11 ms 15560 KB Output is correct
12 Correct 11 ms 15512 KB Output is correct
13 Correct 12 ms 15828 KB Output is correct
14 Correct 12 ms 15824 KB Output is correct
15 Correct 12 ms 15572 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 485 ms 75832 KB Output is correct
2 Correct 429 ms 82712 KB Output is correct
3 Correct 432 ms 78076 KB Output is correct
4 Correct 417 ms 76168 KB Output is correct
5 Correct 410 ms 76028 KB Output is correct
6 Correct 453 ms 75928 KB Output is correct
7 Correct 463 ms 75760 KB Output is correct
8 Correct 401 ms 82744 KB Output is correct
9 Correct 352 ms 78120 KB Output is correct
10 Correct 335 ms 76272 KB Output is correct
11 Correct 350 ms 76056 KB Output is correct
12 Correct 370 ms 75940 KB Output is correct
13 Correct 434 ms 89324 KB Output is correct
14 Correct 459 ms 89356 KB Output is correct
15 Correct 484 ms 89364 KB Output is correct
16 Correct 442 ms 89328 KB Output is correct
17 Correct 450 ms 75940 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14468 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 7 ms 14404 KB Output is correct
6 Correct 7 ms 14404 KB Output is correct
7 Correct 7 ms 14408 KB Output is correct
8 Correct 7 ms 14404 KB Output is correct
9 Correct 7 ms 14400 KB Output is correct
10 Correct 12 ms 15600 KB Output is correct
11 Correct 11 ms 15560 KB Output is correct
12 Correct 11 ms 15512 KB Output is correct
13 Correct 12 ms 15828 KB Output is correct
14 Correct 12 ms 15824 KB Output is correct
15 Correct 12 ms 15572 KB Output is correct
16 Correct 485 ms 75832 KB Output is correct
17 Correct 429 ms 82712 KB Output is correct
18 Correct 432 ms 78076 KB Output is correct
19 Correct 417 ms 76168 KB Output is correct
20 Correct 410 ms 76028 KB Output is correct
21 Correct 453 ms 75928 KB Output is correct
22 Correct 463 ms 75760 KB Output is correct
23 Correct 401 ms 82744 KB Output is correct
24 Correct 352 ms 78120 KB Output is correct
25 Correct 335 ms 76272 KB Output is correct
26 Correct 350 ms 76056 KB Output is correct
27 Correct 370 ms 75940 KB Output is correct
28 Correct 434 ms 89324 KB Output is correct
29 Correct 459 ms 89356 KB Output is correct
30 Correct 484 ms 89364 KB Output is correct
31 Correct 442 ms 89328 KB Output is correct
32 Correct 450 ms 75940 KB Output is correct
33 Correct 482 ms 85376 KB Output is correct
34 Correct 210 ms 48436 KB Output is correct
35 Correct 566 ms 89972 KB Output is correct
36 Correct 473 ms 85328 KB Output is correct
37 Correct 562 ms 88724 KB Output is correct
38 Correct 487 ms 86288 KB Output is correct
39 Correct 493 ms 104384 KB Output is correct
40 Correct 518 ms 96888 KB Output is correct
41 Correct 445 ms 87768 KB Output is correct
42 Correct 390 ms 85224 KB Output is correct
43 Correct 491 ms 96792 KB Output is correct
44 Correct 457 ms 88616 KB Output is correct
45 Correct 458 ms 104584 KB Output is correct
46 Correct 452 ms 104288 KB Output is correct
47 Correct 473 ms 97816 KB Output is correct
48 Correct 458 ms 97648 KB Output is correct
49 Correct 505 ms 97792 KB Output is correct
50 Correct 509 ms 97672 KB Output is correct
51 Correct 513 ms 97012 KB Output is correct
52 Correct 502 ms 96904 KB Output is correct