oj.uz

답안 #554467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
554467 2022-04-28T12:45:51 Z keta_tsimakuridze 늑대인간 (IOI18_werewolf) C++14
100 / 100
 3760 ms 428156 KB 
#include<bits/stdc++.h>
#include "werewolf.h"
using namespace std;
#define pii pair<int,int>
#define f first
#define s second
const int N = 5e5 + 5, inf = 1e9;
vector<int> V[2][N];
int cur[2], x[2][N], p[2][N][20], timer[2], tmin[2][N], tmout[2][N], pos[2][N], n;
int par[2][N];
vector<pii> edges;
set<int> s[4 * N];
int find(int u,int t) {
	return (par[t][u] == u ? u : par[t][u] = find(par[t][u], t));
}
void build(vector<pair<int,int> > edges, int t) {
	cur[t] = n; 
	for(int i = 1; i <= cur[t]; i++) par[t][i] = i;
	for(int i = 0; i < edges.size(); i++) {
		int u = edges[i].f, v = edges[i].s;
		if(find(u, t) != find(v, t)) {
			++cur[t]; par[t][cur[t]] = cur[t];
			V[t][cur[t]].push_back(find(u, t));
			V[t][cur[t]].push_back(find(v, t));
			x[t][cur[t]] = u;
			u = find(u, t), v = find(v, t);
			par[t][u] = cur[t];
			par[t][v] = cur[t];
			p[t][u][0] = p[t][v][0] = cur[t];
			
		}
	}
	cur[t]++; if(!t)x[t][cur[t]] = inf;
	for(int i = 1; i < cur[t]; i++) {
		if(find(i, t) == i) p[t][i][0] = cur[t], V[t][cur[t]].push_back(i);
	}
	for(int j = 1; j <= 18; j++) {
		for(int i = 1; i <= cur[t]; i++) {
			p[t][i][j] = p[t][p[t][i][j - 1]][j - 1];
		}
	}
}
void dfs(int u, int t) {
	tmin[t][u] = ++timer[t];
	pos[t][timer[t]] = u; 
	for(int i = 0; i < V[t][u].size(); i++) {
		dfs(V[t][u][i], t);
	}
	tmout[t][u] = timer[t];
}
int get(int u,int t, int X) {
	for(int i = 18; i >= 0; i--) {
		if(!p[t][u][i]) continue;
		if(t && x[t][p[t][u][i]] >= X) u = p[t][u][i];
		else if(!t && x[t][p[t][u][i]] <= X) u = p[t][u][i];
	}
	return u;
}
void build(int u,int l,int r) {
	for(int i = l; i <= r; i++) if(pos[1][i] <= n)s[u].insert(tmin[0][pos[1][i]]);
	if(l == r) return;
	int mid = (l + r) / 2;
	build(2 * u, l, mid); build(2 * u + 1, mid + 1, r);
}
bool get(int u, int st,int en,int l,int r,int x,int y) {
	if(l > en || r < st) return 0;
	if(st <= l && r <= en) {
		if(s[u].upper_bound(x - 1) != s[u].end()) {
			if(*s[u].upper_bound(x - 1) <= y) return 1;
		}
		return 0;
	}
	int mid = (l + r) / 2;
	return get(2 * u, st, en, l, mid, x, y)|get(2 * u + 1, st, en, mid + 1, r, x, y);
}
 
std::vector<int> check_validity(int nn, std::vector<int> X, std::vector<int> Y,
                                std::vector<int> S, std::vector<int> E,
                                std::vector<int> L, std::vector<int> R) {
    vector<pair<int,int> > edges; n = nn;
    for(int i = 0; i < X.size(); i++) {
    	++X[i]; ++Y[i];
    	edges.push_back({max(X[i], Y[i]), min(X[i], Y[i])});
	}
	
	sort(edges.begin(), edges.end()); 
	build(edges, 0); // werewolf
	
	for(int i = 0; i < edges.size(); i++) {
		swap(edges[i].f, edges[i].s);
	}
	sort(edges.rbegin(), edges.rend());
	build(edges, 1); // human
	dfs(cur[0], 0);
 
	
	dfs(cur[1], 1);
	
	build(1, 1, cur[1]);
	vector<int> ans(S.size());
 
	for(int i = 0; i < S.size(); i++) {
		int l = L[i], r = R[i], u = S[i], v = E[i];
		++l, ++r, ++u, ++v;
		if(u < l || v > r) {
			ans[i] = 0;
		
			continue;
		}
	
		u = get(u, 1, l);
		v = get(v, 0, r); 
		ans[i] = get(1, tmin[1][u], tmout[1][u], 1, cur[1], tmin[0][v], tmout[0][v]);
		
	}
	return ans;
 
}

Compilation message

