oj.uz

Submission #58203

# Submission time Handle Problem Language Result Execution time Memory
58203 2018-07-17T06:46:48 Z memikakizaki Cats or Dogs (JOI18_catdog) C++14
100 / 100
 897 ms 19760 KB 
#include "catdog.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define epb emplace_back
#define mp make_pair
#define all(a) begin(a), end(a)
#define csz(a) (int) a.size()
#define fori(i, a, b) for(int i = (int) a; i <= (int) b; ++i)
#define rofi(i, b, a) for(int i = (int) b; i >= (int) a; --i)
#define foreach(tt, a) for(auto &tt: a)
#define long long long
const int INF = 1e9+1;
const long MOD = 1e9+7, LINF = 1e16+1;

const int N = 1 << 17;
typedef array<array<int, 2>, 2> arr22;

int n, state[N];
pair<int,int> lastval[N];
vector<int> g[N];

int par[N], sz[N], in[N], nxt[N], down[N];
void dfs_sz(int u) {
	sz[u] = 1;
	foreach(v, g[u]) if(v != par[u]) {
		par[v] = u;
		dfs_sz(v);
		sz[u] += sz[v];
		if(g[u][0] == par[u] || sz[v] > sz[g[u][0]]) swap(v, g[u][0]);
	}
}
void dfs_hld(int u) {
	static int tick = 0;
	in[u] = tick++;
	down[nxt[u]] = u;
	foreach(v, g[u]) if(v != par[u]) {
		nxt[v] = (v == g[u][0] ? nxt[u] : v);
		dfs_hld(v);
	}
}

arr22 t[2*N];
arr22 merge(arr22 a, arr22 b) {
	arr22 ret;
	ret[0][0] = ret[0][1] = ret[1][0] = ret[1][1] = INF;
	fori(i, 0, 1) fori(j, 0, 1) fori(x, 0, 1) fori(y, 0, 1) {
		ret[i][j] = min(a[i][x] + b[y][j] + (x != y), ret[i][j]);
	}
	return ret;
}
void build(int i = 1, int l = 0, int r = N-1) {
	if(l == r) {
		t[i][0][1] = t[i][1][0] = INF;
		return;
	}
	int mid = l+r >> 1;
	build(i << 1, l, mid);
	build(i << 1 | 1, mid+1, r);
	t[i] = merge(t[i << 1], t[i << 1 | 1]);
}
void update(int targ, pair<int,int> val, int i = 1, int l = 0, int r = N-1) {
	if(l == r) {
		t[i][0][0] += val.first, t[i][1][1] += val.second;
		return;
	}
	int mid = l+r >> 1;
	if(targ <= mid) update(targ, val, i << 1, l, mid);
	else update(targ, val, i << 1 | 1, mid+1, r);
	t[i] = merge(t[i << 1], t[i << 1 | 1]);
}
arr22 query(int tl, int tr, int i = 1, int l = 0, int r = N-1) {
	if(l > tr || r < tl) {
		arr22 ret;
		fori(x, 0, 1) fori(y, 0, 1) ret[x][y] = 0;
		return ret;
	}
	if(tl <= l && r <= tr) return t[i];
	int mid = l+r >> 1;
	arr22 lf = query(tl, tr, i << 1 , l, mid);
	arr22 rg = query(tl, tr, i << 1 | 1, mid+1, r);
	arr22 ret;
	if(tr <= mid) ret = lf;
	else if(tl > mid) ret = rg;
	else ret = merge(lf, rg);
	return ret;
}

