oj.uz

Submission #724980

# Submission time Handle Problem Language Result Execution time Memory
724980 2023-04-16T12:07:45 Z piOOE Meetings 2 (JOI21_meetings2) C++17
100 / 100
 260 ms 56816 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vector<vector<int>> adj(n);
    vector<int> parent(n), siz(n), depth(n);

    for (int i = 1; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        a -= 1, b -= 1;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    auto hld = [&](auto self, int v) -> void {
        siz[v] = 1;
        
        for (int &to : adj[v]) {
            adj[to].erase(find(adj[to].begin(), adj[to].end(), v));
            depth[to] = depth[v] + 1;
            self(self, to);
            siz[v] += siz[to];
            if (siz[to] > siz[adj[v][0]]) {
                swap(to, adj[v][0]);
            }
        }
    };

    hld(hld, 0);

    vector<map<int, int>> st(n);

    auto insert = [&](map<int, int> &mp, int x, int y) -> void {
        auto it = mp.lower_bound(x);
        if (it != mp.end() && it->second >= y) {
            return;
        }

        mp[x] = y;

        it = mp.find(x);
        while (it != mp.begin() && prev(it)->second <= y) {
            it = mp.erase(prev(it));
        }
    };

    constexpr int inf = 1e8 + 7;

    auto query = [&](map<int, int> &mp, int x) {
        auto it = mp.lower_bound(x);
        return it == mp.end() ? -inf : it->second;
    };

    vector<int> best(n + 1);

    auto dfs = [&](auto self, int v) -> void {
        if (adj[v].empty()) {
            insert(st[v], 1, depth[v]);
            return;
        }

        for (int to : adj[v]) {
            self(self, to);
        }

        int x = adj[v][0];
        int now = min(siz[x], n - siz[x]);
        int nxt = min(siz[x], n - siz[v]);

        for (int s = now; s > nxt; --s) {
            int d = query(st[x], s);
            best[min(s, n - siz[x])] = max(best[min(s, n - siz[x])], d - depth[v] + 1);
        }

        swap(st[v], st[x]);

        for (int to : adj[v]) {
            if (to == x) {
                continue;
            }
            for (int s = 1; s <= siz[to]; ++s) {
                int d = query(st[to], s);
                best[s] = max(best[s], d + query(st[v], s) - depth[v] * 2 + 1);
                best[min(s, n - siz[to])] = max(best[min(s, n - siz[to])], d - depth[v] + 1);
            }
            for (auto [a, b] : st[to]) {
                insert(st[v], a, b);
            }
            st[to].clear();
        }

        insert(st[v], siz[v], depth[v]);
    };

    dfs(dfs, 0);

    vector<int> ans(n + 1, 1);

    for (int i = 1; i <= n / 2; ++i) {
        ans[i * 2] = max(1, best[i]);
    }

    for (int i = 1; i <= n; ++i) {
        cout << ans[i] << "\n";
    }

    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 276 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 3 ms 724 KB Output is correct
25 Correct 3 ms 724 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 3 ms 724 KB Output is correct
29 Correct 3 ms 724 KB Output is correct
30 Correct 3 ms 724 KB Output is correct
31 Correct 4 ms 840 KB Output is correct
32 Correct 3 ms 1108 KB Output is correct
33 Correct 3 ms 1492 KB Output is correct
34 Correct 3 ms 980 KB Output is correct
35 Correct 2 ms 980 KB Output is correct
36 Correct 3 ms 852 KB Output is correct
37 Correct 3 ms 852 KB Output is correct
38 Correct 3 ms 1108 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 276 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 3 ms 724 KB Output is correct
25 Correct 3 ms 724 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 3 ms 724 KB Output is correct
29 Correct 3 ms 724 KB Output is correct
30 Correct 3 ms 724 KB Output is correct
31 Correct 4 ms 840 KB Output is correct
32 Correct 3 ms 1108 KB Output is correct
33 Correct 3 ms 1492 KB Output is correct
34 Correct 3 ms 980 KB Output is correct
35 Correct 2 ms 980 KB Output is correct
36 Correct 3 ms 852 KB Output is correct
37 Correct 3 ms 852 KB Output is correct
38 Correct 3 ms 1108 KB Output is correct
39 Correct 188 ms 24728 KB Output is correct
40 Correct 190 ms 24188 KB Output is correct
41 Correct 201 ms 24672 KB Output is correct
42 Correct 213 ms 25200 KB Output is correct
43 Correct 197 ms 25188 KB Output is correct
44 Correct 195 ms 25164 KB Output is correct
45 Correct 232 ms 41536 KB Output is correct
46 Correct 260 ms 56816 KB Output is correct
47 Correct 161 ms 33428 KB Output is correct
48 Correct 148 ms 34368 KB Output is correct
49 Correct 156 ms 25920 KB Output is correct
50 Correct 145 ms 29700 KB Output is correct
51 Correct 200 ms 50016 KB Output is correct