oj.uz

답안 #197057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
197057 2020-01-18T12:02:36 Z iefnah06 Cats or Dogs (JOI18_catdog) C++11
100 / 100
 209 ms 26652 KB 
#include "catdog.h"
 
#include<bits/stdc++.h>
using namespace std;

const int MAXN = 1.1e5;
int N;
vector<int> adj[MAXN];
int A[MAXN];

int sz[MAXN];
int par[MAXN];

void dfs_sz(int cur, int prv) {
	if (prv) {
		adj[cur].erase(find(adj[cur].begin(), adj[cur].end(), prv));
	}
	sz[cur] = 1;
	par[cur] = prv;
	for (int nxt : adj[cur]) {
		dfs_sz(nxt, cur);
		sz[cur] += sz[nxt];
	}
	nth_element(adj[cur].begin(), adj[cur].begin(), adj[cur].end(), [&](int i, int j) { return sz[i] > sz[j]; });
}

int heavypar[MAXN];
int num[MAXN];
int pos[MAXN];

void dfs_hld(int cur, int top) {
	heavypar[cur] = top;
	pos[cur] = num[top];
	num[top]++;
	bool isfirst = true;
	for (int nxt : adj[cur]) {
		dfs_hld(nxt, (isfirst ? top : nxt));
		isfirst = false;
	}
}

struct mat {
	int a00, a01, a10, a11;

	friend mat operator * (const mat& A, const mat& B) {
		mat R;
		R.a00 = min(A.a00 + B.a00, A.a01 + B.a10);
		R.a01 = min(A.a00 + B.a01, A.a01 + B.a11);
		R.a10 = min(A.a10 + B.a00, A.a11 + B.a10);
		R.a11 = min(A.a10 + B.a01, A.a11 + B.a11);
		return R;
	}
};

struct segtree {
	int s;
	vector<mat> cost;

	segtree() {}
	segtree(int n) {
		for (s = 1; s < n; s *= 2) {}
		cost = vector<mat>(2*s);
		for (int i = 0; i < 2*s; i++) {
			cost[i].a01 = cost[i].a10 = 1;
		}
	}

	void update(int i, int& v0, int& v1) {
		i += s;
		cost[i].a00 += v0;
		cost[i].a01 += v0;
		cost[i].a10 += v1;
		cost[i].a11 += v1;
		for (i /= 2; i; i /= 2) {
			cost[i] = cost[2*i] * cost[2*i+1];
		}
	}

	void eval(int& a0, int& a1) {
		a0 = min(cost[1].a00, cost[1].a01);
		a1 = min(cost[1].a10, cost[1].a11);
	}
} seg[MAXN];
 
void initialize(int n, std::vector<int> a, std::vector<int> b) {
	N = n;
	for (int i = 0; i < N-1; i++) {
		adj[a[i]].push_back(b[i]);
		adj[b[i]].push_back(a[i]);
	}
	for (int i = 1; i <= N; i++) {
		A[i] = 0;
	}

	dfs_sz(1, 0);
	dfs_hld(1, 1);
	for (int i = 1; i <= N; i++) {
		assert((pos[i] == 0) == (heavypar[i] == i));
		if (heavypar[i] == i) {
			seg[i] = segtree(num[i]);
		}
	}
}

void update(int cur, int v0, int v1) {
	while (cur) {
		int top = heavypar[cur];
		int cur0, cur1, nxt0, nxt1;
		seg[top].eval(cur0, cur1);
		seg[top].update(pos[cur], v0, v1);
		seg[top].eval(nxt0, nxt1);
		v0 = min(nxt0, nxt1+1) - min(cur0, cur1+1);
		v1 = min(nxt0+1, nxt1) - min(cur0+1, cur1);
		cur = par[top];
	}
}
 
int query();
 
int cat(int v) {
	A[v] = 1;
	update(v, 0, N);
	return query();
}
 
int dog(int v) {
	A[v] = 2;
	update(v, N, 0);
	return query();
}
 
int neighbor(int v) {
	if (A[v] == 1) {
		update(v, 0, -N);
	} else if (A[v] == 2) {
		update(v, -N, 0);
	} else assert(false);
	A[v] = 0;
	return query();
}

