oj.uz

Submission #129900

# Submission time Handle Problem Language Result Execution time Memory
129900 2019-07-13T13:28:30 Z Abelyan Cat in a tree (BOI17_catinatree) C++17
100 / 100
 844 ms 331016 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
#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)
#define trav(i,v) for (auto i : v)
#define all(v) v.begin(),v.end()
#define ad push_back
#define fr first
#define sc second
#define mpr(a,b) make_pair(a,b)
#define pir pair<int,int>
#define all(v) v.begin(),v.end()
#define make_unique(v) v.erase(unique(all(v)),v.end())
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define srng mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define y1 EsiHancagorcRepa
 
const int N=2e5+10;
const ll MOD=1e9+7;
 
vector<int> g[N];
int dp[N][406];
int n,d;
 
void dfs(int v,int par=-1){
    vector<int> gum(d),mx(d),suf(d);
    trav(to,g[v]){
        if (to==par)continue;
        dfs(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;*/
}
 
bool col[N];
vector<pir> srt;
void dfs2(int v,int dep=n,int par=-1){
    srt.ad({dep,v});
    trav(to,g[v]){
        if (to==par)continue;
        dfs2(to,dep-1,v);
    }
}
 
 
void dfs3(int v,int dep=0,int par=-1){
    if (dep>=d)return;
    //cout<<v<<endl;
    col[v]=true;
    trav(to,g[v]){
        if (to==par)continue;
        dfs3(to,dep+1,v);
    }
}
 
 
int main(){
    fastio;
    srng;
    cin>>n>>d;
    if (d>=n){
        cout<<1<<endl;
        return 0;
    }
    FORT(i,1,n-1){
        int p;
        cin>>p;
        g[p].ad(i);
        g[i].ad(p);
    }
    if (d<=400){
        dfs(0);
        cout<<dp[0][0]<<endl;
    }
    else{
        dfs2(0);
        sort(all(srt));
        int ans=0;
        FOR(i,srt.size()){
            int tv=srt[i].sc;
            if (!col[tv]){
                ans++;
                dfs3(tv);
                //cout<<"****"<<endl;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:8:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i,a) for (int i=0;i<(a);++i)
                                ^
catinatree.cpp:111:9: note: in expansion of macro 'FOR'
         FOR(i,srt.size()){
         ^~~

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 4988 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 5112 KB Output is correct
8 Correct 6 ms 5112 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 5112 KB Output is correct
12 Correct 6 ms 5116 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

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 4988 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 5112 KB Output is correct
8 Correct 6 ms 5112 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 5112 KB Output is correct
12 Correct 6 ms 5116 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 8 ms 6648 KB Output is correct
26 Correct 8 ms 6648 KB Output is correct
27 Correct 8 ms 6648 KB Output is correct
28 Correct 9 ms 7544 KB Output is correct
29 Correct 9 ms 7468 KB Output is correct
30 Correct 9 ms 7544 KB Output is correct
31 Correct 9 ms 7544 KB Output is correct
32 Correct 8 ms 7416 KB Output is correct
33 Correct 8 ms 7544 KB Output is correct
34 Correct 8 ms 7288 KB Output is correct
35 Correct 9 ms 7288 KB Output is correct
36 Correct 8 ms 7544 KB Output is correct
37 Correct 9 ms 7544 KB Output is correct
38 Correct 9 ms 7644 KB Output is correct
39 Correct 10 ms 7668 KB Output is correct
40 Correct 8 ms 7812 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4988 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 5112 KB Output is correct
8 Correct 6 ms 5112 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 5112 KB Output is correct
12 Correct 6 ms 5116 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 8 ms 6648 KB Output is correct
26 Correct 8 ms 6648 KB Output is correct
27 Correct 8 ms 6648 KB Output is correct
28 Correct 9 ms 7544 KB Output is correct
29 Correct 9 ms 7468 KB Output is correct
30 Correct 9 ms 7544 KB Output is correct
31 Correct 9 ms 7544 KB Output is correct
32 Correct 8 ms 7416 KB Output is correct
33 Correct 8 ms 7544 KB Output is correct
34 Correct 8 ms 7288 KB Output is correct
35 Correct 9 ms 7288 KB Output is correct
36 Correct 8 ms 7544 KB Output is correct
37 Correct 9 ms 7544 KB Output is correct
38 Correct 9 ms 7644 KB Output is correct
39 Correct 10 ms 7668 KB Output is correct
40 Correct 8 ms 7812 KB Output is correct
41 Correct 337 ms 314152 KB Output is correct
42 Correct 201 ms 167704 KB Output is correct
43 Correct 238 ms 167772 KB Output is correct
44 Correct 276 ms 167848 KB Output is correct
45 Correct 291 ms 167832 KB Output is correct
46 Correct 407 ms 330484 KB Output is correct
47 Correct 487 ms 330488 KB Output is correct
48 Correct 547 ms 330640 KB Output is correct
49 Correct 726 ms 330684 KB Output is correct
50 Correct 185 ms 168084 KB Output is correct
51 Correct 192 ms 167928 KB Output is correct
52 Correct 199 ms 168032 KB Output is correct
53 Correct 375 ms 331016 KB Output is correct
54 Correct 406 ms 331000 KB Output is correct
55 Correct 404 ms 330876 KB Output is correct
56 Correct 10 ms 9084 KB Output is correct
57 Correct 15 ms 7416 KB Output is correct
58 Correct 58 ms 15340 KB Output is correct
59 Correct 138 ms 20972 KB Output is correct
60 Correct 342 ms 322352 KB Output is correct
61 Correct 844 ms 314476 KB Output is correct