oj.uz

답안 #848259

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848259 2023-09-11T20:41:12 Z damot67679 Cats or Dogs (JOI18_catdog) C++14
100 / 100
 302 ms 25936 KB 
#include "catdog.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

vector<int> adj[N];

int par[N], chain[N], head[N], tail[N], tin[N], sz[N];
int tchain = 0, tcur = 0, n;

void dfs_size(int x, int p) {
	sz[x] = 1;
	par[x] = p;
	for (int y: adj[x]) {
		if (y == p) continue;
		dfs_size(y, x);
		sz[x] += sz[y];
	}
}

void dfs(int x) {
	tin[x] = ++tcur;	
	if (!chain[x]) {
		chain[x] = ++tchain;
		head[tchain] = x;
	}
	tail[chain[x]] = x;
	int spec = -1;
	for (int y: adj[x]) {
		if (y == par[x]) continue;
		if (spec == -1 || sz[y] > sz[spec])
			spec = y;
	}
	if (spec != -1) {
		chain[spec] = tchain;
		dfs(spec);
	}
	for (int y: adj[x])
		if (y != par[x] && y != spec)
			dfs(y);
}

const int INF = 1e9;
struct Node {
	int val[2][2];
	
	Node() = default;
	
	Node(bool set_inf) {
		if (set_inf) {
			for (int a: {0, 1})
				for (int b: {0, 1})
					val[a][b] = INF;
		}
	}
	
	int res() const {
		int ans = INF;
		for (int a: {0, 1})
			for (int b: {0, 1})
				ans = min(ans, val[a][b]);
		return ans;
	}
	
	Node operator + (const Node &other) const {
		Node ans;
		for (int a = 0; a < 2; a++) {
			for (int d = 0; d < 2; d++) {
				int cur = INF;
				for (int b = 0; b < 2; b++)
					for (int c = 0; c < 2; c++)
						cur = min(cur, val[a][b] + other.val[c][d] + (b != c));
				ans.val[a][d] = cur;
			}
		}
		return ans;
	}
} IT[N << 2];

int dp[N][2]; // only consider vertices NOT in heavy chain, segment tree will consider the rest + dp
int up_par[N][2]; // for chain_head to update dp[par]'s values

Node node_inf(true);

void build(int id, int l, int r) {
	if (l == r) {
		for (int a: {0, 1})
			for (int b: {0, 1})
				IT[id].val[a][b] = (a != b ? INF : 0);
		return;
	}
	int mid = (l + r) / 2;
	build(id << 1, l, mid);
	build(id << 1 | 1, mid + 1, r);
	IT[id] = IT[id << 1] + IT[id << 1 | 1];
}

void initialize(int n, vector<int> A, vector<int> B) {
	::n = n;
	for (int i = 0; i < n - 1; i++) {
		int x = A[i], y = B[i];
		adj[x].emplace_back(y);
		adj[y].emplace_back(x);
	}
	dfs_size(1, 0);
	dfs(1);
	build(1, 1, n);
}

void invalid_color(int x, int c, int id, int l, int r) {
	if (l == r) {
		// if (c ^ color) == 0 => skip
		IT[id] = node_inf;
		for (int col: {0, 1})
			if ((col + 1) ^ c)
				IT[id].val[col][col] = dp[x][col];
		return;
	}
	int mid = (l + r) / 2;
	if (x <= mid) invalid_color(x, c, id << 1, l, mid);
	else invalid_color(x, c, id << 1 | 1, mid + 1, r);
	IT[id] = IT[id << 1] + IT[id << 1 | 1];
}

void update_val(int x, int w[], int id, int l, int r) {
	if (l == r) {
		for (int c: {0, 1})
			if (IT[id].val[c][c] != INF)
				IT[id].val[c][c] += w[c];
		return;
	}
	int mid = (l + r) / 2;
	if (x <= mid) update_val(x, w, id << 1, l, mid);
	else update_val(x, w, id << 1 | 1, mid + 1, r);
	IT[id] = IT[id << 1] + IT[id << 1 | 1];
}

Node get_range(int x, int y, int id, int l, int r) {
	if (x <= l && r <= y) return IT[id];
	int mid = (l + r) / 2;
	if (y <= mid) return get_range(x, y, id << 1, l, mid);
	if (x > mid) return get_range(x, y, id << 1 | 1, mid + 1, r);
	return get_range(x, y, id << 1, l, mid) + get_range(x, y, id << 1 | 1, mid + 1, r);
}

int get(int x) {
	int xchain = chain[x], head_ = head[xchain], tail_ = tail[xchain];
	while (xchain != 1) {
		auto S = get_range(tin[head_], tin[tail_], 1, 1, n);
		int val[] = {min(S.val[0][0], S.val[0][1]), min(S.val[1][0], S.val[1][1])};
		int upd[] = {-up_par[tin[head_]][0] + min(val[0], val[1] + 1), 
								 -up_par[tin[head_]][1] + min(val[0] + 1, val[1])};
		update_val(tin[par[head_]], upd, 1, 1, n);
		dp[tin[par[head_]]][0] += upd[0];
		dp[tin[par[head_]]][1] += upd[1];
		up_par[tin[head_]][0] = min(val[0], val[1] + 1);
		up_par[tin[head_]][1] = min(val[0] + 1, val[1]);
		xchain = chain[par[head_]];
		tail_ = tail[xchain];
		head_ = head[xchain];
	}
	return get_range(tin[head_], tin[tail_], 1, 1, n).res();
}

