oj.uz

Submission #130384

# Submission time Handle Problem Language Result Execution time Memory
130384 2019-07-15T05:48:27 Z roseanne_pcy Cat in a tree (BOI17_catinatree) C++14
100 / 100
 317 ms 51676 KB 
//Power Of Ninja Go
#include <bits/stdc++.h>
//#ifdef atom #else #endif
using namespace std;
typedef long long ll; typedef pair<int, int> ii; typedef vector<int> vi; typedef vector< ii > vii;
#define X first
#define Y second
#define pb push_back
int n, k;
const int maxn = 2e5+5;
vi adj[maxn];
int h[maxn];
multiset<int> bst[maxn];
void dfs(int u)
{
    for(auto v : adj[u])
    {
        h[v] = 1+h[u];
        dfs(v);
    }
}
void solve(int u)
{
    for(auto v : adj[u]) solve(v);
    int big = -1;
    for(auto v : adj[u])
    {
        if(big == -1 || bst[v].size()> bst[big].size()) big = v;
    }
    if(big == -1) return;
    swap(bst[u], bst[big]);
    for(auto v : adj[u])
    {
        while(!bst[v].empty() && !bst[u].empty() && *bst[u].begin() + *bst[v].begin() - 2*h[u]< k)
        {
            if(*bst[u].begin()< *bst[v].begin()) bst[u].erase(bst[u].begin());
            else bst[v].erase(bst[v].begin());
        }
        for(auto x : bst[v]) bst[u].insert(x);
    }
}
int main()
{
    //#ifndef atom freopen(".in", "r", stdin); freopen(".out", "w", stdout); #endif
    scanf("%d %d", &n, &k);
    for(int i = 2; i<= n; i++)
    {
        int x; scanf("%d", &x);
        x++;
        adj[x].pb(i);
    }
    dfs(1);
    for(int i = 1; i<= n; i++) bst[i].insert(h[i]);
    solve(1); printf("%d\n", bst[1].size());
}

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:54:43: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::multiset<int>::size_type {aka long unsigned int}' [-Wformat=]
     solve(1); printf("%d\n", bst[1].size());
                              ~~~~~~~~~~~~~^
catinatree.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~~
catinatree.cpp:48:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int x; scanf("%d", &x);
                ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14456 KB Output is correct
3 Correct 16 ms 14456 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14456 KB Output is correct
6 Correct 16 ms 14456 KB Output is correct
7 Correct 15 ms 14456 KB Output is correct
8 Correct 15 ms 14456 KB Output is correct
9 Correct 15 ms 14456 KB Output is correct
10 Correct 15 ms 14456 KB Output is correct
11 Correct 15 ms 14456 KB Output is correct
12 Correct 17 ms 14456 KB Output is correct
13 Correct 14 ms 14456 KB Output is correct
14 Correct 15 ms 14456 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 15 ms 14456 KB Output is correct
17 Correct 15 ms 14456 KB Output is correct
18 Correct 15 ms 14456 KB Output is correct
19 Correct 15 ms 14456 KB Output is correct
20 Correct 15 ms 14456 KB Output is correct
21 Correct 15 ms 14712 KB Output is correct
22 Correct 15 ms 14456 KB Output is correct
23 Correct 15 ms 14428 KB Output is correct
24 Correct 17 ms 14344 KB Output is correct
25 Correct 16 ms 14584 KB Output is correct
26 Correct 16 ms 14584 KB Output is correct
27 Correct 16 ms 14456 KB Output is correct
28 Correct 16 ms 14584 KB Output is correct
29 Correct 16 ms 14584 KB Output is correct
30 Correct 16 ms 14584 KB Output is correct
31 Correct 16 ms 14588 KB Output is correct
32 Correct 15 ms 14456 KB Output is correct
33 Correct 15 ms 14584 KB Output is correct
34 Correct 17 ms 14456 KB Output is correct
35 Correct 16 ms 14464 KB Output is correct
36 Correct 16 ms 14584 KB Output is correct
37 Correct 15 ms 14584 KB Output is correct
38 Correct 16 ms 14556 KB Output is correct
39 Correct 15 ms 14584 KB Output is correct
40 Correct 16 ms 14712 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14456 KB Output is correct
3 Correct 16 ms 14456 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14456 KB Output is correct
6 Correct 16 ms 14456 KB Output is correct
7 Correct 15 ms 14456 KB Output is correct
8 Correct 15 ms 14456 KB Output is correct
9 Correct 15 ms 14456 KB Output is correct
10 Correct 15 ms 14456 KB Output is correct
11 Correct 15 ms 14456 KB Output is correct
12 Correct 17 ms 14456 KB Output is correct
13 Correct 14 ms 14456 KB Output is correct
14 Correct 15 ms 14456 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 15 ms 14456 KB Output is correct
17 Correct 15 ms 14456 KB Output is correct
18 Correct 15 ms 14456 KB Output is correct
19 Correct 15 ms 14456 KB Output is correct
20 Correct 15 ms 14456 KB Output is correct
21 Correct 15 ms 14712 KB Output is correct
22 Correct 15 ms 14456 KB Output is correct
23 Correct 15 ms 14428 KB Output is correct
24 Correct 17 ms 14344 KB Output is correct
25 Correct 16 ms 14584 KB Output is correct
26 Correct 16 ms 14584 KB Output is correct
27 Correct 16 ms 14456 KB Output is correct
28 Correct 16 ms 14584 KB Output is correct
29 Correct 16 ms 14584 KB Output is correct
30 Correct 16 ms 14584 KB Output is correct
31 Correct 16 ms 14588 KB Output is correct
32 Correct 15 ms 14456 KB Output is correct
33 Correct 15 ms 14584 KB Output is correct
34 Correct 17 ms 14456 KB Output is correct
35 Correct 16 ms 14464 KB Output is correct
36 Correct 16 ms 14584 KB Output is correct
37 Correct 15 ms 14584 KB Output is correct
38 Correct 16 ms 14556 KB Output is correct
39 Correct 15 ms 14584 KB Output is correct
40 Correct 16 ms 14712 KB Output is correct
41 Correct 125 ms 28992 KB Output is correct
42 Correct 185 ms 42460 KB Output is correct
43 Correct 92 ms 21712 KB Output is correct
44 Correct 89 ms 21752 KB Output is correct
45 Correct 88 ms 21752 KB Output is correct
46 Correct 317 ms 51676 KB Output is correct
47 Correct 197 ms 29064 KB Output is correct
48 Correct 197 ms 29048 KB Output is correct
49 Correct 230 ms 29048 KB Output is correct
50 Correct 63 ms 20344 KB Output is correct
51 Correct 61 ms 20344 KB Output is correct
52 Correct 64 ms 20472 KB Output is correct
53 Correct 124 ms 26444 KB Output is correct
54 Correct 125 ms 26360 KB Output is correct
55 Correct 157 ms 26360 KB Output is correct
56 Correct 17 ms 14712 KB Output is correct
57 Correct 26 ms 18400 KB Output is correct
58 Correct 66 ms 32760 KB Output is correct
59 Correct 161 ms 39968 KB Output is correct
60 Correct 117 ms 29656 KB Output is correct
61 Correct 139 ms 29288 KB Output is correct