Submission #985769

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
985769	2024-05-18T17:17:46 Z	VinhLuu	Cat in a tree (BOI17_catinatree)	C++17	100 / 100	33 ms	16464 KB

catinatree

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
//#define int long long
//#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()

using namespace std;

typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
const int N = 2e5 + 5;
const int oo = 1e9 + 1;
const int mod = 1e9 + 7;
int block = 316;
//const ll oo = 5e18;

int n, D, f[N], ans, g[N];
vector<int> p[N];

void dfs(int u){
    if((int)p[u].size() == 0){
        f[u] = 0;
        ans++;
        return;
    }
    for(auto j : p[u]) dfs(j);

    sort(all(p[u]), [&](int x,int y){return f[x] > f[y];});
    int mi = f[p[u][0]] + 1;
    for(int i = 1; i < (int)p[u].size(); i ++){
        int j = p[u][i];
        if(mi + 1 + f[j] < D){
            ans--;
            continue;
        }
        mi = min(mi, 1 + f[j]);
    }
    if(mi >= D) ans++, f[u] = 0;
    else f[u] = mi;
//    cerr << u << " " << f[u] << " " << ans << " y\n";
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define task "v"
    if(fopen(task ".inp","r")){
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }

    cin >> n >> D;
    for(int i = 1; i < n; i ++){
        int x; cin >> x;
        p[x].pb(i);
//        cerr << x << " " << i << " o\n";
    }
//    for(int i = 0; i < n; i ++) cerr << i << " " << (int)p[i].size() << " tt\n";
    dfs(0);
    cout << ans;
}

/*
7 5
0
1
2
0
3
1
*/

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen(task ".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
catinatree.cpp:53:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |         freopen(task ".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4956 KB	Output is correct
2	Correct	1 ms	4956 KB	Output is correct
3	Correct	1 ms	5164 KB	Output is correct
4	Correct	1 ms	4956 KB	Output is correct
5	Correct	1 ms	5208 KB	Output is correct
6	Correct	1 ms	4956 KB	Output is correct
7	Correct	2 ms	4956 KB	Output is correct
8	Correct	1 ms	4956 KB	Output is correct
9	Correct	2 ms	4956 KB	Output is correct
10	Correct	1 ms	4968 KB	Output is correct
11	Correct	1 ms	4956 KB	Output is correct
12	Correct	1 ms	4956 KB	Output is correct
13	Correct	1 ms	4956 KB	Output is correct
14	Correct	1 ms	4956 KB	Output is correct
15	Correct	2 ms	4956 KB	Output is correct
16	Correct	1 ms	4956 KB	Output is correct
17	Correct	1 ms	4956 KB	Output is correct
18	Correct	1 ms	4956 KB	Output is correct
19	Correct	2 ms	4956 KB	Output is correct
20	Correct	1 ms	4956 KB	Output is correct
21	Correct	2 ms	5212 KB	Output is correct
22	Correct	1 ms	4956 KB	Output is correct
23	Correct	1 ms	4956 KB	Output is correct
24	Correct	1 ms	4956 KB	Output is correct
25	Correct	2 ms	4956 KB	Output is correct
26	Correct	1 ms	4956 KB	Output is correct
27	Correct	2 ms	4956 KB	Output is correct
28	Correct	2 ms	4956 KB	Output is correct
29	Correct	2 ms	4956 KB	Output is correct
30	Correct	2 ms	4956 KB	Output is correct
31	Correct	2 ms	5164 KB	Output is correct
32	Correct	1 ms	4956 KB	Output is correct
33	Correct	1 ms	4956 KB	Output is correct
34	Correct	2 ms	4952 KB	Output is correct
35	Correct	2 ms	5464 KB	Output is correct
36	Correct	2 ms	4956 KB	Output is correct
37	Correct	2 ms	4952 KB	Output is correct
38	Correct	1 ms	5208 KB	Output is correct
39	Correct	2 ms	5212 KB	Output is correct
40	Correct	2 ms	5212 KB	Output is correct
41	Correct	23 ms	10820 KB	Output is correct
42	Correct	16 ms	7572 KB	Output is correct
43	Correct	16 ms	7516 KB	Output is correct
44	Correct	16 ms	7516 KB	Output is correct
45	Correct	22 ms	7760 KB	Output is correct
46	Correct	33 ms	10120 KB	Output is correct
47	Correct	32 ms	10328 KB	Output is correct
48	Correct	31 ms	10148 KB	Output is correct
49	Correct	31 ms	10064 KB	Output is correct
50	Correct	9 ms	6492 KB	Output is correct
51	Correct	11 ms	6492 KB	Output is correct
52	Correct	9 ms	6536 KB	Output is correct
53	Correct	15 ms	7772 KB	Output is correct
54	Correct	20 ms	7772 KB	Output is correct
55	Correct	15 ms	7772 KB	Output is correct
56	Correct	2 ms	5212 KB	Output is correct
57	Correct	4 ms	7004 KB	Output is correct
58	Correct	18 ms	14424 KB	Output is correct
59	Correct	31 ms	16464 KB	Output is correct
60	Correct	25 ms	11064 KB	Output is correct
61	Correct	28 ms	10996 KB	Output is correct

Submission #985769

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 40.0 / 40.0

Subtask #3 49.0 / 49.0

Subtask #1
11.0 / 11.0

Subtask #2
40.0 / 40.0

Subtask #3
49.0 / 49.0