oj.uz

Submission #343249

# Submission time Handle Problem Language Result Execution time Memory
343249 2021-01-03T15:07:25 Z FatihSolak Cat in a tree (BOI17_catinatree) C++17
100 / 100
 100 ms 21868 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl "\n"
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = (int) 1e9;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int n,d;
vector<int> adj[MAXN];
int ans;
int calc(int v,int par){
    int cnt = 0;
    int tmp = v;
    while(adj[v].size() + (v==0) ==2){
        cnt++;
        for(auto u:adj[v]){
            if(u != par){
                par = v;
                v = u;
                break;
            }
        }
    }
    if((adj[v].size()+(v==0)) == 1){
        ans+=cnt/d+1;
        return cnt%d;
    }
    vector<int> nums;
    for(auto u:adj[v]){
        if(u != par){
            nums.push_back(calc(u,v)+1);
        }
    }
    sort(all(nums));
    reverse(all(nums));
    for(int i=1;i<nums.size();i++){
        if(nums[i]+nums[i-1]<d){
            ans-=(nums.size()-i);
            int ret = cnt+nums[i-1];
            ans+=ret/d;
            return ret%d;
        }
    }
    int ret = cnt+nums[nums.size()-1];
    ans+=ret/d;
    return ret%d;
}
void solve(){
    cin >> n >> d;
    for(int i=0;i<n-1;i++){
        int a;
        cin >> a;
        adj[a].push_back(i+1);
        adj[i+1].push_back(a);
    }
    calc(0,-1);
    cout << ans;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    #ifdef Local
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    #ifdef Local
    cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Compilation message

catinatree.cpp: In function 'int calc(int, int)':
catinatree.cpp:43:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for(int i=1;i<nums.size();i++){
      |                 ~^~~~~~~~~~~~
catinatree.cpp:20:9: warning: unused variable 'tmp' [-Wunused-variable]
   20 |     int tmp = v;
      |         ^~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 5 ms 7404 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 5 ms 7404 KB Output is correct
6 Correct 5 ms 7404 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Correct 5 ms 7404 KB Output is correct
9 Correct 5 ms 7404 KB Output is correct
10 Correct 5 ms 7404 KB Output is correct
11 Correct 5 ms 7404 KB Output is correct
12 Correct 5 ms 7404 KB Output is correct
13 Correct 5 ms 7404 KB Output is correct
14 Correct 6 ms 7404 KB Output is correct
15 Correct 5 ms 7404 KB Output is correct
16 Correct 5 ms 7404 KB Output is correct
17 Correct 5 ms 7404 KB Output is correct
18 Correct 5 ms 7404 KB Output is correct
19 Correct 5 ms 7404 KB Output is correct
20 Correct 5 ms 7404 KB Output is correct
21 Correct 5 ms 7404 KB Output is correct
22 Correct 5 ms 7404 KB Output is correct
23 Correct 6 ms 7404 KB Output is correct
24 Correct 7 ms 7404 KB Output is correct
25 Correct 5 ms 7404 KB Output is correct
26 Correct 5 ms 7404 KB Output is correct
27 Correct 5 ms 7404 KB Output is correct
28 Correct 5 ms 7404 KB Output is correct
29 Correct 6 ms 7532 KB Output is correct
30 Correct 6 ms 7404 KB Output is correct
31 Correct 6 ms 7404 KB Output is correct
32 Correct 6 ms 7404 KB Output is correct
33 Correct 5 ms 7404 KB Output is correct
34 Correct 5 ms 7404 KB Output is correct
35 Correct 6 ms 7404 KB Output is correct
36 Correct 5 ms 7404 KB Output is correct
37 Correct 5 ms 7404 KB Output is correct
38 Correct 6 ms 7552 KB Output is correct
39 Correct 6 ms 7532 KB Output is correct
40 Correct 6 ms 7404 KB Output is correct
41 Correct 55 ms 14952 KB Output is correct
42 Correct 39 ms 11244 KB Output is correct
43 Correct 39 ms 11244 KB Output is correct
44 Correct 46 ms 11244 KB Output is correct
45 Correct 41 ms 11244 KB Output is correct
46 Correct 97 ms 15032 KB Output is correct
47 Correct 98 ms 15212 KB Output is correct
48 Correct 98 ms 15084 KB Output is correct
49 Correct 100 ms 15084 KB Output is correct
50 Correct 28 ms 11500 KB Output is correct
51 Correct 25 ms 11500 KB Output is correct
52 Correct 25 ms 11500 KB Output is correct
53 Correct 44 ms 15468 KB Output is correct
54 Correct 44 ms 15596 KB Output is correct
55 Correct 47 ms 15596 KB Output is correct
56 Correct 6 ms 7532 KB Output is correct
57 Correct 9 ms 8300 KB Output is correct
58 Correct 31 ms 12140 KB Output is correct
59 Correct 83 ms 21868 KB Output is correct
60 Correct 54 ms 15100 KB Output is correct
61 Correct 69 ms 14572 KB Output is correct