oj.uz

Submission #347201

# Submission time Handle Problem Language Result Execution time Memory
347201 2021-01-12T11:12:39 Z MahdiBahramian Cat in a tree (BOI17_catinatree) C++11
51 / 100
 1000 ms 163576 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O2,unroll-loops")
#define F first
#define S second
#define var auto
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
typedef long long ll;
//#define int ll
typedef pair<int,int> pii;
const int Max = 1e6 + 10;
const int Mod = 1e9 + 7;

vector<int> N[Max];
int sub[Max];
int dist[Max];
vector<pii> D[Max];
bool hide[Max];
int ANS[Max];
int h[Max];

int pre(const int & v , const int & p)
{
	sub[v] = 1;
	for(int u : N[v]) if(!hide[u] && u != p) sub[v] += pre(u , v);
	return sub[v];
}
void DIST(const int & v , const int & p , const int & c)
{
	D[v].pb(mp(c , dist[v]));
	for(int u : N[v]) if(!hide[u] && u != p) {dist[u] = dist[v] + 1 ; DIST(u , v , c);};
}
int find_centroid(const int & v , const int &p , const int & sz)
{
	for(int u : N[v]) if(!hide[u] && u != p && 2 * sub[v] > sz) return find_centroid(u , v , sz);
	return v;
}

void centroid_tree(int v)
{
	pre(v , v);
	v = find_centroid(v , v , sub[v]);
	dist[v] = 0;
	DIST(v , v , v);
	hide[v] = true;
	for(int u : N[v]) if(!hide[u]) centroid_tree(u);
}