int query() {
	int a0, a1;
	seg[1].eval(a0, a1);
	return min(a0, a1);
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 6392 KB Output is correct
2 Correct 7 ms 6264 KB Output is correct
3 Correct 7 ms 6392 KB Output is correct
4 Correct 8 ms 6392 KB Output is correct
5 Correct 8 ms 6392 KB Output is correct
6 Correct 8 ms 6392 KB Output is correct
7 Correct 7 ms 6392 KB Output is correct
8 Correct 8 ms 6392 KB Output is correct
9 Correct 8 ms 6392 KB Output is correct
10 Correct 8 ms 6396 KB Output is correct
11 Correct 7 ms 6392 KB Output is correct
12 Correct 7 ms 6392 KB Output is correct
13 Correct 8 ms 6392 KB Output is correct
14 Correct 7 ms 6392 KB Output is correct
15 Correct 7 ms 6392 KB Output is correct
16 Correct 8 ms 6392 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 6392 KB Output is correct
2 Correct 7 ms 6264 KB Output is correct
3 Correct 7 ms 6392 KB Output is correct
4 Correct 8 ms 6392 KB Output is correct
5 Correct 8 ms 6392 KB Output is correct
6 Correct 8 ms 6392 KB Output is correct
7 Correct 7 ms 6392 KB Output is correct
8 Correct 8 ms 6392 KB Output is correct
9 Correct 8 ms 6392 KB Output is correct
10 Correct 8 ms 6396 KB Output is correct
11 Correct 7 ms 6392 KB Output is correct
12 Correct 7 ms 6392 KB Output is correct
13 Correct 8 ms 6392 KB Output is correct
14 Correct 7 ms 6392 KB Output is correct
15 Correct 7 ms 6392 KB Output is correct
16 Correct 8 ms 6392 KB Output is correct
17 Correct 8 ms 6520 KB Output is correct
18 Correct 10 ms 6520 KB Output is correct
19 Correct 11 ms 6392 KB Output is correct
20 Correct 8 ms 6392 KB Output is correct
21 Correct 8 ms 6392 KB Output is correct
22 Correct 8 ms 6392 KB Output is correct
23 Correct 9 ms 6536 KB Output is correct
24 Correct 9 ms 6520 KB Output is correct
25 Correct 9 ms 6392 KB Output is correct
26 Correct 8 ms 6392 KB Output is correct
27 Correct 8 ms 6392 KB Output is correct
28 Correct 8 ms 6520 KB Output is correct
29 Correct 9 ms 6520 KB Output is correct
30 Correct 8 ms 6392 KB Output is correct
31 Correct 8 ms 6520 KB Output is correct
32 Correct 8 ms 6392 KB Output is correct

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 6392 KB Output is correct
2 Correct 7 ms 6264 KB Output is correct
3 Correct 7 ms 6392 KB Output is correct
4 Correct 8 ms 6392 KB Output is correct
5 Correct 8 ms 6392 KB Output is correct
6 Correct 8 ms 6392 KB Output is correct
7 Correct 7 ms 6392 KB Output is correct
8 Correct 8 ms 6392 KB Output is correct
9 Correct 8 ms 6392 KB Output is correct
10 Correct 8 ms 6396 KB Output is correct
11 Correct 7 ms 6392 KB Output is correct
12 Correct 7 ms 6392 KB Output is correct
13 Correct 8 ms 6392 KB Output is correct
14 Correct 7 ms 6392 KB Output is correct
15 Correct 7 ms 6392 KB Output is correct
16 Correct 8 ms 6392 KB Output is correct
17 Correct 8 ms 6520 KB Output is correct
18 Correct 10 ms 6520 KB Output is correct
19 Correct 11 ms 6392 KB Output is correct
20 Correct 8 ms 6392 KB Output is correct
21 Correct 8 ms 6392 KB Output is correct
22 Correct 8 ms 6392 KB Output is correct
23 Correct 9 ms 6536 KB Output is correct
24 Correct 9 ms 6520 KB Output is correct
25 Correct 9 ms 6392 KB Output is correct
26 Correct 8 ms 6392 KB Output is correct
27 Correct 8 ms 6392 KB Output is correct
28 Correct 8 ms 6520 KB Output is correct
29 Correct 9 ms 6520 KB Output is correct
30 Correct 8 ms 6392 KB Output is correct
31 Correct 8 ms 6520 KB Output is correct
32 Correct 8 ms 6392 KB Output is correct
33 Correct 102 ms 13720 KB Output is correct
34 Correct 73 ms 14968 KB Output is correct
35 Correct 93 ms 12300 KB Output is correct
36 Correct 174 ms 18620 KB Output is correct
37 Correct 29 ms 10232 KB Output is correct
38 Correct 189 ms 19852 KB Output is correct
39 Correct 194 ms 19944 KB Output is correct
40 Correct 201 ms 20008 KB Output is correct
41 Correct 191 ms 19944 KB Output is correct
42 Correct 190 ms 19920 KB Output is correct
43 Correct 191 ms 19812 KB Output is correct
44 Correct 209 ms 20036 KB Output is correct
45 Correct 199 ms 20068 KB Output is correct
46 Correct 198 ms 20152 KB Output is correct
47 Correct 196 ms 20076 KB Output is correct
48 Correct 89 ms 16832 KB Output is correct
49 Correct 102 ms 19184 KB Output is correct
50 Correct 33 ms 9336 KB Output is correct
51 Correct 43 ms 11508 KB Output is correct
52 Correct 24 ms 9080 KB Output is correct
53 Correct 132 ms 19216 KB Output is correct
54 Correct 67 ms 12208 KB Output is correct
55 Correct 144 ms 16240 KB Output is correct
56 Correct 89 ms 13088 KB Output is correct
57 Correct 138 ms 18168 KB Output is correct
58 Correct 37 ms 11964 KB Output is correct
59 Correct 42 ms 11128 KB Output is correct
60 Correct 92 ms 17632 KB Output is correct
61 Correct 100 ms 18024 KB Output is correct
62 Correct 69 ms 15984 KB Output is correct
63 Correct 54 ms 15480 KB Output is correct
64 Correct 60 ms 17656 KB Output is correct
65 Correct 94 ms 24724 KB Output is correct
66 Correct 48 ms 11128 KB Output is correct
67 Correct 72 ms 18936 KB Output is correct
68 Correct 121 ms 23544 KB Output is correct
69 Correct 26 ms 8184 KB Output is correct
70 Correct 12 ms 6648 KB Output is correct
71 Correct 57 ms 15128 KB Output is correct
72 Correct 90 ms 22264 KB Output is correct
73 Correct 146 ms 26332 KB Output is correct
74 Correct 143 ms 22776 KB Output is correct
75 Correct 138 ms 26652 KB Output is correct
76 Correct 135 ms 26292 KB Output is correct
77 Correct 145 ms 23332 KB Output is correct