void initialize(int _n, vector<int> U, vector<int> V) {
	n = _n;
	fori(i, 0, n-2) {
		g[U[i]].pb(V[i]);
		g[V[i]].pb(U[i]);
	}
	dfs_sz(1);
	nxt[1] = 1;
	dfs_hld(1);
	build();
}
void propogate(int v, pair<int,int> val) {
	while(v) {
		update(in[v], val);
		arr22 curr = query(in[nxt[v]], in[down[nxt[v]]]);
		pair<int,int> mn = {min(curr[0][0], curr[0][1]), min(curr[1][0], curr[1][1])};
		pair<int,int> mn2 = {min(mn.first, mn.second + 1), min(mn.first + 1, mn.second)};

		val = mp(mn2.first - lastval[nxt[v]].first, mn2.second - lastval[nxt[v]].second);
		lastval[nxt[v]] = mn2;
		v = par[nxt[v]];
	}
}
int answer() {
	int ans = INF;
	arr22 ret = query(in[1], in[down[1]]);
	fori(i, 0, 1) fori(j, 0, 1) ans = min(ret[i][j], ans);
	return ans;
}
int cat(int v) {
	state[v] = 1;
	propogate(v, mp(0, INF));
	return answer();
}
int dog(int v) {
	state[v] = 2;
	propogate(v, mp(INF, 0));
	return answer();
}
int neighbor(int v) {
	if(state[v] == 1) propogate(v, mp(0, -INF));
	else propogate(v, mp(-INF, 0));
	return answer();
}

Compilation message

catdog.cpp: In function 'void build(int, int, int)':
catdog.cpp:57:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = l+r >> 1;
            ~^~
catdog.cpp: In function 'void update(int, std::pair<int, int>, int, int, int)':
catdog.cpp:67:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = l+r >> 1;
            ~^~
catdog.cpp: In function 'arr22 query(int, int, int, int, int)':
catdog.cpp:79:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = l+r >> 1;
            ~^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7544 KB Output is correct