int solve(int s, int c) {
	invalid_color(tin[s], c, 1, 1, n);
	return get(s);
}

int cat(int v) {
  return solve(v, 2);
}

int dog(int v) {
  return solve(v, 1);
}

int neighbor(int v) {
  return solve(v, 0);
}

#ifdef LOCAL
int readInt(){
	int i;
	if(scanf("%d",&i)!=1){
		fprintf(stderr,"Error while reading input\n");
		exit(1);
	}
	return i;
}

int main(){
	int N=readInt();
	
	std::vector<int> A(N-1),B(N-1);
	for(int i=0;i<N-1;i++)
	{
		A[i]=readInt();
		B[i]=readInt();
	}
	int Q;
	assert(scanf("%d",&Q)==1);
	std::vector <int> T(Q),V(Q);
	for(int i=0;i<Q;i++)
	{
		T[i]=readInt();
		V[i]=readInt();
	}
	
	initialize(N,A,B);
	
	std::vector<int> res(Q);
	for(int j=0;j<Q;j++)
	{
		if(T[j]==1) res[j]=cat(V[j]);
		else if(T[j]==2) res[j]=dog(V[j]);
		else res[j]=neighbor(V[j]);
	}
	for(int j=0;j<Q;j++)
		printf("%d\n",res[j]);
	return 0;
}
#endif

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8536 KB Output is correct
3 Correct 1 ms 8740 KB Output is correct
4 Correct 1 ms 8536 KB Output is correct
5 Correct 1 ms 8536 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8536 KB Output is correct
9 Correct 1 ms 8536 KB Output is correct
10 Correct 1 ms 8536 KB Output is correct
11 Correct 1 ms 8536 KB Output is correct
12 Correct 1 ms 8536 KB Output is correct
13 Correct 1 ms 8536 KB Output is correct
14 Correct 1 ms 8536 KB Output is correct
15 Correct 1 ms 8536 KB Output is correct
16 Correct 1 ms 8536 KB Output is correct
17 Correct 2 ms 8536 KB Output is correct
18 Correct 2 ms 8536 KB Output is correct
19 Correct 2 ms 8536 KB Output is correct
20 Correct 1 ms 8536 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 8536 KB Output is correct
23 Correct 2 ms 8536 KB Output is correct
24 Correct 2 ms 8536 KB Output is correct
25 Correct 2 ms 8536 KB Output is correct
26 Correct 2 ms 8536 KB Output is correct
27 Correct 1 ms 8536 KB Output is correct
28 Correct 2 ms 8536 KB Output is correct
29 Correct 2 ms 8536 KB Output is correct
30 Correct 2 ms 8536 KB Output is correct
31 Correct 1 ms 8536 KB Output is correct
32 Correct 2 ms 8536 KB Output is correct
33 Correct 182 ms 14016 KB Output is correct
34 Correct 59 ms 13904 KB Output is correct
35 Correct 170 ms 13384 KB Output is correct
36 Correct 285 ms 18144 KB Output is correct
37 Correct 15 ms 12120 KB Output is correct
38 Correct 299 ms 18608 KB Output is correct
39 Correct 294 ms 18492 KB Output is correct
40 Correct 301 ms 18616 KB Output is correct
41 Correct 297 ms 18752 KB Output is correct
42 Correct 288 ms 18660 KB Output is correct
43 Correct 284 ms 18492 KB Output is correct
44 Correct 271 ms 18492 KB Output is correct
45 Correct 278 ms 18496 KB Output is correct
46 Correct 279 ms 18492 KB Output is correct
47 Correct 302 ms 18748 KB Output is correct
48 Correct 88 ms 17072 KB Output is correct
49 Correct 92 ms 17912 KB Output is correct
50 Correct 37 ms 12056 KB Output is correct
51 Correct 40 ms 12784 KB Output is correct
52 Correct 17 ms 11864 KB Output is correct
53 Correct 123 ms 17744 KB Output is correct
54 Correct 101 ms 12992 KB Output is correct
55 Correct 250 ms 17020 KB Output is correct
56 Correct 159 ms 13660 KB Output is correct
57 Correct 204 ms 17488 KB Output is correct
58 Correct 17 ms 12756 KB Output is correct
59 Correct 36 ms 12880 KB Output is correct
60 Correct 80 ms 17488 KB Output is correct
61 Correct 88 ms 17720 KB Output is correct
62 Correct 54 ms 16592 KB Output is correct
63 Correct 30 ms 15960 KB Output is correct
64 Correct 33 ms 17240 KB Output is correct
65 Correct 43 ms 22864 KB Output is correct
66 Correct 55 ms 13392 KB Output is correct
67 Correct 45 ms 20048 KB Output is correct
68 Correct 90 ms 22864 KB Output is correct
69 Correct 23 ms 9820 KB Output is correct
70 Correct 6 ms 8792 KB Output is correct
71 Correct 40 ms 15696 KB Output is correct
72 Correct 58 ms 21840 KB Output is correct
73 Correct 167 ms 25936 KB Output is correct
74 Correct 168 ms 22352 KB Output is correct
75 Correct 111 ms 25680 KB Output is correct
76 Correct 106 ms 24400 KB Output is correct
77 Correct 167 ms 22772 KB Output is correct