oj.uz

Submission #554468

# Submission time Handle Problem Language Result Execution time Memory
554468 2022-04-28T12:49:23 Z keta_tsimakuridze Werewolf (IOI18_werewolf) C++14
49 / 100
 4000 ms 416932 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) {
	if(u <= n) {
	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);
	}
	if(V[t][u].size()) tmin[t][u] = tmin[t][V[t][u][0]];
	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, timer[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, timer[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:48:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |  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:84:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for(int i = 0; i < X.size(); i++) {
      |                    ~~^~~~~~~~~~
werewolf.cpp:92: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]
   92 |  for(int i = 0; i < edges.size(); i++) {
      |                 ~~^~~~~~~~~~~~~~
werewolf.cpp:105:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |  for(int i = 0; i < S.size(); i++) {
      |                 ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 117840 KB Output is correct
2 Correct 52 ms 117824 KB Output is correct
3 Correct 52 ms 117720 KB Output is correct
4 Correct 53 ms 117724 KB Output is correct
5 Correct 52 ms 117924 KB Output is correct
6 Correct 53 ms 117832 KB Output is correct
7 Correct 52 ms 117848 KB Output is correct
8 Correct 53 ms 117892 KB Output is correct
9 Correct 54 ms 117836 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 117840 KB Output is correct
2 Correct 52 ms 117824 KB Output is correct
3 Correct 52 ms 117720 KB Output is correct
4 Correct 53 ms 117724 KB Output is correct
5 Correct 52 ms 117924 KB Output is correct
6 Correct 53 ms 117832 KB Output is correct
7 Correct 52 ms 117848 KB Output is correct
8 Correct 53 ms 117892 KB Output is correct
9 Correct 54 ms 117836 KB Output is correct
10 Correct 64 ms 121236 KB Output is correct
11 Correct 64 ms 121256 KB Output is correct
12 Correct 61 ms 121180 KB Output is correct
13 Correct 64 ms 121336 KB Output is correct
14 Correct 64 ms 121304 KB Output is correct
15 Correct 63 ms 121300 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1361 ms 393540 KB Output is correct
2 Correct 2557 ms 400844 KB Output is correct
3 Correct 2220 ms 396840 KB Output is correct
4 Correct 1657 ms 394672 KB Output is correct
5 Correct 1553 ms 394620 KB Output is correct
6 Correct 1398 ms 394260 KB Output is correct
7 Correct 1318 ms 394108 KB Output is correct
8 Correct 2509 ms 401956 KB Output is correct
9 Correct 1459 ms 396944 KB Output is correct
10 Correct 1391 ms 394668 KB Output is correct
11 Correct 1508 ms 394760 KB Output is correct
12 Correct 1151 ms 395200 KB Output is correct
13 Correct 2445 ms 402920 KB Output is correct
14 Correct 2665 ms 402908 KB Output is correct
15 Correct 2405 ms 408956 KB Output is correct
16 Correct 2422 ms 409048 KB Output is correct
17 Correct 1513 ms 401136 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 117840 KB Output is correct
2 Correct 52 ms 117824 KB Output is correct
3 Correct 52 ms 117720 KB Output is correct
4 Correct 53 ms 117724 KB Output is correct
5 Correct 52 ms 117924 KB Output is correct
6 Correct 53 ms 117832 KB Output is correct
7 Correct 52 ms 117848 KB Output is correct
8 Correct 53 ms 117892 KB Output is correct
9 Correct 54 ms 117836 KB Output is correct
10 Correct 64 ms 121236 KB Output is correct
11 Correct 64 ms 121256 KB Output is correct
12 Correct 61 ms 121180 KB Output is correct
13 Correct 64 ms 121336 KB Output is correct
14 Correct 64 ms 121304 KB Output is correct
15 Correct 63 ms 121300 KB Output is correct
16 Correct 1361 ms 393540 KB Output is correct
17 Correct 2557 ms 400844 KB Output is correct
18 Correct 2220 ms 396840 KB Output is correct
19 Correct 1657 ms 394672 KB Output is correct
20 Correct 1553 ms 394620 KB Output is correct
21 Correct 1398 ms 394260 KB Output is correct
22 Correct 1318 ms 394108 KB Output is correct
23 Correct 2509 ms 401956 KB Output is correct
24 Correct 1459 ms 396944 KB Output is correct
25 Correct 1391 ms 394668 KB Output is correct
26 Correct 1508 ms 394760 KB Output is correct
27 Correct 1151 ms 395200 KB Output is correct
28 Correct 2445 ms 402920 KB Output is correct
29 Correct 2665 ms 402908 KB Output is correct
30 Correct 2405 ms 408956 KB Output is correct
31 Correct 2422 ms 409048 KB Output is correct
32 Correct 1513 ms 401136 KB Output is correct
33 Correct 2559 ms 403064 KB Output is correct
34 Correct 536 ms 144860 KB Output is correct
35 Correct 3765 ms 408328 KB Output is correct
36 Correct 2287 ms 402420 KB Output is correct
37 Correct 3355 ms 407036 KB Output is correct
38 Correct 2680 ms 403464 KB Output is correct
39 Correct 1872 ms 416932 KB Output is correct
40 Correct 2081 ms 408756 KB Output is correct
41 Correct 2908 ms 405928 KB Output is correct
42 Correct 1770 ms 402372 KB Output is correct
43 Execution timed out 4088 ms 413452 KB Time limit exceeded
44 Halted 0 ms 0 KB -