oj.uz

Submission #882157

# Submission time Handle Problem Language Result Execution time Memory
882157 2023-12-02T17:36:50 Z Karoot Cat in a tree (BOI17_catinatree) C++17
100 / 100
 204 ms 37712 KB 
#include <iostream>
#include <cmath>
#include <unordered_map>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <iomanip>
#include <algorithm>
 
#define all(x)  (x).begin(), (x).end()
#define rall(x)  (x).rbegin(), (x).rend()
 
using namespace std;
 
typedef long long ll;
 
ll linf = 1e15+1;
 
inline void scoobydoobydoo(){
    ios::sync_with_stdio(false);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
}
 
const int MAXN = 2e5+1;
ll depth[MAXN];
multiset<ll> ms[MAXN];
vector<int> adj[MAXN];
int D, n;
 
ll ans = -1;
 
 
void buildTree(int node, int parent, int w){
    depth[node] = w;
    for (auto& e : adj[node]){
        if (e != parent)buildTree(e, node, w+1);
    }
}   
 
void smallerToLarger(int node, int parent){
    ms[node].insert(depth[node]);
    for (auto& e : adj[node]){
        if (e != parent){
            smallerToLarger(e, node);
            //BRO 'TIS INHERENTLI STL :(
 
            //cout << "start " << node << " " << e << endl;
            while (true){
                //BOTH EXIST
                if (ms[e].empty() || ms[node].empty())break;
                //cout << 1 << endl;
                if (*ms[e].begin()+*ms[node].begin()-2*depth[node] >= D)break;
                //cout << 2 << endl;
                //VALID
 
                //PRESERVE SMALLEST DEPTH? LEAST INTERFERABLE?????? Nop, preserve largest???
                //^^tis work (?) I not know
                //cout << "nodes: " << *ms[e].begin() << " " << *ms[node].begin() << endl;
 
                if (*ms[e].begin() > *ms[node].begin())ms[node].erase(ms[node].begin());
                else ms[e].erase(ms[e].begin());
                //cout << ms[e].size() << " " << ms[node].size() << endl;
 
            }
            //Add all ?
            for (auto& x : ms[e]){
                ms[node].insert(x);
            }
            ms[e].clear();
 
        }
    }
    ans = max(ans, (ll)ms[node].size());
}
 
int main(){
    scoobydoobydoo();
    cin >> n >> D;
    for (int i = 1; i < n; i++){
        int a; cin >> a;
        adj[a].push_back(i);
        adj[i].push_back(a);
    }
    buildTree(0, 0, 0);
    smallerToLarger(0, 0);
    cout << ans << endl;
 
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 5 ms 14940 KB Output is correct
5 Correct 4 ms 14936 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 15000 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 4 ms 14940 KB Output is correct
13 Correct 4 ms 14940 KB Output is correct
14 Correct 3 ms 14940 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14936 KB Output is correct
17 Correct 3 ms 14940 KB Output is correct
18 Correct 3 ms 14936 KB Output is correct
19 Correct 4 ms 14996 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 3 ms 15196 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 3 ms 14964 KB Output is correct
24 Correct 3 ms 14936 KB Output is correct
25 Correct 3 ms 14936 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 4 ms 14936 KB Output is correct
28 Correct 3 ms 14940 KB Output is correct
29 Correct 3 ms 14936 KB Output is correct
30 Correct 4 ms 14940 KB Output is correct
31 Correct 3 ms 14940 KB Output is correct
32 Correct 3 ms 15000 KB Output is correct
33 Correct 3 ms 14940 KB Output is correct
34 Correct 3 ms 15000 KB Output is correct
35 Correct 3 ms 14940 KB Output is correct
36 Correct 4 ms 14940 KB Output is correct
37 Correct 4 ms 14964 KB Output is correct
38 Correct 3 ms 14940 KB Output is correct
39 Correct 4 ms 14940 KB Output is correct
40 Correct 13 ms 15192 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 5 ms 14940 KB Output is correct
5 Correct 4 ms 14936 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 15000 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 4 ms 14940 KB Output is correct
13 Correct 4 ms 14940 KB Output is correct
14 Correct 3 ms 14940 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14936 KB Output is correct
17 Correct 3 ms 14940 KB Output is correct
18 Correct 3 ms 14936 KB Output is correct
19 Correct 4 ms 14996 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 3 ms 15196 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 3 ms 14964 KB Output is correct
24 Correct 3 ms 14936 KB Output is correct
25 Correct 3 ms 14936 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 4 ms 14936 KB Output is correct
28 Correct 3 ms 14940 KB Output is correct
29 Correct 3 ms 14936 KB Output is correct
30 Correct 4 ms 14940 KB Output is correct
31 Correct 3 ms 14940 KB Output is correct
32 Correct 3 ms 15000 KB Output is correct
33 Correct 3 ms 14940 KB Output is correct
34 Correct 3 ms 15000 KB Output is correct
35 Correct 3 ms 14940 KB Output is correct
36 Correct 4 ms 14940 KB Output is correct
37 Correct 4 ms 14964 KB Output is correct
38 Correct 3 ms 14940 KB Output is correct
39 Correct 4 ms 14940 KB Output is correct
40 Correct 13 ms 15192 KB Output is correct
41 Correct 54 ms 25332 KB Output is correct
42 Correct 126 ms 26220 KB Output is correct
43 Correct 43 ms 19036 KB Output is correct
44 Correct 37 ms 19484 KB Output is correct
45 Correct 43 ms 18880 KB Output is correct
46 Correct 204 ms 30208 KB Output is correct
47 Correct 78 ms 23728 KB Output is correct
48 Correct 80 ms 23644 KB Output is correct
49 Correct 106 ms 23668 KB Output is correct
50 Correct 24 ms 19256 KB Output is correct
51 Correct 22 ms 19292 KB Output is correct
52 Correct 23 ms 19288 KB Output is correct
53 Correct 59 ms 24104 KB Output is correct
54 Correct 68 ms 24172 KB Output is correct
55 Correct 74 ms 24172 KB Output is correct
56 Correct 13 ms 15224 KB Output is correct
57 Correct 11 ms 18524 KB Output is correct
58 Correct 40 ms 31580 KB Output is correct
59 Correct 79 ms 37712 KB Output is correct
60 Correct 52 ms 25292 KB Output is correct
61 Correct 55 ms 23124 KB Output is correct