oj.uz

Submission #132498

# Submission time Handle Problem Language Result Execution time Memory
132498 2019-07-19T04:53:56 Z tlwpdus Cat in a tree (BOI17_catinatree) C++11
100 / 100
 139 ms 19140 KB 
#include <bits/stdc++.h>

using namespace std;

const int INF = 0x3f3f3f3f;

int n, d;
vector<int> lis[200100];
int st[200100], en[200100], par[200100], dep[200100];
int tree[530000];
const int key = 262144;

void init() {
    for (int i=0;i<key*2;i++) tree[i] = INF;
}
void upd(int s, int e, int val) {
    s += key; e += key;
    while(s<=e) {
        if (s&1) tree[s] = min(tree[s],val);
        if (~e&1)tree[e] = min(tree[e],val);
        s = (s+1)/2;
        e = (e-1)/2;
    }
}
int getv(int idx) {
    int ans = INF;
    idx+=key;
    while(idx) {
        ans = min(ans,tree[idx]);
        idx/=2;
    }
    return ans;
}

int tc;
void idfs(int here, int p) {
    st[here] = tc++;
    par[here] = p;
    dep[here] = (~p?dep[p]:-1)+1;
    for (int &there : lis[here]) idfs(there,here);
    en[here] = tc-1;
}

int main() {
    scanf("%d%d",&n,&d);
    for (int i=1;i<n;i++) {
        int p;
        scanf("%d",&p);
        lis[p].push_back(i);
    }
    idfs(0,-1);
    vector<int> ord(n,0);
    iota(ord.begin(),ord.end(),0);
    sort(ord.begin(),ord.end(),[](int a, int b){return dep[a]>dep[b];});
    int ans = 0;
    init();
    for (int i=0;i<n;i++) {
        int idx = ord[i];
        if (getv(st[idx])+dep[idx]>=d) {
            ans++;
            int p = idx;
            for (int j=0;j<d&&~p;j++,p=par[p]) {
                upd(st[p],en[p],dep[idx]-2*dep[p]);
            }
        }
    }
    printf("%d\n",ans);

    return 0;
}

Compilation message

catinatree.cpp: In function 'int main()':
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,&d);
     ~~~~~^~~~~~~~~~~~~~
catinatree.cpp:48:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&p);
         ~~~~~^~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7160 KB Output is correct
2 Correct 8 ms 7160 KB Output is correct
3 Correct 8 ms 7160 KB Output is correct
4 Correct 8 ms 7032 KB Output is correct
5 Correct 9 ms 7160 KB Output is correct
6 Correct 8 ms 7160 KB Output is correct
7 Correct 8 ms 7032 KB Output is correct
8 Correct 8 ms 7160 KB Output is correct
9 Correct 8 ms 7032 KB Output is correct
10 Correct 8 ms 7032 KB Output is correct
11 Correct 8 ms 7160 KB Output is correct
12 Correct 8 ms 7032 KB Output is correct
13 Correct 8 ms 7160 KB Output is correct
14 Correct 8 ms 7160 KB Output is correct
15 Correct 8 ms 7160 KB Output is correct
16 Correct 8 ms 7160 KB Output is correct
17 Correct 8 ms 7160 KB Output is correct
18 Correct 8 ms 7160 KB Output is correct
19 Correct 10 ms 7160 KB Output is correct
20 Correct 8 ms 7160 KB Output is correct
21 Correct 11 ms 7292 KB Output is correct
22 Correct 10 ms 7164 KB Output is correct
23 Correct 10 ms 7160 KB Output is correct
24 Correct 8 ms 7032 KB Output is correct
25 Correct 9 ms 7160 KB Output is correct
26 Correct 10 ms 7160 KB Output is correct
27 Correct 8 ms 7160 KB Output is correct
28 Correct 8 ms 7160 KB Output is correct
29 Correct 8 ms 7160 KB Output is correct
30 Correct 8 ms 7160 KB Output is correct
31 Correct 8 ms 7160 KB Output is correct
32 Correct 8 ms 7164 KB Output is correct
33 Correct 8 ms 7160 KB Output is correct
34 Correct 9 ms 7160 KB Output is correct
35 Correct 8 ms 7160 KB Output is correct
36 Correct 8 ms 7160 KB Output is correct
37 Correct 9 ms 7160 KB Output is correct
38 Correct 9 ms 7160 KB Output is correct
39 Correct 9 ms 7160 KB Output is correct
40 Correct 9 ms 7288 KB Output is correct
41 Correct 92 ms 14708 KB Output is correct
42 Correct 58 ms 10992 KB Output is correct
43 Correct 60 ms 11000 KB Output is correct
44 Correct 54 ms 10872 KB Output is correct
45 Correct 56 ms 11000 KB Output is correct
46 Correct 139 ms 14456 KB Output is correct
47 Correct 125 ms 14540 KB Output is correct
48 Correct 118 ms 14456 KB Output is correct
49 Correct 122 ms 14492 KB Output is correct
50 Correct 39 ms 9976 KB Output is correct
51 Correct 37 ms 9848 KB Output is correct
52 Correct 38 ms 9848 KB Output is correct
53 Correct 71 ms 12408 KB Output is correct
54 Correct 71 ms 12536 KB Output is correct
55 Correct 70 ms 12408 KB Output is correct
56 Correct 9 ms 7288 KB Output is correct
57 Correct 17 ms 9208 KB Output is correct
58 Correct 56 ms 16376 KB Output is correct
59 Correct 127 ms 19140 KB Output is correct
60 Correct 85 ms 15476 KB Output is correct
61 Correct 107 ms 15068 KB Output is correct