oj.uz

답안 #823388

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823388 2023-08-12T12:52:46 Z serifefedartar Cat in a tree (BOI17_catinatree) C++17
51 / 100
 139 ms 19952 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define MOD 1000000009
#define LOGN 20
#define MAXN 2005

vector<vector<int>> graph;
int N, D;
int dp[MAXN][MAXN];
void solve(int node) {
    dp[node][0] = 1;
    for (auto u : graph[node]) {
        solve(u);
        dp[node][0] += dp[u][D-1];
    }

    for (int dist = 1; dist <= N; dist++) {
        if (dist * 2 >= D) {
            for (auto u : graph[node])
                dp[node][dist] += dp[u][dist-1];            
        } else {
            int complement = D - dist - 1;
            vector<int> pref(N+1, 0), suff(N+2, 0);
            for (int i = 1; i <= graph[node].size(); i++)
                pref[i] = pref[i-1] + dp[graph[node][i-1]][complement];
            for (int i = graph[node].size(); i >= 1; i--)
                suff[i] = suff[i+1] + dp[graph[node][i-1]][complement];
            for (int i = 0; i < graph[node].size(); i++)
                dp[node][dist] = max(dp[node][dist], pref[i] + suff[i+2] + dp[graph[node][i]][dist-1]);
        }
    }

    for (int i = N; i >= 1; i--)
        dp[node][i-1] = max(dp[node][i-1], dp[node][i]);
}

int main() {
    fast
    cin >> N >> D;

    graph = vector<vector<int>>(N, vector<int>());
    for (int i = 1; i < N; i++) {
        int parent; cin >> parent;
        graph[parent].push_back(i);
    }
    solve(0);

    cout << dp[0][0] << "\n";
}

Compilation message

catinatree.cpp: In function 'void solve(int)':
catinatree.cpp:29:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |             for (int i = 1; i <= graph[node].size(); i++)
      |                             ~~^~~~~~~~~~~~~~~~~~~~~
catinatree.cpp:33:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |             for (int i = 0; i < graph[node].size(); i++)
      |                             ~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 139 ms 12320 KB Output is correct
22 Correct 2 ms 3284 KB Output is correct
23 Correct 2 ms 3268 KB Output is correct
24 Correct 2 ms 3284 KB Output is correct
25 Correct 6 ms 8160 KB Output is correct
26 Correct 7 ms 8212 KB Output is correct
27 Correct 7 ms 8124 KB Output is correct
28 Correct 13 ms 12076 KB Output is correct
29 Correct 13 ms 12116 KB Output is correct
30 Correct 14 ms 12164 KB Output is correct
31 Correct 17 ms 12128 KB Output is correct
32 Correct 12 ms 11852 KB Output is correct
33 Correct 13 ms 11868 KB Output is correct
34 Correct 12 ms 11348 KB Output is correct
35 Correct 14 ms 11252 KB Output is correct
36 Correct 17 ms 12100 KB Output is correct
37 Correct 13 ms 12104 KB Output is correct
38 Correct 18 ms 12116 KB Output is correct
39 Correct 21 ms 12208 KB Output is correct
40 Correct 13 ms 12364 KB Output is correct

Subtask #3
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 139 ms 12320 KB Output is correct
22 Correct 2 ms 3284 KB Output is correct
23 Correct 2 ms 3268 KB Output is correct
24 Correct 2 ms 3284 KB Output is correct
25 Correct 6 ms 8160 KB Output is correct
26 Correct 7 ms 8212 KB Output is correct
27 Correct 7 ms 8124 KB Output is correct
28 Correct 13 ms 12076 KB Output is correct
29 Correct 13 ms 12116 KB Output is correct
30 Correct 14 ms 12164 KB Output is correct
31 Correct 17 ms 12128 KB Output is correct
32 Correct 12 ms 11852 KB Output is correct
33 Correct 13 ms 11868 KB Output is correct
34 Correct 12 ms 11348 KB Output is correct
35 Correct 14 ms 11252 KB Output is correct
36 Correct 17 ms 12100 KB Output is correct
37 Correct 13 ms 12104 KB Output is correct
38 Correct 18 ms 12116 KB Output is correct
39 Correct 21 ms 12208 KB Output is correct
40 Correct 13 ms 12364 KB Output is correct
41 Runtime error 30 ms 19952 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -