oj.uz

Submission #469109

# Submission time Handle Problem Language Result Execution time Memory
469109 2021-08-30T18:29:40 Z wind_reaper Cat in a tree (BOI17_catinatree) C++17
100 / 100
 92 ms 24940 KB 
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
*/

using namespace std;
// using namespace __gnu_pbds;
using namespace chrono;

// mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
*/

//***************** CONSTANTS *****************

const int MXN = 200000;

//***************** GLOBAL VARIABLES *****************

vector<int> g[MXN];
int ans = 0;
int N, D, d[MXN];

//***************** AUXILIARY STRUCTS *****************



//***************** MAIN BODY *****************

int dfs(int u, int p){
	vector<int> t = {0};
	ans++;

	for(int v : g[u]) if(v != p){
		t.push_back(dfs(v, u) + 1);
	}

	sort(t.begin(), t.end());

	for(int i = t.size() - 1; i >= 1; --i){
		if(t[i] + t[i - 1] < D){
			ans -= i;
			return t[i];
		}
	}

	return t[0];
}

void solve(){
	cin >> N >> D;

	for(int i = 1; i < N; i++){
		int x;
		cin >> x;
		g[x].push_back(i);
	}

	dfs(0, 0);

	cout << ans << '\n';
}

//***************** *****************

int32_t main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);

	#ifdef LOCAL
		auto begin = high_resolution_clock::now();
	#endif

	int tc = 1;
	// cin >> tc; 
	for (int t = 0; t < tc; t++)
		solve();

	#ifdef LOCAL 
		auto end = high_resolution_clock::now();
		cout << fixed << setprecision(4);
		cout << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
	#endif

	return 0;
}

/*
If code gives a WA, check for the following : 
1. I/O format

2. Are you clearing all global variables in between tests if multitests are a thing

3. Can you definitively prove the logic

4. If the code gives an inexplicable TLE, and you are sure you have the best possible complexity,
use faster io
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 5016 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 5016 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 5012 KB Output is correct
13 Correct 3 ms 4896 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 5016 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 5016 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 4 ms 5304 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 5016 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 4 ms 5016 KB Output is correct
26 Correct 4 ms 4940 KB Output is correct
27 Correct 4 ms 5012 KB Output is correct
28 Correct 4 ms 4940 KB Output is correct
29 Correct 4 ms 5016 KB Output is correct
30 Correct 4 ms 4940 KB Output is correct
31 Correct 3 ms 5020 KB Output is correct
32 Correct 3 ms 5016 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 5 ms 5012 KB Output is correct
35 Correct 3 ms 4940 KB Output is correct
36 Correct 4 ms 5016 KB Output is correct
37 Correct 3 ms 5020 KB Output is correct
38 Correct 3 ms 5020 KB Output is correct
39 Correct 3 ms 5068 KB Output is correct
40 Correct 5 ms 5196 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 5016 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 5016 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 5012 KB Output is correct
13 Correct 3 ms 4896 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 5016 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 5016 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 4 ms 5304 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 5016 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 4 ms 5016 KB Output is correct
26 Correct 4 ms 4940 KB Output is correct
27 Correct 4 ms 5012 KB Output is correct
28 Correct 4 ms 4940 KB Output is correct
29 Correct 4 ms 5016 KB Output is correct
30 Correct 4 ms 4940 KB Output is correct
31 Correct 3 ms 5020 KB Output is correct
32 Correct 3 ms 5016 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 5 ms 5012 KB Output is correct
35 Correct 3 ms 4940 KB Output is correct
36 Correct 4 ms 5016 KB Output is correct
37 Correct 3 ms 5020 KB Output is correct
38 Correct 3 ms 5020 KB Output is correct
39 Correct 3 ms 5068 KB Output is correct
40 Correct 5 ms 5196 KB Output is correct
41 Correct 57 ms 10180 KB Output is correct
42 Correct 37 ms 7068 KB Output is correct
43 Correct 45 ms 7144 KB Output is correct
44 Correct 38 ms 7072 KB Output is correct
45 Correct 33 ms 7112 KB Output is correct
46 Correct 81 ms 9284 KB Output is correct
47 Correct 88 ms 9288 KB Output is correct
48 Correct 89 ms 9288 KB Output is correct
49 Correct 92 ms 9304 KB Output is correct
50 Correct 20 ms 5964 KB Output is correct
51 Correct 20 ms 5988 KB Output is correct
52 Correct 20 ms 5964 KB Output is correct
53 Correct 36 ms 6912 KB Output is correct
54 Correct 46 ms 6884 KB Output is correct
55 Correct 41 ms 6872 KB Output is correct
56 Correct 4 ms 5196 KB Output is correct
57 Correct 10 ms 8780 KB Output is correct
58 Correct 38 ms 22488 KB Output is correct
59 Correct 76 ms 24940 KB Output is correct
60 Correct 53 ms 10692 KB Output is correct
61 Correct 69 ms 10052 KB Output is correct