oj.uz

Submission #791464

# Submission time Handle Problem Language Result Execution time Memory
791464 2023-07-24T06:47:25 Z Cookie Cat in a tree (BOI17_catinatree) C++14
100 / 100
 51 ms 24208 KB 
#include<bits/stdc++.h>
#include<fstream>
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
//ifstream fin("FEEDING.INP");
//ofstream fout("FEEDING.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const int mxn = 2e5 + 5, base = 74;
const ll p = 31, mod = 1e9 + 7, inf = 1e9;
int n, d;
vt<int>adj[mxn + 1];
int depth[mxn + 1];
pii dp[mxn + 1];
void dfs(int s, int pre){
    vt<pii>cand;
    for(auto i: adj[s]){
        if(i != pre){
            depth[i] = depth[s] + 1;
            dfs(i, s);
            cand.pb(dp[i]);
        }
    }
    sort(cand.rbegin(), cand.rend());
    int mncan = -1, ans = 0, mndep = inf;
    for(auto [dep, res]: cand){
        if(dep >= mncan){
            ans += res;
            mncan = max(mncan, -dep + 2 * depth[s] + d); mndep = min(mndep, dep);
        }else{
            ans += res - 1; 
        }
    }
    if(depth[s] >= mncan){
        ans++; mndep = min(mndep, depth[s]);
    }
    dp[s] = make_pair(mndep, ans);
}
signed main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> d;
    for(int i = 1; i < n; i++){
        int p; cin >> p;
        adj[p].pb(i);
    }
    dfs(0, -1);
    cout << dp[0].se;
    return(0);
}

Compilation message

catinatree.cpp: In function 'void dfs(int, int)':
catinatree.cpp:37:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   37 |     for(auto [dep, res]: cand){
      |              ^

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 5024 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4924 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 5016 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 2 ms 5028 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 5028 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4972 KB Output is correct
21 Correct 3 ms 5204 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 5024 KB Output is correct
28 Correct 2 ms 5076 KB Output is correct
29 Correct 2 ms 5076 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 4 ms 5076 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 2 ms 5024 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 2 ms 5076 KB Output is correct
37 Correct 2 ms 5076 KB Output is correct
38 Correct 2 ms 5076 KB Output is correct
39 Correct 2 ms 5032 KB Output is correct
40 Correct 2 ms 5284 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 5024 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4924 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 5016 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 2 ms 5028 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 5028 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4972 KB Output is correct
21 Correct 3 ms 5204 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 5024 KB Output is correct
28 Correct 2 ms 5076 KB Output is correct
29 Correct 2 ms 5076 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 4 ms 5076 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 2 ms 5024 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 2 ms 5076 KB Output is correct
37 Correct 2 ms 5076 KB Output is correct
38 Correct 2 ms 5076 KB Output is correct
39 Correct 2 ms 5032 KB Output is correct
40 Correct 2 ms 5284 KB Output is correct
41 Correct 28 ms 12644 KB Output is correct
42 Correct 19 ms 8276 KB Output is correct
43 Correct 20 ms 8352 KB Output is correct
44 Correct 23 ms 8364 KB Output is correct
45 Correct 19 ms 8364 KB Output is correct
46 Correct 39 ms 11700 KB Output is correct
47 Correct 51 ms 11748 KB Output is correct
48 Correct 39 ms 11732 KB Output is correct
49 Correct 47 ms 11688 KB Output is correct
50 Correct 11 ms 7124 KB Output is correct
51 Correct 14 ms 7168 KB Output is correct
52 Correct 12 ms 7124 KB Output is correct
53 Correct 20 ms 9260 KB Output is correct
54 Correct 20 ms 9264 KB Output is correct
55 Correct 19 ms 9172 KB Output is correct
56 Correct 3 ms 5164 KB Output is correct
57 Correct 6 ms 8404 KB Output is correct
58 Correct 21 ms 20856 KB Output is correct
59 Correct 48 ms 24208 KB Output is correct
60 Correct 28 ms 13056 KB Output is correct
61 Correct 39 ms 12272 KB Output is correct