2 Correct 12 ms 7544 KB Output is correct
3 Correct 11 ms 7728 KB Output is correct
4 Correct 10 ms 7728 KB Output is correct
5 Correct 14 ms 7728 KB Output is correct
6 Correct 14 ms 7728 KB Output is correct
7 Correct 16 ms 7728 KB Output is correct
8 Correct 14 ms 7740 KB Output is correct
9 Correct 12 ms 7864 KB Output is correct
10 Correct 12 ms 7864 KB Output is correct
11 Correct 14 ms 7864 KB Output is correct
12 Correct 13 ms 7864 KB Output is correct
13 Correct 14 ms 7864 KB Output is correct
14 Correct 12 ms 7864 KB Output is correct
15 Correct 13 ms 7864 KB Output is correct
16 Correct 13 ms 7864 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7544 KB Output is correct
2 Correct 12 ms 7544 KB Output is correct
3 Correct 11 ms 7728 KB Output is correct
4 Correct 10 ms 7728 KB Output is correct
5 Correct 14 ms 7728 KB Output is correct
6 Correct 14 ms 7728 KB Output is correct
7 Correct 16 ms 7728 KB Output is correct
8 Correct 14 ms 7740 KB Output is correct
9 Correct 12 ms 7864 KB Output is correct
10 Correct 12 ms 7864 KB Output is correct
11 Correct 14 ms 7864 KB Output is correct
12 Correct 13 ms 7864 KB Output is correct
13 Correct 14 ms 7864 KB Output is correct
14 Correct 12 ms 7864 KB Output is correct
15 Correct 13 ms 7864 KB Output is correct
16 Correct 13 ms 7864 KB Output is correct
17 Correct 15 ms 7864 KB Output is correct
18 Correct 16 ms 7864 KB Output is correct
19 Correct 14 ms 7864 KB Output is correct
20 Correct 13 ms 7864 KB Output is correct
21 Correct 16 ms 7864 KB Output is correct
22 Correct 14 ms 7864 KB Output is correct
23 Correct 17 ms 7864 KB Output is correct
24 Correct 16 ms 7864 KB Output is correct
25 Correct 18 ms 7864 KB Output is correct
26 Correct 13 ms 7864 KB Output is correct
27 Correct 13 ms 7888 KB Output is correct
28 Correct 14 ms 7932 KB Output is correct
29 Correct 13 ms 7932 KB Output is correct
30 Correct 13 ms 7932 KB Output is correct
31 Correct 14 ms 7932 KB Output is correct
32 Correct 14 ms 7932 KB Output is correct

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7544 KB Output is correct
2 Correct 12 ms 7544 KB Output is correct
3 Correct 11 ms 7728 KB Output is correct
4 Correct 10 ms 7728 KB Output is correct
5 Correct 14 ms 7728 KB Output is correct
6 Correct 14 ms 7728 KB Output is correct
7 Correct 16 ms 7728 KB Output is correct
8 Correct 14 ms 7740 KB Output is correct
9 Correct 12 ms 7864 KB Output is correct
10 Correct 12 ms 7864 KB Output is correct
11 Correct 14 ms 7864 KB Output is correct
12 Correct 13 ms 7864 KB Output is correct
13 Correct 14 ms 7864 KB Output is correct
14 Correct 12 ms 7864 KB Output is correct
15 Correct 13 ms 7864 KB Output is correct
16 Correct 13 ms 7864 KB Output is correct
17 Correct 15 ms 7864 KB Output is correct
18 Correct 16 ms 7864 KB Output is correct
19 Correct 14 ms 7864 KB Output is correct
20 Correct 13 ms 7864 KB Output is correct
21 Correct 16 ms 7864 KB Output is correct
22 Correct 14 ms 7864 KB Output is correct
23 Correct 17 ms 7864 KB Output is correct
24 Correct 16 ms 7864 KB Output is correct
25 Correct 18 ms 7864 KB Output is correct
26 Correct 13 ms 7864 KB Output is correct
27 Correct 13 ms 7888 KB Output is correct
28 Correct 14 ms 7932 KB Output is correct
29 Correct 13 ms 7932 KB Output is correct
30 Correct 13 ms 7932 KB Output is correct
31 Correct 14 ms 7932 KB Output is correct
32 Correct 14 ms 7932 KB Output is correct
33 Correct 514 ms 12556 KB Output is correct
34 Correct 210 ms 12684 KB Output is correct
35 Correct 459 ms 12684 KB Output is correct
36 Correct 729 ms 15936 KB Output is correct
37 Correct 34 ms 15936 KB Output is correct
38 Correct 897 ms 16792 KB Output is correct
39 Correct 733 ms 16792 KB Output is correct
40 Correct 772 ms 16792 KB Output is correct
41 Correct 804 ms 16792 KB Output is correct
42 Correct 760 ms 16792 KB Output is correct
43 Correct 760 ms 16808 KB Output is correct
44 Correct 818 ms 16808 KB Output is correct
45 Correct 755 ms 16808 KB Output is correct
46 Correct 793 ms 16808 KB Output is correct
47 Correct 799 ms 16812 KB Output is correct
48 Correct 235 ms 16812 KB Output is correct
49 Correct 312 ms 16812 KB Output is correct
50 Correct 123 ms 16812 KB Output is correct
51 Correct 140 ms 16812 KB Output is correct
52 Correct 80 ms 16812 KB Output is correct
53 Correct 408 ms 16812 KB Output is correct
54 Correct 289 ms 16812 KB Output is correct
55 Correct 765 ms 16812 KB Output is correct
56 Correct 441 ms 16812 KB Output is correct
57 Correct 504 ms 16812 KB Output is correct
58 Correct 56 ms 16812 KB Output is correct
59 Correct 147 ms 16812 KB Output is correct
60 Correct 252 ms 16812 KB Output is correct
61 Correct 245 ms 16812 KB Output is correct
62 Correct 165 ms 16812 KB Output is correct
63 Correct 86 ms 16812 KB Output is correct
64 Correct 109 ms 16812 KB Output is correct
65 Correct 147 ms 17468 KB Output is correct
66 Correct 163 ms 17468 KB Output is correct
67 Correct 107 ms 17468 KB Output is correct
68 Correct 223 ms 17728 KB Output is correct
69 Correct 61 ms 17728 KB Output is correct
70 Correct 33 ms 17728 KB Output is correct
71 Correct 107 ms 17728 KB Output is correct
72 Correct 149 ms 17728 KB Output is correct
73 Correct 418 ms 19760 KB Output is correct
74 Correct 387 ms 19760 KB Output is correct
75 Correct 380 ms 19760 KB Output is correct
76 Correct 228 ms 19760 KB Output is correct
77 Correct 440 ms 19760 KB Output is correct