oj.uz

답안 #132535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
132535 2019-07-19T06:47:09 Z 임유진(#3201) Cat in a tree (BOI17_catinatree) C++14
100 / 100
 521 ms 39096 KB 
#include <bits/stdc++.h>
using namespace std;

#define MAXN 200005
#define fi first
#define se second

typedef pair<int, int> pii;

const int INF = MAXN;
int P[MAXN];
vector<int> ed[MAXN];
int par[20][MAXN], dep[MAXN], sz[MAXN];
int cp[MAXN];
pii clo[MAXN][2];
int ds[MAXN];
int xx;

void dfs(int x) {
	sz[x] = 1;
	for(auto a : ed[x]) if(sz[a] == 0) {
		dep[a] = dep[x] + 1;
		par[0][a] = x;
		dfs(a);
		sz[x] += sz[a];
	}
}

void mkct(int x, int N, int p) {
	//if(++xx < 100) printf("mkct(x = %d, N = %d, p = %d)\n", x, N, p);
	while(true) {
		bool b = false;
		for(auto a : ed[x]) if(cp[a] == -2 && sz[a] * 2 > N) {
			b = true;
			sz[x] = N - sz[a];
			x = a;
			break;
		}
		if(!b) break;
	}
	cp[x] = p;
	for(auto a : ed[x]) if(cp[a] == -2) mkct(a, sz[a], x);
}

int lca(int x, int y) {
	if(dep[x] < dep[y]) swap(x, y);
	for(int i = 0; i < 20; i++) if((dep[x] - dep[y]) & (1 << i)) x = par[i][x];
	if(x == y) return x;
	for(int i = 19; i >= 0; i--) if(par[i][x] != par[i][y]) {
		x = par[i][x];
		y = par[i][y];
	}
	return par[0][x];
}

int dis(int x, int y) { return dep[x] + dep[y] - 2 * dep[lca(x, y)]; }

int gclo(int x) {
	int ans = INF;
	for(int c = x; c != -1; c = cp[c])
		ans = min(ans, dis(c, x) + (clo[c][0].se == x ? clo[c][1].fi : clo[c][0].fi));
	return ans;
}

void upd(int x) {
	for(int c = x; c != -1; c = cp[c]) {
		int d = dis(c, x);
		if(clo[c][1].fi > d) clo[c][1] = make_pair(d, x);
		if(clo[c][0].fi > clo[c][1].fi) swap(clo[c][0], clo[c][1]);
	}
}

int main() {
	int N, D;
	int ans = 0;

	scanf("%d%d", &N, &D);
	for(int i = 1; i < N; i++) scanf("%d", P + i);

	for(int i = 1; i < N; i++) {
		ed[P[i]].push_back(i);
		ed[i].push_back(P[i]);
	}

	dfs(0);
	for(int i = 0; i < N; i++) cp[i] = -2;
	for(int i = 1; i < 20; i++) for(int j = 0; j < N; j++) par[i][j] = par[i - 1][par[i - 1][j]];
	mkct(0, N, -1);

	//for(int i = 0; i < N; i++) printf("%d ", cp[i]);
	for(int i = 0; i < N; i++) {
		ds[i] = i;
		clo[i][0] = clo[i][1] = make_pair(INF, -1);
	}
	sort(ds, ds + N, [&](int a, int b) { return dep[a] < dep[b]; } );
	for(int i = N - 1; i >= 0; i--) if(gclo(ds[i]) >= D) {
		ans++;
		upd(ds[i]);
		//printf("i = %d, ds[i] = %d\n", i, ds[i]);
	}

	printf("%d", ans);

	return 0;
}

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:77:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &D);
  ~~~~~^~~~~~~~~~~~~~~~
catinatree.cpp:78:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1; i < N; i++) scanf("%d", P + i);
                             ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5240 KB Output is correct
