답안 #739417

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
739417	2023-05-10T12:28:33 Z	nguyentunglam	Cat in a tree (BOI17_catinatree)	C++17	100 / 100	83 ms	23360 KB

catinatree

#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const int N = 2e5 + 10;
int f[N], g[N];
vector<int> adj[N];
int n, d;
void dfs(int u) {
    f[u] = d;
    vector<int> lst;
    for(int &v : adj[u]) {
        dfs(v);
        lst.push_back(f[v] + 1);
        g[u] += g[v];
    }
    sort(lst.begin(), lst.end(), greater<int>());
    int cnt = 0;
    for(int &j : lst) if (j + f[u] >= d) {
        f[u] = j;
        cnt++;
    }
    g[u] -= adj[u].size() - cnt;
    if (f[u] == d) g[u]++, f[u] = 0;
}
int main() {
    #define task ""
    cin.tie(0) -> sync_with_stdio(0);
    if (fopen ("task.inp", "r")) {
        freopen ("task.inp", "r", stdin);
        freopen ("task.out", "w", stdout);
    }
    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;
        adj[x].push_back(i);
    }
    dfs(0);
    cout << g[0];
}

Compilation message

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

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4948 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	3 ms	5028 KB	Output is correct
4	Correct	4 ms	5024 KB	Output is correct
5	Correct	3 ms	5028 KB	Output is correct
6	Correct	3 ms	4948 KB	Output is correct
7	Correct	4 ms	4948 KB	Output is correct
8	Correct	3 ms	4948 KB	Output is correct
9	Correct	3 ms	4948 KB	Output is correct
10	Correct	3 ms	4948 KB	Output is correct
11	Correct	3 ms	4948 KB	Output is correct
12	Correct	3 ms	5032 KB	Output is correct
13	Correct	4 ms	5032 KB	Output is correct
14	Correct	3 ms	4948 KB	Output is correct
15	Correct	3 ms	5032 KB	Output is correct
16	Correct	2 ms	4948 KB	Output is correct
17	Correct	3 ms	4948 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	3 ms	5028 KB	Output is correct
20	Correct	3 ms	5028 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4948 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	3 ms	5028 KB	Output is correct
4	Correct	4 ms	5024 KB	Output is correct
5	Correct	3 ms	5028 KB	Output is correct
6	Correct	3 ms	4948 KB	Output is correct
7	Correct	4 ms	4948 KB	Output is correct
8	Correct	3 ms	4948 KB	Output is correct
9	Correct	3 ms	4948 KB	Output is correct
10	Correct	3 ms	4948 KB	Output is correct
11	Correct	3 ms	4948 KB	Output is correct
12	Correct	3 ms	5032 KB	Output is correct
13	Correct	4 ms	5032 KB	Output is correct
14	Correct	3 ms	4948 KB	Output is correct
15	Correct	3 ms	5032 KB	Output is correct
16	Correct	2 ms	4948 KB	Output is correct
17	Correct	3 ms	4948 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	3 ms	5028 KB	Output is correct
20	Correct	3 ms	5028 KB	Output is correct
21	Correct	4 ms	5204 KB	Output is correct
22	Correct	3 ms	4948 KB	Output is correct
23	Correct	3 ms	5032 KB	Output is correct
24	Correct	3 ms	4948 KB	Output is correct
25	Correct	3 ms	4956 KB	Output is correct
26	Correct	3 ms	5036 KB	Output is correct
27	Correct	3 ms	4948 KB	Output is correct
28	Correct	3 ms	5076 KB	Output is correct
29	Correct	3 ms	5076 KB	Output is correct
30	Correct	3 ms	5040 KB	Output is correct
31	Correct	3 ms	5076 KB	Output is correct
32	Correct	3 ms	5076 KB	Output is correct
33	Correct	4 ms	4948 KB	Output is correct
34	Correct	3 ms	5028 KB	Output is correct
35	Correct	3 ms	4948 KB	Output is correct
36	Correct	3 ms	5032 KB	Output is correct
37	Correct	3 ms	5076 KB	Output is correct
38	Correct	3 ms	5076 KB	Output is correct
39	Correct	5 ms	5060 KB	Output is correct
40	Correct	3 ms	5204 KB	Output is correct

Subtask #3
49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4948 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	3 ms	5028 KB	Output is correct
4	Correct	4 ms	5024 KB	Output is correct
5	Correct	3 ms	5028 KB	Output is correct
6	Correct	3 ms	4948 KB	Output is correct
7	Correct	4 ms	4948 KB	Output is correct
8	Correct	3 ms	4948 KB	Output is correct
9	Correct	3 ms	4948 KB	Output is correct
10	Correct	3 ms	4948 KB	Output is correct
11	Correct	3 ms	4948 KB	Output is correct
12	Correct	3 ms	5032 KB	Output is correct
13	Correct	4 ms	5032 KB	Output is correct
14	Correct	3 ms	4948 KB	Output is correct
15	Correct	3 ms	5032 KB	Output is correct
16	Correct	2 ms	4948 KB	Output is correct
17	Correct	3 ms	4948 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	3 ms	5028 KB	Output is correct
20	Correct	3 ms	5028 KB	Output is correct
21	Correct	4 ms	5204 KB	Output is correct
22	Correct	3 ms	4948 KB	Output is correct
23	Correct	3 ms	5032 KB	Output is correct
24	Correct	3 ms	4948 KB	Output is correct
25	Correct	3 ms	4956 KB	Output is correct
26	Correct	3 ms	5036 KB	Output is correct
27	Correct	3 ms	4948 KB	Output is correct
28	Correct	3 ms	5076 KB	Output is correct
29	Correct	3 ms	5076 KB	Output is correct
30	Correct	3 ms	5040 KB	Output is correct
31	Correct	3 ms	5076 KB	Output is correct
32	Correct	3 ms	5076 KB	Output is correct
33	Correct	4 ms	4948 KB	Output is correct
34	Correct	3 ms	5028 KB	Output is correct
35	Correct	3 ms	4948 KB	Output is correct
36	Correct	3 ms	5032 KB	Output is correct
37	Correct	3 ms	5076 KB	Output is correct
38	Correct	3 ms	5076 KB	Output is correct
39	Correct	5 ms	5060 KB	Output is correct
40	Correct	3 ms	5204 KB	Output is correct
41	Correct	37 ms	11632 KB	Output is correct
42	Correct	25 ms	7912 KB	Output is correct
43	Correct	29 ms	7860 KB	Output is correct
44	Correct	30 ms	7912 KB	Output is correct
45	Correct	31 ms	7880 KB	Output is correct
46	Correct	83 ms	10940 KB	Output is correct
47	Correct	74 ms	10956 KB	Output is correct
48	Correct	74 ms	10936 KB	Output is correct
49	Correct	75 ms	10948 KB	Output is correct
50	Correct	13 ms	6704 KB	Output is correct
51	Correct	14 ms	6704 KB	Output is correct
52	Correct	15 ms	6740 KB	Output is correct
53	Correct	27 ms	8440 KB	Output is correct
54	Correct	26 ms	8452 KB	Output is correct
55	Correct	24 ms	8472 KB	Output is correct
56	Correct	3 ms	5204 KB	Output is correct
57	Correct	7 ms	8404 KB	Output is correct
58	Correct	28 ms	20340 KB	Output is correct
59	Correct	55 ms	23360 KB	Output is correct
60	Correct	41 ms	12128 KB	Output is correct
61	Correct	55 ms	11500 KB	Output is correct

답안 #739417

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