oj.uz

답안 #388429

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
388429 2021-04-11T12:56:33 Z pure_mem Cats or Dogs (JOI18_catdog) C++14
100 / 100
 1101 ms 24764 KB 
#include "catdog.h"
#include <bits/stdc++.h>

#define X first
#define Y second
#define MP make_pair

using namespace std;

const int MAXN = 1e5 + 12;

struct node{
	bool trash = 0;
	int	t[2][2] = {{MAXN, MAXN}, {MAXN, MAXN}};
}t[MAXN * 4];

node merge(const node &x, const node &y){
	if(x.trash)
		return y;
	else if(y.trash)
		return x;
	node tmp;
	for(int i1 = 0;i1 < 2;i1++){
		for(int j1 = 0;j1 < 2;j1++){
			for(int i2 = 0;i2 < 2;i2++){
				for(int j2 = 0;j2 < 2;j2++){
					tmp.t[i1][j2] = min(tmp.t[i1][j2], x.t[i1][j1] + (j1 != i2) + y.t[i2][j2]);
				}
			}
		}
	}
	return tmp;
}

int n, sz[MAXN], parent[MAXN], cl[MAXN];
int hldPtr, hldCnt, hld[MAXN], hldSt[MAXN], hldFin[MAXN], hldCmp[MAXN], hldId[MAXN];
vector< int > graph[MAXN];
pair< int, int > dp[MAXN];

void build(int v, int tl, int tr){
	if(tl == tr){
		t[v].t[0][0] = t[v].t[1][1] = 0;
		return;
	}
	int tm = (tl + tr) / 2;
	build(v * 2, tl, tm);
	build(v * 2 + 1, tm + 1, tr);
	t[v] = merge(t[v * 2], t[v * 2 + 1]);
}

void upd(int v, int tl, int tr, int pos){
	if(tl > pos || pos > tr)
		return;
	if(tl == tr){
		t[v].t[0][0] = t[v].t[1][1] = MAXN;
		if(cl[hld[tl]] != 2)
			t[v].t[0][0] = dp[hld[tl]].X;
		if(cl[hld[tl]] != 1)
			t[v].t[1][1] = dp[hld[tl]].Y;
		return;
	}
	int tm = (tl + tr) / 2;
	upd(v * 2, tl, tm, pos);
	upd(v * 2 + 1, tm + 1, tr, pos);
	t[v] = merge(t[v * 2], t[v * 2 + 1]);    
}

node get(int v, int tl, int tr, int l, int r){
	if(tl > r || l > tr)
		return t[0];
	if(tl >= l && tr <= r)
		return t[v];
	int tm = (tl + tr) / 2;
	return merge(get(v * 2, tl, tm, l, r), get(v * 2 + 1, tm + 1, tr, l, r));
}

void dfs_sz(int v, int pr){
	sz[v] = 1, parent[v] = pr;
	for(int to: graph[v]){
		if(to != pr){
			dfs_sz(to, v);
			sz[v] += sz[to];
		}
	}
}

void dfs(int v, int pr){
	hldPtr++;
	hld[hldPtr] = v, hldId[v] = hldPtr, hldCmp[v] = hldCnt;
	if(hldSt[hldCnt] == 0)
		hldSt[hldCnt] = v;
	int mx = 0;
	for(int to: graph[v]){
		if(to != pr && sz[mx] < sz[to])
			mx = to;
	}
	if(mx)
		dfs(mx, v);
	else
		hldFin[hldCnt] = v;
	for(int to: graph[v]){
		if(to != pr && to != mx)
			hldCnt++, dfs(to, v);
	}
} 

void initialize(int N, vector<int> A, vector<int> B) {
	n = N, t[0].trash = 1;
	for(int i = 0;i < n - 1;i++){
		graph[A[i]].push_back(B[i]);
		graph[B[i]].push_back(A[i]);
	}
	dfs_sz(1, -1);
	dfs(1, 1);
	build(1, 1, n);
}
   
