oj.uz

Submission #493544

# Submission time Handle Problem Language Result Execution time Memory
493544 2021-12-11T22:31:00 Z nohaxjustsoflo Cat in a tree (BOI17_catinatree) C++17
100 / 100
 213 ms 34768 KB 
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;
//mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//uniform_int_distribution<int> gen; ///(min, max)
//int random() {return gen(mt_rand);}
const int mxN = 5e5+5;
const int mod = 998244353;
const int mxlogN = 20;
const int mxK = 26;
const ll inf = 1e9;

vector<int> adj[mxN];
int down[mxN];
int p[mxN];
int in[mxN], out[mxN], _timer;
void dfs(int i)
{
    in[i] = _timer++;
    for(int j : adj[i])
    {
        if(j==p[i]) continue;
        p[j] = i;
        down[j] = down[i]+1;
        dfs(j);
    }
    out[i] = _timer;
}
struct segTree
{
    struct node
    {
        ll mn;
    };
    int size;
    vector<node> val; /// minimum, sum count
    void build(int n)
    {
        size = 1;
        while(size < n) size <<= 1;
        val = vector<node>(size << 1, {inf});
    }
    void set(int l, int r, ll v, int i, int Lx, int Rx)
    {
        if(Rx <= l || Lx >= r) return;
        if(Lx >= l && Rx <= r)
        {
            val[i].mn = min(val[i].mn, v);
            return;
        }
        int m = (Rx+Lx)/2;
        set(l, r, v, i*2+1, Lx, m);
        set(l, r, v, i*2+2, m, Rx);
    }
    void set(int l, int r, ll v)
    {
        set(l, r, v, 0, 0, size);
    }
    ll query(int pos, int i, int Lx, int Rx)
    {
        if(Rx-Lx==1) return val[i].mn;
        int m = (Rx+Lx)/2;
        if(pos<m) return min(val[i].mn, query(pos, i*2+1, Lx, m));
        return min(val[i].mn, query(pos, i*2+2, m, Rx));
    }
    ll query(int i)
    {
        return query(i, 0, 0, size);
    }
};

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

    int n, d; cin >> n >> d;
    for(int i = 2; i <= n; i++)
    {
        int x; cin >> x; x++;
        adj[x].push_back(i);
        adj[i].push_back(x);
    }
    dfs(1);
    vector<pair<int,int>> v;
    for(int i = 1; i <= n; i++) v.push_back({down[i], i});
    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    segTree tree;
    tree.build(n);
    vector<int> ans;
    for(auto par : v)
    {
        int x = par.second;
        if(tree.query(in[x])+down[x] < d) continue;
        ans.push_back(x);
        int h = 0;
        int H = down[x];
        while(x&&h<=d)
        {
            tree.set(in[x], out[x], H-2*down[x]);
            x = p[x];
            h++;
        }
    }
    cout << ans.size() << "\n";
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 6 ms 11980 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 7 ms 11980 KB Output is correct
5 Correct 7 ms 12060 KB Output is correct
6 Correct 8 ms 11980 KB Output is correct
7 Correct 6 ms 11980 KB Output is correct
8 Correct 7 ms 11980 KB Output is correct
9 Correct 8 ms 11980 KB Output is correct
10 Correct 6 ms 11980 KB Output is correct
11 Correct 6 ms 12064 KB Output is correct
12 Correct 6 ms 11980 KB Output is correct
13 Correct 6 ms 12068 KB Output is correct
14 Correct 9 ms 12068 KB Output is correct
15 Correct 7 ms 12080 KB Output is correct
16 Correct 7 ms 12016 KB Output is correct
17 Correct 9 ms 11996 KB Output is correct
18 Correct 7 ms 12084 KB Output is correct
19 Correct 7 ms 11980 KB Output is correct
20 Correct 7 ms 11980 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 6 ms 11980 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 7 ms 11980 KB Output is correct
5 Correct 7 ms 12060 KB Output is correct
6 Correct 8 ms 11980 KB Output is correct
7 Correct 6 ms 11980 KB Output is correct
8 Correct 7 ms 11980 KB Output is correct
9 Correct 8 ms 11980 KB Output is correct
10 Correct 6 ms 11980 KB Output is correct
11 Correct 6 ms 12064 KB Output is correct
12 Correct 6 ms 11980 KB Output is correct
13 Correct 6 ms 12068 KB Output is correct
14 Correct 9 ms 12068 KB Output is correct
15 Correct 7 ms 12080 KB Output is correct
16 Correct 7 ms 12016 KB Output is correct
17 Correct 9 ms 11996 KB Output is correct
18 Correct 7 ms 12084 KB Output is correct
19 Correct 7 ms 11980 KB Output is correct
20 Correct 7 ms 11980 KB Output is correct
21 Correct 7 ms 12236 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 7 ms 12108 KB Output is correct
24 Correct 8 ms 12044 KB Output is correct
25 Correct 8 ms 12060 KB Output is correct
26 Correct 6 ms 12076 KB Output is correct
27 Correct 6 ms 12108 KB Output is correct
28 Correct 7 ms 12236 KB Output is correct
29 Correct 7 ms 12108 KB Output is correct
30 Correct 7 ms 12196 KB Output is correct
31 Correct 7 ms 12108 KB Output is correct
32 Correct 8 ms 12236 KB Output is correct
33 Correct 7 ms 12236 KB Output is correct
34 Correct 7 ms 12236 KB Output is correct
35 Correct 8 ms 12160 KB Output is correct
36 Correct 8 ms 12200 KB Output is correct
37 Correct 9 ms 12184 KB Output is correct
38 Correct 8 ms 12176 KB Output is correct
39 Correct 8 ms 12236 KB Output is correct
40 Correct 7 ms 12236 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 6 ms 11980 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 7 ms 11980 KB Output is correct
5 Correct 7 ms 12060 KB Output is correct
6 Correct 8 ms 11980 KB Output is correct
7 Correct 6 ms 11980 KB Output is correct
8 Correct 7 ms 11980 KB Output is correct
9 Correct 8 ms 11980 KB Output is correct
10 Correct 6 ms 11980 KB Output is correct
11 Correct 6 ms 12064 KB Output is correct
12 Correct 6 ms 11980 KB Output is correct
13 Correct 6 ms 12068 KB Output is correct
14 Correct 9 ms 12068 KB Output is correct
15 Correct 7 ms 12080 KB Output is correct
16 Correct 7 ms 12016 KB Output is correct
17 Correct 9 ms 11996 KB Output is correct
18 Correct 7 ms 12084 KB Output is correct
19 Correct 7 ms 11980 KB Output is correct
20 Correct 7 ms 11980 KB Output is correct
21 Correct 7 ms 12236 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 7 ms 12108 KB Output is correct
24 Correct 8 ms 12044 KB Output is correct
25 Correct 8 ms 12060 KB Output is correct
26 Correct 6 ms 12076 KB Output is correct
27 Correct 6 ms 12108 KB Output is correct
28 Correct 7 ms 12236 KB Output is correct
29 Correct 7 ms 12108 KB Output is correct
30 Correct 7 ms 12196 KB Output is correct
31 Correct 7 ms 12108 KB Output is correct
32 Correct 8 ms 12236 KB Output is correct
33 Correct 7 ms 12236 KB Output is correct
34 Correct 7 ms 12236 KB Output is correct
35 Correct 8 ms 12160 KB Output is correct
36 Correct 8 ms 12200 KB Output is correct
37 Correct 9 ms 12184 KB Output is correct
38 Correct 8 ms 12176 KB Output is correct
39 Correct 8 ms 12236 KB Output is correct
40 Correct 7 ms 12236 KB Output is correct
41 Correct 108 ms 28112 KB Output is correct
42 Correct 97 ms 21132 KB Output is correct
43 Correct 67 ms 20388 KB Output is correct
44 Correct 77 ms 20380 KB Output is correct
45 Correct 57 ms 20280 KB Output is correct
46 Correct 213 ms 29408 KB Output is correct
47 Correct 140 ms 28624 KB Output is correct
48 Correct 163 ms 28556 KB Output is correct
49 Correct 138 ms 28596 KB Output is correct
50 Correct 48 ms 20668 KB Output is correct
51 Correct 45 ms 20544 KB Output is correct
52 Correct 48 ms 20676 KB Output is correct
53 Correct 96 ms 29020 KB Output is correct
54 Correct 97 ms 29092 KB Output is correct
55 Correct 100 ms 29088 KB Output is correct
56 Correct 8 ms 12364 KB Output is correct
57 Correct 18 ms 15180 KB Output is correct
58 Correct 59 ms 25912 KB Output is correct
59 Correct 125 ms 34768 KB Output is correct
60 Correct 121 ms 28464 KB Output is correct
61 Correct 134 ms 27812 KB Output is correct