oj.uz

Submission #1098666

# Submission time Handle Problem Language Result Execution time Memory
1098666 2024-10-09T16:26:33 Z Trisanu_Das Team Coding (EGOI24_teamcoding) C++17
62 / 100
 4000 ms 30668 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin.exceptions(cin.failbit);

    int n, k;
    cin >> n >> k;

    vector<int> c(n);
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }

    vector<vector<int>> g(n);
    for (int x = 1; x < n; ++x) {
        int p;
        cin >> p;
        g[p].emplace_back(x);
    }

    vector<int> level(n), is_root(n), below_same_color(n, 1);
    {
        vector<int> col_parent(n, -1);
        function<void(int)> dfs = [&](int x) {
            int cp = col_parent[c[x]];
            col_parent[c[x]] = x;
            for (int y : g[x]) {
                level[y] = level[x] + 1;
                dfs(y);
            }
            col_parent[c[x]] = cp;
            if (cp == -1) {
                is_root[x] = true;
            } else {
                below_same_color[cp] += below_same_color[x];
            }
        };
        dfs(0);
    }

    pair<int, int> best = {1, 1};

    vector<map<int, int>> col_at_lev(n);
    for (int i = 0; i < n; ++i) {
        ++col_at_lev[c[i]][level[i]];
    }

    {
        vector<vector<int>> below(n);
        function<void(int)> dfs = [&](int x) {
            for (int y : g[x]) {
                dfs(y);
                if (below[y].size() > below[x].size()) {
                    swap(below[x], below[y]);
                }
                for (int i = 0; i < below[y].size(); ++i) {
                    below[x][below[x].size() - 1 - i] += below[y][below[y].size() - 1 - i];
                }
            }

            below[x].emplace_back(1);
            if (!is_root[x]) return;

            int ans = 1;
            for (auto it = col_at_lev[c[x]].upper_bound(level[x]); it != col_at_lev[c[x]].end(); ++it) {
                auto [lev, cnt] = *it;
                int idx = below[x].size() - (lev - level[x]) - 1;
                if (idx < 0) continue;
                ans += min(below[x][idx], cnt);
            }
            best = max(best, {ans, below_same_color[x]});

        };
        dfs(0);
    }

    cout << best.first << " " << best.first - best.second << endl;
}

Compilation message

Main.cpp: In lambda function:
Main.cpp:60:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |                 for (int i = 0; i < below[y].size(); ++i) {
      |                                 ~~^~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 452 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 38 ms 30652 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 51 ms 30232 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 40 ms 30556 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 46 ms 30252 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 25 ms 15316 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Execution timed out 4096 ms 23140 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 408 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 50 ms 30496 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 43 ms 30668 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 452 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 58 ms 20168 KB Output is correct
19 Correct 58 ms 20424 KB Output is correct
20 Correct 58 ms 22392 KB Output is correct
21 Correct 48 ms 18228 KB Output is correct
22 Correct 65 ms 20188 KB Output is correct
23 Correct 56 ms 25548 KB Output is correct
24 Correct 44 ms 20940 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 2 ms 600 KB Output is correct
28 Correct 1 ms 736 KB Output is correct
29 Correct 4 ms 2396 KB Output is correct
30 Correct 50 ms 20028 KB Output is correct
31 Correct 76 ms 20424 KB Output is correct
32 Correct 61 ms 22444 KB Output is correct
33 Correct 53 ms 20064 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 844 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 920 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 716 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 5 ms 928 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 608 KB Output is correct
37 Correct 1 ms 752 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 352 KB Output is correct
40 Correct 0 ms 460 KB Output is correct
41 Correct 1 ms 356 KB Output is correct

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 452 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 38 ms 30652 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 51 ms 30232 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 40 ms 30556 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 2 ms 856 KB Output is correct
21 Correct 46 ms 30252 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 25 ms 15316 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Execution timed out 4096 ms 23140 KB Time limit exceeded
28 Halted 0 ms 0 KB -