oj.uz

Submission #347203

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

vector<int> N[Max];
int sub[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 & d , const int & p , const int & c)
{
	D[v].pb(mp(c , d));
	for(int u : N[v]) if(!hide[u] && u != p) DIST(u , d + 1 , 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 , 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 = 10000000;
	for(pii x : D[v]) if(ANS[x.F] <= 100000) 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;
	vector<pii> st;
	st.pb(mp(0 , 0));
	for(int i = 1 ; i < n ; i++)
	{
		int p;cin >> p;
		h[i] = h[p] + 1;
		st.pb(mp(h[i] , i));
		N[p].pb(i);
		N[i].pb(p);
	}
	//for(int i = 0 ; i < n ; i++) D[i].resize(20);
	centroid_tree(0);
	for(int i = 0 ; i < n ; i++) ANS[i] = 10000000;

	sort(st.begin() , st.end());
	reverse(st.begin() , st.end());
	int RES = 0;
	for(int i = 0; i < n ; i++)
	{
		int v = st[i].S;
		if(get(v) >= d)
		{
			RES++;
			use(v);
		}
	}
	cout << RES << '\n';
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19180 KB Output is correct
2 Correct 13 ms 19180 KB Output is correct
3 Correct 16 ms 19328 KB Output is correct
4 Correct 13 ms 19180 KB Output is correct
5 Correct 13 ms 19180 KB Output is correct
6 Correct 14 ms 19180 KB Output is correct
7 Correct 13 ms 19180 KB Output is correct
8 Correct 14 ms 19180 KB Output is correct
9 Correct 14 ms 19180 KB Output is correct
10 Correct 14 ms 19180 KB Output is correct
11 Correct 13 ms 19180 KB Output is correct
12 Correct 13 ms 19180 KB Output is correct
13 Correct 13 ms 19180 KB Output is correct
14 Correct 13 ms 19180 KB Output is correct
15 Correct 13 ms 19180 KB Output is correct
16 Correct 13 ms 19180 KB Output is correct
17 Correct 13 ms 19180 KB Output is correct
18 Correct 13 ms 19180 KB Output is correct
19 Correct 13 ms 19180 KB Output is correct
20 Correct 13 ms 19180 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19180 KB Output is correct
2 Correct 13 ms 19180 KB Output is correct
3 Correct 16 ms 19328 KB Output is correct
4 Correct 13 ms 19180 KB Output is correct
5 Correct 13 ms 19180 KB Output is correct
6 Correct 14 ms 19180 KB Output is correct
7 Correct 13 ms 19180 KB Output is correct
8 Correct 14 ms 19180 KB Output is correct
9 Correct 14 ms 19180 KB Output is correct
10 Correct 14 ms 19180 KB Output is correct
11 Correct 13 ms 19180 KB Output is correct
12 Correct 13 ms 19180 KB Output is correct
13 Correct 13 ms 19180 KB Output is correct
14 Correct 13 ms 19180 KB Output is correct
15 Correct 13 ms 19180 KB Output is correct
16 Correct 13 ms 19180 KB Output is correct
17 Correct 13 ms 19180 KB Output is correct
18 Correct 13 ms 19180 KB Output is correct
19 Correct 13 ms 19180 KB Output is correct
20 Correct 13 ms 19180 KB Output is correct
21 Correct 15 ms 19564 KB Output is correct
22 Correct 14 ms 19180 KB Output is correct
23 Correct 15 ms 19236 KB Output is correct
24 Correct 14 ms 19180 KB Output is correct
25 Correct 15 ms 19336 KB Output is correct
26 Correct 15 ms 19308 KB Output is correct
27 Correct 15 ms 19308 KB Output is correct
28 Correct 15 ms 19436 KB Output is correct
29 Correct 16 ms 19436 KB Output is correct
30 Correct 15 ms 19436 KB Output is correct
31 Correct 15 ms 19436 KB Output is correct
32 Correct 16 ms 19564 KB Output is correct
33 Correct 16 ms 19692 KB Output is correct
34 Correct 15 ms 19436 KB Output is correct
35 Correct 17 ms 19436 KB Output is correct
36 Correct 17 ms 19436 KB Output is correct
37 Correct 16 ms 19436 KB Output is correct
38 Correct 15 ms 19436 KB Output is correct
39 Correct 15 ms 19436 KB Output is correct
40 Correct 15 ms 19692 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19180 KB Output is correct
2 Correct 13 ms 19180 KB Output is correct
3 Correct 16 ms 19328 KB Output is correct
4 Correct 13 ms 19180 KB Output is correct
5 Correct 13 ms 19180 KB Output is correct
6 Correct 14 ms 19180 KB Output is correct
7 Correct 13 ms 19180 KB Output is correct
8 Correct 14 ms 19180 KB Output is correct
9 Correct 14 ms 19180 KB Output is correct
10 Correct 14 ms 19180 KB Output is correct
11 Correct 13 ms 19180 KB Output is correct
12 Correct 13 ms 19180 KB Output is correct
13 Correct 13 ms 19180 KB Output is correct
14 Correct 13 ms 19180 KB Output is correct
15 Correct 13 ms 19180 KB Output is correct
16 Correct 13 ms 19180 KB Output is correct
17 Correct 13 ms 19180 KB Output is correct
18 Correct 13 ms 19180 KB Output is correct
19 Correct 13 ms 19180 KB Output is correct
20 Correct 13 ms 19180 KB Output is correct
21 Correct 15 ms 19564 KB Output is correct
22 Correct 14 ms 19180 KB Output is correct
23 Correct 15 ms 19236 KB Output is correct
24 Correct 14 ms 19180 KB Output is correct
25 Correct 15 ms 19336 KB Output is correct
26 Correct 15 ms 19308 KB Output is correct
27 Correct 15 ms 19308 KB Output is correct
28 Correct 15 ms 19436 KB Output is correct
29 Correct 16 ms 19436 KB Output is correct
30 Correct 15 ms 19436 KB Output is correct
31 Correct 15 ms 19436 KB Output is correct
32 Correct 16 ms 19564 KB Output is correct
33 Correct 16 ms 19692 KB Output is correct
34 Correct 15 ms 19436 KB Output is correct
35 Correct 17 ms 19436 KB Output is correct
36 Correct 17 ms 19436 KB Output is correct
37 Correct 16 ms 19436 KB Output is correct
38 Correct 15 ms 19436 KB Output is correct
39 Correct 15 ms 19436 KB Output is correct
40 Correct 15 ms 19692 KB Output is correct
41 Execution timed out 1103 ms 127196 KB Time limit exceeded
42 Halted 0 ms 0 KB -