werewolf.cpp: In function 'void build(std::vector<std::pair<int, int> >, int)':
werewolf.cpp:19:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for(int i = 0; i < edges.size(); i++) {
      |                 ~~^~~~~~~~~~~~~~
werewolf.cpp: In function 'void dfs(int, int)':
werewolf.cpp:46:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |  for(int i = 0; i < V[t][u].size(); i++) {
      |                 ~~^~~~~~~~~~~~~~~~
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:81:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for(int i = 0; i < X.size(); i++) {
      |                    ~~^~~~~~~~~~
werewolf.cpp:89:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |  for(int i = 0; i < edges.size(); i++) {
      |                 ~~^~~~~~~~~~~~~~
werewolf.cpp:102:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |  for(int i = 0; i < S.size(); i++) {
      |                 ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 117836 KB Output is correct
2 Correct 59 ms 117824 KB Output is correct
3 Correct 61 ms 117824 KB Output is correct
4 Correct 72 ms 117792 KB Output is correct
5 Correct 59 ms 117964 KB Output is correct
6 Correct 60 ms 117792 KB Output is correct
7 Correct 58 ms 117896 KB Output is correct
8 Correct 59 ms 117836 KB Output is correct
9 Correct 61 ms 117836 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 117836 KB Output is correct
2 Correct 59 ms 117824 KB Output is correct
3 Correct 61 ms 117824 KB Output is correct
4 Correct 72 ms 117792 KB Output is correct
5 Correct 59 ms 117964 KB Output is correct
6 Correct 60 ms 117792 KB Output is correct
7 Correct 58 ms 117896 KB Output is correct
8 Correct 59 ms 117836 KB Output is correct
9 Correct 61 ms 117836 KB Output is correct
10 Correct 92 ms 121332 KB Output is correct
11 Correct 77 ms 121364 KB Output is correct
12 Correct 74 ms 121236 KB Output is correct
13 Correct 71 ms 121424 KB Output is correct
14 Correct 82 ms 121476 KB Output is correct
15 Correct 76 ms 121292 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1539 ms 403640 KB Output is correct
2 Correct 2874 ms 411660 KB Output is correct
3 Correct 2496 ms 414800 KB Output is correct
4 Correct 1718 ms 412588 KB Output is correct
5 Correct 1666 ms 412556 KB Output is correct
6 Correct 1483 ms 412320 KB Output is correct
7 Correct 1418 ms 412036 KB Output is correct
8 Correct 2655 ms 419852 KB Output is correct
9 Correct 1567 ms 414880 KB Output is correct
10 Correct 1400 ms 412692 KB Output is correct
11 Correct 1453 ms 412584 KB Output is correct
12 Correct 1162 ms 412248 KB Output is correct
13 Correct 2166 ms 419948 KB Output is correct
14 Correct 2207 ms 419932 KB Output is correct
15 Correct 2167 ms 419980 KB Output is correct
16 Correct 2170 ms 420008 KB Output is correct
17 Correct 1384 ms 412156 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 117836 KB Output is correct
2 Correct 59 ms 117824 KB Output is correct
3 Correct 61 ms 117824 KB Output is correct
4 Correct 72 ms 117792 KB Output is correct
5 Correct 59 ms 117964 KB Output is correct
6 Correct 60 ms 117792 KB Output is correct
7 Correct 58 ms 117896 KB Output is correct
8 Correct 59 ms 117836 KB Output is correct
9 Correct 61 ms 117836 KB Output is correct
10 Correct 92 ms 121332 KB Output is correct
11 Correct 77 ms 121364 KB Output is correct
12 Correct 74 ms 121236 KB Output is correct
13 Correct 71 ms 121424 KB Output is correct
14 Correct 82 ms 121476 KB Output is correct
15 Correct 76 ms 121292 KB Output is correct
16 Correct 1539 ms 403640 KB Output is correct
17 Correct 2874 ms 411660 KB Output is correct
18 Correct 2496 ms 414800 KB Output is correct
19 Correct 1718 ms 412588 KB Output is correct
20 Correct 1666 ms 412556 KB Output is correct
21 Correct 1483 ms 412320 KB Output is correct
22 Correct 1418 ms 412036 KB Output is correct
23 Correct 2655 ms 419852 KB Output is correct
24 Correct 1567 ms 414880 KB Output is correct
25 Correct 1400 ms 412692 KB Output is correct
26 Correct 1453 ms 412584 KB Output is correct
27 Correct 1162 ms 412248 KB Output is correct
28 Correct 2166 ms 419948 KB Output is correct
29 Correct 2207 ms 419932 KB Output is correct
30 Correct 2167 ms 419980 KB Output is correct
31 Correct 2170 ms 420008 KB Output is correct
32 Correct 1384 ms 412156 KB Output is correct
33 Correct 2384 ms 414180 KB Output is correct
34 Correct 483 ms 148888 KB Output is correct
35 Correct 3319 ms 419400 KB Output is correct
36 Correct 2086 ms 413360 KB Output is correct
37 Correct 3184 ms 417984 KB Output is correct
38 Correct 2370 ms 414464 KB Output is correct
39 Correct 1788 ms 427800 KB Output is correct
40 Correct 1933 ms 423752 KB Output is correct
41 Correct 2533 ms 417140 KB Output is correct
42 Correct 1618 ms 413372 KB Output is correct
43 Correct 3760 ms 424428 KB Output is correct
44 Correct 3027 ms 418084 KB Output is correct
45 Correct 2272 ms 428156 KB Output is correct
46 Correct 3215 ms 427800 KB Output is correct
47 Correct 2199 ms 420128 KB Output is correct
48 Correct 2265 ms 419972 KB Output is correct
49 Correct 2185 ms 420108 KB Output is correct
50 Correct 2143 ms 419996 KB Output is correct
51 Correct 1677 ms 424380 KB Output is correct
52 Correct 1663 ms 424368 KB Output is correct