void use(int v)
{
	for(pii x : D[v]) ANS[x.F] = min(ANS[x.F] , x.S);
}
int get(int v)
{
	int ans = 100000000;
	for(pii x : D[v]) ans = min(ans , x.S + ANS[x.F]);
	return ans;
}

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n , d;cin >> n >> d;
	set<pii , greater<pii>> st;
	st.ins(mp(0 , 0));
	for(int i = 1 ; i < n ; i++)
	{
		int p;cin >> p;
		h[i] = h[p] + 1;
		st.ins(mp(h[i] , i));
		N[p].pb(i);
		N[i].pb(p);
	}

	centroid_tree(0);
	for(int i = 0 ; i < n ; i++) ANS[i] = 100000000;

	int RES = 0;
	while(st.size())
	{
		int v= st.begin()->S;
		if(get(v) >= d)
		{
			RES++;
			use(v);
		}
		st.erase(st.begin());
	}
	cout << RES << '\n';
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 47340 KB Output is correct
2 Correct 35 ms 47340 KB Output is correct
3 Correct 32 ms 47340 KB Output is correct
4 Correct 32 ms 47340 KB Output is correct
5 Correct 32 ms 47360 KB Output is correct
6 Correct 32 ms 47340 KB Output is correct
7 Correct 33 ms 47340 KB Output is correct
8 Correct 33 ms 47340 KB Output is correct
9 Correct 33 ms 47340 KB Output is correct
10 Correct 32 ms 47340 KB Output is correct
11 Correct 32 ms 47340 KB Output is correct
12 Correct 32 ms 47340 KB Output is correct
13 Correct 32 ms 47360 KB Output is correct
14 Correct 32 ms 47340 KB Output is correct
15 Correct 34 ms 47340 KB Output is correct
16 Correct 33 ms 47340 KB Output is correct
17 Correct 33 ms 47468 KB Output is correct
18 Correct 32 ms 47340 KB Output is correct
19 Correct 32 ms 47468 KB Output is correct
20 Correct 33 ms 47340 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 47340 KB Output is correct
2 Correct 35 ms 47340 KB Output is correct
3 Correct 32 ms 47340 KB Output is correct
4 Correct 32 ms 47340 KB Output is correct
5 Correct 32 ms 47360 KB Output is correct
6 Correct 32 ms 47340 KB Output is correct
7 Correct 33 ms 47340 KB Output is correct
8 Correct 33 ms 47340 KB Output is correct
9 Correct 33 ms 47340 KB Output is correct
10 Correct 32 ms 47340 KB Output is correct
11 Correct 32 ms 47340 KB Output is correct
12 Correct 32 ms 47340 KB Output is correct
13 Correct 32 ms 47360 KB Output is correct
14 Correct 32 ms 47340 KB Output is correct
15 Correct 34 ms 47340 KB Output is correct
16 Correct 33 ms 47340 KB Output is correct
17 Correct 33 ms 47468 KB Output is correct
18 Correct 32 ms 47340 KB Output is correct
19 Correct 32 ms 47468 KB Output is correct
20 Correct 33 ms 47340 KB Output is correct
21 Correct 35 ms 47852 KB Output is correct
22 Correct 38 ms 47468 KB Output is correct
23 Correct 34 ms 47468 KB Output is correct
24 Correct 33 ms 47468 KB Output is correct
25 Correct 34 ms 47596 KB Output is correct
26 Correct 34 ms 47596 KB Output is correct
27 Correct 33 ms 47596 KB Output is correct
28 Correct 35 ms 47724 KB Output is correct
29 Correct 37 ms 47724 KB Output is correct
30 Correct 35 ms 47724 KB Output is correct
31 Correct 35 ms 47724 KB Output is correct
32 Correct 35 ms 47852 KB Output is correct
33 Correct 35 ms 47852 KB Output is correct
34 Correct 35 ms 47724 KB Output is correct
35 Correct 34 ms 47644 KB Output is correct
36 Correct 36 ms 47724 KB Output is correct
37 Correct 38 ms 47744 KB Output is correct
38 Correct 34 ms 47724 KB Output is correct
39 Correct 34 ms 47724 KB Output is correct
40 Correct 35 ms 47852 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 47340 KB Output is correct
2 Correct 35 ms 47340 KB Output is correct
3 Correct 32 ms 47340 KB Output is correct
4 Correct 32 ms 47340 KB Output is correct
5 Correct 32 ms 47360 KB Output is correct
6 Correct 32 ms 47340 KB Output is correct
7 Correct 33 ms 47340 KB Output is correct
8 Correct 33 ms 47340 KB Output is correct
9 Correct 33 ms 47340 KB Output is correct
10 Correct 32 ms 47340 KB Output is correct
11 Correct 32 ms 47340 KB Output is correct
12 Correct 32 ms 47340 KB Output is correct
13 Correct 32 ms 47360 KB Output is correct
14 Correct 32 ms 47340 KB Output is correct
15 Correct 34 ms 47340 KB Output is correct
16 Correct 33 ms 47340 KB Output is correct
17 Correct 33 ms 47468 KB Output is correct
18 Correct 32 ms 47340 KB Output is correct
19 Correct 32 ms 47468 KB Output is correct
20 Correct 33 ms 47340 KB Output is correct
21 Correct 35 ms 47852 KB Output is correct
22 Correct 38 ms 47468 KB Output is correct
23 Correct 34 ms 47468 KB Output is correct
24 Correct 33 ms 47468 KB Output is correct
25 Correct 34 ms 47596 KB Output is correct
26 Correct 34 ms 47596 KB Output is correct
27 Correct 33 ms 47596 KB Output is correct
28 Correct 35 ms 47724 KB Output is correct
29 Correct 37 ms 47724 KB Output is correct
30 Correct 35 ms 47724 KB Output is correct
31 Correct 35 ms 47724 KB Output is correct
32 Correct 35 ms 47852 KB Output is correct
33 Correct 35 ms 47852 KB Output is correct
34 Correct 35 ms 47724 KB Output is correct
35 Correct 34 ms 47644 KB Output is correct
36 Correct 36 ms 47724 KB Output is correct
37 Correct 38 ms 47744 KB Output is correct
38 Correct 34 ms 47724 KB Output is correct
39 Correct 34 ms 47724 KB Output is correct
40 Correct 35 ms 47852 KB Output is correct
41 Execution timed out 1100 ms 163576 KB Time limit exceeded
42 Halted 0 ms 0 KB -