int solve(int v, int _cl){
	int tmpV = v;
	while(v != -1){
		int vSt = hldSt[hldCmp[v]], vFin = hldFin[hldCmp[v]];
		node tmp = get(1, 1, n, hldId[vSt], hldId[vFin]);
		if(vSt != 1){
			dp[parent[vSt]].X -= min(min(tmp.t[0][0], tmp.t[0][1]), min(tmp.t[1][0], tmp.t[1][1]) + 1);
			dp[parent[vSt]].Y -= min(min(tmp.t[0][0], tmp.t[0][1]) + 1, min(tmp.t[1][0], tmp.t[1][1]));
		}
		v = parent[vSt];	
	}	
	v = tmpV, cl[v] = _cl;
	while(v != -1){
		int vSt = hldSt[hldCmp[v]], vFin = hldFin[hldCmp[v]];
		upd(1, 1, n, hldId[v]);
		node tmp = get(1, 1, n, hldId[vSt], hldId[vFin]);
		if(vSt != 1){
			dp[parent[vSt]].X += min(min(tmp.t[0][0], tmp.t[0][1]), min(tmp.t[1][0], tmp.t[1][1]) + 1);
			dp[parent[vSt]].Y += min(min(tmp.t[0][0], tmp.t[0][1]) + 1, min(tmp.t[1][0], tmp.t[1][1]));
		}
		else{
			return min(min(tmp.t[0][0], tmp.t[0][1]), min(tmp.t[1][0], tmp.t[1][1]));
		}
		v = parent[vSt];
	}
}

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

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

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

Compilation message

catdog.cpp: In function 'int solve(int, int)':
catdog.cpp:143:1: warning: control reaches end of non-void function [-Wreturn-type]
  143 | }
      | ^

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 5 ms 2764 KB Output is correct
18 Correct 5 ms 2764 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 3 ms 2636 KB Output is correct
22 Correct 4 ms 2672 KB Output is correct
23 Correct 5 ms 2764 KB Output is correct
24 Correct 5 ms 2764 KB Output is correct
25 Correct 4 ms 2764 KB Output is correct
26 Correct 3 ms 2636 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 2 ms 2764 KB Output is correct
29 Correct 3 ms 2764 KB Output is correct
30 Correct 3 ms 2636 KB Output is correct
31 Correct 2 ms 2764 KB Output is correct
32 Correct 3 ms 2672 KB Output is correct
33 Correct 614 ms 11400 KB Output is correct
34 Correct 179 ms 11136 KB Output is correct
35 Correct 581 ms 9480 KB Output is correct
36 Correct 917 ms 17932 KB Output is correct
37 Correct 23 ms 6768 KB Output is correct
38 Correct 1062 ms 18824 KB Output is correct
39 Correct 1101 ms 18832 KB Output is correct
40 Correct 1014 ms 18844 KB Output is correct
41 Correct 1057 ms 18868 KB Output is correct
42 Correct 954 ms 18848 KB Output is correct
43 Correct 1012 ms 18828 KB Output is correct
44 Correct 927 ms 18808 KB Output is correct
45 Correct 985 ms 18844 KB Output is correct
46 Correct 999 ms 18876 KB Output is correct
47 Correct 1051 ms 18924 KB Output is correct
48 Correct 287 ms 15508 KB Output is correct
49 Correct 275 ms 17260 KB Output is correct
50 Correct 106 ms 6252 KB Output is correct
51 Correct 116 ms 9012 KB Output is correct
52 Correct 45 ms 5836 KB Output is correct
53 Correct 417 ms 17204 KB Output is correct
54 Correct 303 ms 9724 KB Output is correct
55 Correct 826 ms 15708 KB Output is correct
56 Correct 507 ms 10512 KB Output is correct
57 Correct 684 ms 17028 KB Output is correct
58 Correct 41 ms 9076 KB Output is correct
59 Correct 108 ms 7496 KB Output is correct
60 Correct 241 ms 16396 KB Output is correct
61 Correct 276 ms 16852 KB Output is correct
62 Correct 155 ms 14768 KB Output is correct
63 Correct 74 ms 12176 KB Output is correct
64 Correct 77 ms 13876 KB Output is correct
65 Correct 90 ms 21224 KB Output is correct
66 Correct 160 ms 7588 KB Output is correct
67 Correct 110 ms 17392 KB Output is correct
68 Correct 248 ms 21704 KB Output is correct
69 Correct 60 ms 4548 KB Output is correct
70 Correct 17 ms 2892 KB Output is correct
71 Correct 101 ms 11900 KB Output is correct
72 Correct 146 ms 19744 KB Output is correct
73 Correct 482 ms 24764 KB Output is correct
74 Correct 515 ms 21220 KB Output is correct
75 Correct 281 ms 24712 KB Output is correct
76 Correct 271 ms 23396 KB Output is correct
77 Correct 520 ms 21664 KB Output is correct