Submission #129655

# Submission time Handle Problem Language Result Execution time Memory
129655 2019-07-12T22:19:03 Z Vardanyan Cat in a tree (BOI17_catinatree) C++14
100 / 100
872 ms 330232 KB
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a) for (int i=0;i<(a);++i)
#define FORD(i,a) for (int i=(a)-1;i>=0;i--)
#define FORT(i,a,b) for (int i=(a);i<=(b);++i)
#define FORTD(i,b,a) for (int i=(b);i>=(a);--i)
const int N = 2*1000*100+5;
vector<int> g[N];
int mark[N];
int depth[N];
void dfs(int v,int p = -1){
   if(p!=-1) depth[v] = depth[p]+1;
    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;
void go(int v,int dd = 0,int p = -1){
    if(dd>=d) return;
    mark[v] = 1;
    for(int i = 0;i<g[v].size();i++){
        int to = g[v][i];
        if(to == p) continue;
        go(to,dd+1,v);
    }
}
int dp[N][405];


void dfss(int v,int par=-1){
    vector<int> gum(d),mx(d),suf(d);
    for(int i = 0;i<g[v].size();i++){
        int to = g[v][i];
        if (to==par)continue;
        dfss(to,v);
        FOR(i,d){
            gum[i]+=dp[to][i];
            if (d-2>=i){
                mx[i]=max(mx[i],dp[to][i]-dp[to][d-2-i]);
            }
        }
    }
    FOR(i,d){
        mx[i]+=gum[d-2-i];
    }
    FORD(i,d/2){
        suf[i]=max(suf[i+1],mx[i]);
    }
    FOR(i,d){
        if (i==0){
            dp[v][i]=max(gum[d-1]+1,suf[0]);
        }
        else if (i>d/2){
            dp[v][i]=gum[i-1];
        }
        else{
            dp[v][i]=suf[i-1];
        }
    }
    /*
    cout<<v<<endl;
    FOR(i,d)cout<<dp[v][i]<<" ";
    cout<<endl;*/
}

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);
    }
    long long x = n*n/d;
    long long y = n*d;
    if(d<401){
        dfss(0);
        cout<<dp[0][0]<<endl;
        return 0;
    }
    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++;
        go(i);
        /*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:13: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:28: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 dfss(int, int)':
catinatree.cpp:39: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:83:15: warning: unused variable 'x' [-Wunused-variable]
     long long x = n*n/d;
               ^
catinatree.cpp:84:15: warning: unused variable 'y' [-Wunused-variable]
     long long y = n*d;
               ^
catinatree.cpp:95:9: warning: unused variable 'num' [-Wunused-variable]
     int num = 1;
         ^~~
# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5116 KB Output is correct
8 Correct 6 ms 5084 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 5020 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5116 KB Output is correct
8 Correct 6 ms 5084 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 5020 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 5240 KB Output is correct
22 Correct 7 ms 5880 KB Output is correct
23 Correct 7 ms 5880 KB Output is correct
24 Correct 7 ms 5880 KB Output is correct
25 Correct 7 ms 6648 KB Output is correct
26 Correct 8 ms 6648 KB Output is correct
27 Correct 22 ms 6648 KB Output is correct
28 Correct 9 ms 7412 KB Output is correct
29 Correct 8 ms 7484 KB Output is correct
30 Correct 8 ms 7416 KB Output is correct
31 Correct 9 ms 7560 KB Output is correct
32 Correct 8 ms 7388 KB Output is correct
33 Correct 8 ms 7388 KB Output is correct
34 Correct 8 ms 7288 KB Output is correct
35 Correct 8 ms 7288 KB Output is correct
36 Correct 8 ms 7416 KB Output is correct
37 Correct 8 ms 7544 KB Output is correct
38 Correct 9 ms 7636 KB Output is correct
39 Correct 10 ms 7660 KB Output is correct
40 Correct 9 ms 7800 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5116 KB Output is correct
8 Correct 6 ms 5084 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 5020 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 5240 KB Output is correct
22 Correct 7 ms 5880 KB Output is correct
23 Correct 7 ms 5880 KB Output is correct
24 Correct 7 ms 5880 KB Output is correct
25 Correct 7 ms 6648 KB Output is correct
26 Correct 8 ms 6648 KB Output is correct
27 Correct 22 ms 6648 KB Output is correct
28 Correct 9 ms 7412 KB Output is correct
29 Correct 8 ms 7484 KB Output is correct
30 Correct 8 ms 7416 KB Output is correct
31 Correct 9 ms 7560 KB Output is correct
32 Correct 8 ms 7388 KB Output is correct
33 Correct 8 ms 7388 KB Output is correct
34 Correct 8 ms 7288 KB Output is correct
35 Correct 8 ms 7288 KB Output is correct
36 Correct 8 ms 7416 KB Output is correct
37 Correct 8 ms 7544 KB Output is correct
38 Correct 9 ms 7636 KB Output is correct
39 Correct 10 ms 7660 KB Output is correct
40 Correct 9 ms 7800 KB Output is correct
41 Correct 399 ms 313332 KB Output is correct
42 Correct 206 ms 167516 KB Output is correct
43 Correct 218 ms 167388 KB Output is correct
44 Correct 235 ms 167416 KB Output is correct
45 Correct 278 ms 167416 KB Output is correct
46 Correct 410 ms 329720 KB Output is correct
47 Correct 475 ms 329712 KB Output is correct
48 Correct 553 ms 329712 KB Output is correct
49 Correct 747 ms 329852 KB Output is correct
50 Correct 186 ms 167544 KB Output is correct
51 Correct 191 ms 167672 KB Output is correct
52 Correct 247 ms 167544 KB Output is correct
53 Correct 437 ms 330068 KB Output is correct
54 Correct 397 ms 330232 KB Output is correct
55 Correct 407 ms 330232 KB Output is correct
56 Correct 10 ms 9080 KB Output is correct
57 Correct 18 ms 7160 KB Output is correct
58 Correct 62 ms 14232 KB Output is correct
59 Correct 148 ms 19692 KB Output is correct
60 Correct 351 ms 321528 KB Output is correct
61 Correct 872 ms 313796 KB Output is correct