oj.uz

Submission #129643

# Submission time Handle Problem Language Result Execution time Memory
129643 2019-07-12T21:16:30 Z Vardanyan Cat in a tree (BOI17_catinatree) C++14
51 / 100
 1000 ms 14444 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2*1000*100+5;
vector<int> g[N];
int mark[N];
int depth[N];
int par[N];
void dfs(int v,int p = -1){
   if(p!=-1) depth[v] = depth[p]+1;
   par[v] = p;
    for(int i = 0;i<g[v].size();i++){
        int to = g[v][i];
        if(to == p) continue;
        dfs(to,v);
    }

}
bool cmp(int a,int b){
    return depth[a]>depth[b];
}
bool col[N];
int d;
int mr = 0;
int nw;
void go(int v,int dd = 0,int p = -1){
    if(dd>=d) return;
    mark[v] = 1;
    mr++;
    for(int i = 0;i<g[v].size();i++){
        int to = g[v][i];
        if(to == p || to == nw) continue;
        go(to,dd+1,v);
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    int n;
    cin>>n>>d;
    for(int i = 1;i<=n-1;i++){
        int x;
        cin>>x;
        g[i].push_back(x);
        g[x].push_back(i);
    }
    dfs(0);
    vector<int> v;
    for(int i = 0;i<n;i++) v.push_back(i);
    sort(v.begin(),v.end(),cmp);
    int ans = 0;
    int num = 1;
    for(int jj = 0;jj<n;jj++){
        int i = v[jj];
        if(mark[i]) continue;
        mark[i] = 1;
        ans++;
        nw = i;
        go(par[i],1);
    //    if(mr == n) break;
        /*queue<pair<int,int> > q;
        q.push({i,0});
        num++;
        col[i] = num;
        while(!q.empty()){
            pair<int,int> x = q.front();
            int gag = x.first;
            int dd = x.second;
            q.pop();
            if(dd>=d) continue;
            mark[gag] = 1;

            for(int j = 0;j<g[gag].size();j++){
                int to = g[gag][j];
                if(col[to]!=num){
                    q.push({to,dd+1});
                    col[to] = num;
                }
            }
        }*/
 //       for(int i = 0;i<n;i++) cout<<mark[i]<<" ";
 //       cout<<endl;
    }
    cout<<max(1,ans)<<endl;
    return 0;
}

Compilation message

catinatree.cpp: In function 'void dfs(int, int)':
catinatree.cpp:11:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<g[v].size();i++){
                   ~^~~~~~~~~~~~
catinatree.cpp: In function 'void go(int, int, int)':
catinatree.cpp:29:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<g[v].size();i++){
                   ~^~~~~~~~~~~~
catinatree.cpp: In function 'int main()':
catinatree.cpp:50:9: warning: unused variable 'num' [-Wunused-variable]
     int num = 1;
         ^~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 5032 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 4988 KB Output is correct
8 Correct 6 ms 5072 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 7 ms 4984 KB Output is correct
15 Correct 7 ms 4984 KB Output is correct
16 Correct 6 ms 5116 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 5240 KB Output is correct
22 Correct 8 ms 5112 KB Output is correct
23 Correct 7 ms 5116 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 7 ms 5112 KB Output is correct
26 Correct 10 ms 5112 KB Output is correct
27 Correct 6 ms 5112 KB Output is correct
28 Correct 7 ms 5112 KB Output is correct
29 Correct 6 ms 5112 KB Output is correct
30 Correct 7 ms 5112 KB Output is correct
31 Correct 6 ms 5112 KB Output is correct
32 Correct 7 ms 5116 KB Output is correct
33 Correct 6 ms 5112 KB Output is correct
34 Correct 6 ms 5112 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 6 ms 5244 KB Output is correct
37 Correct 7 ms 5112 KB Output is correct
38 Correct 7 ms 5112 KB Output is correct
39 Correct 6 ms 5112 KB Output is correct
40 Correct 7 ms 5240 KB Output is correct
41 Execution timed out 1071 ms 14444 KB Time limit exceeded
42 Halted 0 ms 0 KB -