oj.uz

답안 #592435

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
592435 2022-07-09T07:53:08 Z Bobaa Cats or Dogs (JOI18_catdog) C++17
100 / 100
 138 ms 27600 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 4 ms 6356 KB Output is correct
2 Correct 3 ms 6356 KB Output is correct
3 Correct 3 ms 6356 KB Output is correct
4 Correct 3 ms 6340 KB Output is correct
5 Correct 3 ms 6328 KB Output is correct
6 Correct 3 ms 6356 KB Output is correct
7 Correct 4 ms 6356 KB Output is correct
8 Correct 4 ms 6344 KB Output is correct
9 Correct 4 ms 6336 KB Output is correct
10 Correct 4 ms 6356 KB Output is correct
11 Correct 3 ms 6356 KB Output is correct
12 Correct 3 ms 6340 KB Output is correct
13 Correct 3 ms 6356 KB Output is correct
14 Correct 3 ms 6340 KB Output is correct
15 Correct 3 ms 6356 KB Output is correct
16 Correct 3 ms 6356 KB Output is correct

Subtask #2
30.0 / 30.0

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

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6356 KB Output is correct
2 Correct 3 ms 6356 KB Output is correct
3 Correct 3 ms 6356 KB Output is correct
4 Correct 3 ms 6340 KB Output is correct
5 Correct 3 ms 6328 KB Output is correct
6 Correct 3 ms 6356 KB Output is correct
7 Correct 4 ms 6356 KB Output is correct
8 Correct 4 ms 6344 KB Output is correct
9 Correct 4 ms 6336 KB Output is correct
10 Correct 4 ms 6356 KB Output is correct
11 Correct 3 ms 6356 KB Output is correct
12 Correct 3 ms 6340 KB Output is correct
13 Correct 3 ms 6356 KB Output is correct
14 Correct 3 ms 6340 KB Output is correct
15 Correct 3 ms 6356 KB Output is correct
16 Correct 3 ms 6356 KB Output is correct
17 Correct 3 ms 6356 KB Output is correct
18 Correct 4 ms 6356 KB Output is correct
19 Correct 4 ms 6356 KB Output is correct
20 Correct 3 ms 6356 KB Output is correct
21 Correct 3 ms 6356 KB Output is correct
22 Correct 4 ms 6352 KB Output is correct
23 Correct 4 ms 6356 KB Output is correct
24 Correct 4 ms 6356 KB Output is correct
25 Correct 5 ms 6356 KB Output is correct
26 Correct 4 ms 6356 KB Output is correct
27 Correct 3 ms 6356 KB Output is correct
28 Correct 4 ms 6476 KB Output is correct
29 Correct 5 ms 6472 KB Output is correct
30 Correct 3 ms 6356 KB Output is correct
31 Correct 4 ms 6348 KB Output is correct
32 Correct 3 ms 6356 KB Output is correct
33 Correct 68 ms 14040 KB Output is correct
34 Correct 50 ms 14892 KB Output is correct
35 Correct 81 ms 12244 KB Output is correct
36 Correct 107 ms 19348 KB Output is correct
37 Correct 16 ms 10136 KB Output is correct
38 Correct 118 ms 20676 KB Output is correct
39 Correct 135 ms 20696 KB Output is correct
40 Correct 123 ms 20668 KB Output is correct
41 Correct 119 ms 20668 KB Output is correct
42 Correct 123 ms 20660 KB Output is correct
43 Correct 130 ms 20632 KB Output is correct
44 Correct 117 ms 20748 KB Output is correct
45 Correct 114 ms 20716 KB Output is correct
46 Correct 127 ms 20720 KB Output is correct
47 Correct 138 ms 20684 KB Output is correct
48 Correct 54 ms 16948 KB Output is correct
49 Correct 59 ms 19456 KB Output is correct
50 Correct 19 ms 9288 KB Output is correct
51 Correct 24 ms 11516 KB Output is correct
52 Correct 13 ms 8916 KB Output is correct
53 Correct 112 ms 19392 KB Output is correct
54 Correct 44 ms 12120 KB Output is correct
55 Correct 93 ms 16568 KB Output is correct
56 Correct 57 ms 13072 KB Output is correct
57 Correct 83 ms 18768 KB Output is correct
58 Correct 20 ms 11984 KB Output is correct
59 Correct 34 ms 11096 KB Output is correct
60 Correct 57 ms 18204 KB Output is correct
61 Correct 58 ms 18800 KB Output is correct
62 Correct 39 ms 16208 KB Output is correct
63 Correct 29 ms 15436 KB Output is correct
64 Correct 33 ms 17692 KB Output is correct
65 Correct 48 ms 24904 KB Output is correct
66 Correct 32 ms 11084 KB Output is correct
67 Correct 48 ms 19000 KB Output is correct
68 Correct 83 ms 24296 KB Output is correct
69 Correct 15 ms 8156 KB Output is correct
70 Correct 6 ms 6612 KB Output is correct
71 Correct 37 ms 15048 KB Output is correct
72 Correct 50 ms 22540 KB Output is correct
73 Correct 84 ms 27516 KB Output is correct
74 Correct 113 ms 24008 KB Output is correct
75 Correct 83 ms 27600 KB Output is correct
76 Correct 76 ms 27208 KB Output is correct
77 Correct 86 ms 24264 KB Output is correct