6 Correct 6 ms 5240 KB Output is correct
7 Correct 11 ms 5144 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5240 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5240 KB Output is correct
13 Correct 6 ms 5212 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 8 ms 5116 KB Output is correct
19 Correct 6 ms 5240 KB Output is correct
20 Correct 6 ms 5240 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5240 KB Output is correct
6 Correct 6 ms 5240 KB Output is correct
7 Correct 11 ms 5144 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5240 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5240 KB Output is correct
13 Correct 6 ms 5212 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 8 ms 5116 KB Output is correct
19 Correct 6 ms 5240 KB Output is correct
20 Correct 6 ms 5240 KB Output is correct
21 Correct 8 ms 5500 KB Output is correct
22 Correct 7 ms 5240 KB Output is correct
23 Correct 6 ms 5240 KB Output is correct
24 Correct 6 ms 5240 KB Output is correct
25 Correct 7 ms 5368 KB Output is correct
26 Correct 7 ms 5368 KB Output is correct
27 Correct 7 ms 5240 KB Output is correct
28 Correct 7 ms 5368 KB Output is correct
29 Correct 8 ms 5368 KB Output is correct
30 Correct 7 ms 5368 KB Output is correct
31 Correct 7 ms 5368 KB Output is correct
32 Correct 7 ms 5368 KB Output is correct
33 Correct 7 ms 5368 KB Output is correct
34 Correct 7 ms 5368 KB Output is correct
35 Correct 11 ms 5364 KB Output is correct
36 Correct 7 ms 5368 KB Output is correct
37 Correct 7 ms 5368 KB Output is correct
38 Correct 8 ms 5368 KB Output is correct
39 Correct 8 ms 5368 KB Output is correct
40 Correct 8 ms 5496 KB Output is correct

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5240 KB Output is correct
6 Correct 6 ms 5240 KB Output is correct
7 Correct 11 ms 5144 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5240 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5240 KB Output is correct
13 Correct 6 ms 5212 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 8 ms 5116 KB Output is correct
19 Correct 6 ms 5240 KB Output is correct
20 Correct 6 ms 5240 KB Output is correct
21 Correct 8 ms 5500 KB Output is correct
22 Correct 7 ms 5240 KB Output is correct
23 Correct 6 ms 5240 KB Output is correct
24 Correct 6 ms 5240 KB Output is correct
25 Correct 7 ms 5368 KB Output is correct
26 Correct 7 ms 5368 KB Output is correct
27 Correct 7 ms 5240 KB Output is correct
28 Correct 7 ms 5368 KB Output is correct
29 Correct 8 ms 5368 KB Output is correct
30 Correct 7 ms 5368 KB Output is correct
31 Correct 7 ms 5368 KB Output is correct
32 Correct 7 ms 5368 KB Output is correct
33 Correct 7 ms 5368 KB Output is correct
34 Correct 7 ms 5368 KB Output is correct
35 Correct 11 ms 5364 KB Output is correct
36 Correct 7 ms 5368 KB Output is correct
37 Correct 7 ms 5368 KB Output is correct
38 Correct 8 ms 5368 KB Output is correct
39 Correct 8 ms 5368 KB Output is correct
40 Correct 8 ms 5496 KB Output is correct
41 Correct 133 ms 33140 KB Output is correct
42 Correct 243 ms 20028 KB Output is correct
43 Correct 161 ms 20088 KB Output is correct
44 Correct 169 ms 20092 KB Output is correct
45 Correct 173 ms 20028 KB Output is correct
46 Correct 513 ms 34520 KB Output is correct
47 Correct 410 ms 34720 KB Output is correct
48 Correct 388 ms 34496 KB Output is correct
49 Correct 403 ms 34552 KB Output is correct
50 Correct 106 ms 20572 KB Output is correct
51 Correct 109 ms 20472 KB Output is correct
52 Correct 103 ms 20344 KB Output is correct
53 Correct 227 ms 35324 KB Output is correct
54 Correct 222 ms 35304 KB Output is correct
55 Correct 243 ms 35300 KB Output is correct
56 Correct 10 ms 5588 KB Output is correct
57 Correct 42 ms 9336 KB Output is correct
58 Correct 224 ms 24136 KB Output is correct
59 Correct 521 ms 39096 KB Output is correct
60 Correct 164 ms 33960 KB Output is correct
61 Correct 323 ms 33096 KB Output is correct