oj.uz

Submission #286904

# Submission time Handle Problem Language Result Execution time Memory
286904 2020-08-31T06:55:39 Z two_sides Cat in a tree (BOI17_catinatree) C++17
100 / 100
 103 ms 25084 KB 
#include <bits/stdc++.h>
using namespace std;

template <class X, class Y>
bool cmax(X &a, const Y &b) {
    return a < b ? a = b, 1 : 0;
}

const int N = 2e5 + 5;

vector <int> adj[N];
int n, k;

int& rev(vector <int> &a, int i) {
    return a[a.size() - i - 1];
}

vector <int> dfs(int u) {
    vector <int> res(1, 1);
    for (int v : adj[u]) {
        auto add = dfs(v);
        add.push_back(add.back());
        if (add.size() > res.size())
            swap(add, res);
        for (int i = 0; i < add.size(); i++) {
            int a = rev(add, i) + (k - i < res.size() ?
            rev(res, max(i, k - i)) : 0);
            int b = rev(res, i) + (k - i < add.size() ?
            rev(add, max(i, k - i)) : 0);
            cmax(rev(res, i), max(a, b));
        }
        for (int i = add.size() - 1; ~i; i--)
            if (i + 1 < res.size())
                cmax(rev(res, i), rev(res, i + 1));
    }
    return res;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k;
    for (int i = 1; i < n; i++) {
        int j; cin >> j;
        adj[j].push_back(i);
    }
    cout << dfs(0).back() << '\n';
}

Compilation message

catinatree.cpp: In function 'std::vector<int> dfs(int)':
catinatree.cpp:25:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for (int i = 0; i < add.size(); i++) {
      |                         ~~^~~~~~~~~~~~
catinatree.cpp:26:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |             int a = rev(add, i) + (k - i < res.size() ?
      |                                    ~~~~~~^~~~~~~~~~~~
catinatree.cpp:28:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |             int b = rev(res, i) + (k - i < add.size() ?
      |                                    ~~~~~~^~~~~~~~~~~~
catinatree.cpp:33:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |             if (i + 1 < res.size())
      |                 ~~~~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 3 ms 4992 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 3 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 4 ms 4992 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 4 ms 4992 KB Output is correct
17 Correct 4 ms 4992 KB Output is correct
18 Correct 4 ms 4992 KB Output is correct
19 Correct 3 ms 4992 KB Output is correct
20 Correct 3 ms 4992 KB Output is correct
21 Correct 4 ms 5376 KB Output is correct
22 Correct 4 ms 4992 KB Output is correct
23 Correct 4 ms 4992 KB Output is correct
24 Correct 4 ms 4992 KB Output is correct
25 Correct 4 ms 4992 KB Output is correct
26 Correct 4 ms 4992 KB Output is correct
27 Correct 4 ms 5088 KB Output is correct
28 Correct 4 ms 5120 KB Output is correct
29 Correct 4 ms 5120 KB Output is correct
30 Correct 4 ms 5120 KB Output is correct
31 Correct 4 ms 5120 KB Output is correct
32 Correct 4 ms 4992 KB Output is correct
33 Correct 4 ms 4992 KB Output is correct
34 Correct 4 ms 4992 KB Output is correct
35 Correct 4 ms 4992 KB Output is correct
36 Correct 4 ms 4992 KB Output is correct
37 Correct 4 ms 5120 KB Output is correct
38 Correct 4 ms 5120 KB Output is correct
39 Correct 4 ms 5120 KB Output is correct
40 Correct 4 ms 5376 KB Output is correct
41 Correct 62 ms 9852 KB Output is correct
42 Correct 45 ms 7168 KB Output is correct
43 Correct 44 ms 7168 KB Output is correct
44 Correct 40 ms 7164 KB Output is correct
45 Correct 45 ms 7268 KB Output is correct
46 Correct 100 ms 9592 KB Output is correct
47 Correct 103 ms 9464 KB Output is correct
48 Correct 100 ms 9592 KB Output is correct
49 Correct 99 ms 9464 KB Output is correct
50 Correct 27 ms 6016 KB Output is correct
51 Correct 26 ms 6016 KB Output is correct
52 Correct 27 ms 6016 KB Output is correct
53 Correct 57 ms 6912 KB Output is correct
54 Correct 56 ms 6912 KB Output is correct
55 Correct 57 ms 6912 KB Output is correct
56 Correct 4 ms 5248 KB Output is correct
57 Correct 12 ms 8832 KB Output is correct
58 Correct 38 ms 22520 KB Output is correct
59 Correct 96 ms 25084 KB Output is correct
60 Correct 62 ms 10356 KB Output is correct
61 Correct 72 ms 10156 KB Output is correct