Submission #852948

#	Time	Username	Problem	Language	Result	Execution time	Memory
852948		danikoynov	Meetings 2 (JOI21_meetings2)	C++14	20 / 100	4019 ms	18256 KiB

meetings2

/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 2e5 + 10;

int n;
vector < int > adj[maxn];
int order[maxn], tin[maxn], tout[maxn];
int timer, depth[maxn], sub[maxn];

void euler(int v, int p)
{
    order[++ timer] = v;
    tin[v] = timer;

    sub[v] = 1;
    for (int u : adj[v])
    {
        if (u == p)
            continue;
        depth[u] = depth[v] + 1;
        euler(u, v);
        sub[v] += sub[u];
    }

    tout[v] = timer;
}

vector < int > path;
int max_chain[maxn], virtual_depth[maxn], virtual_sub[maxn];
int act[maxn];

void dfs(int v, int p)
{
    for (int cur : path)
    {
        int id = 2 * min(virtual_sub[cur], sub[v]);
        max_chain[id] = max(max_chain[id], depth[v] - depth[cur]);
        ///cout << "here " << v << " " << cur << " " << virtual_sub[cur] << " " << sub[v] << endl;
    }
    path.push_back(v);
    virtual_depth[v] = -depth[v];


        int max_len = -1;
    for (int i = 1; i <= n; i ++)
    {
        if (act[i] && sub[i] >= sub[v])
        {
            max_len = max(max_len, depth[v] + virtual_depth[i]);
            ///int id = 2 * min(sub[v], sub[order[i]]);
            //cout << v << " : " << order[i] << " " << depth[v] + virtual_depth[order[i]] << " " << id << endl;
            ///max_chain[id] = max(max_chain[id], depth[v] + virtual_depth[order[i]]);
        }
    }
    max_chain[2 * sub[v]] = max(max_chain[2 * sub[v]], max_len);
    for (int u : adj[v])
    {
        if (u == p)
            continue;
        virtual_sub[v] = n - sub[u];
        dfs(u, v);
    }


    for (int i = tin[v]; i <= tout[v]; i ++)
        virtual_depth[order[i]] += 2;
    path.pop_back();
    act[v] = 1;
}
void solve()
{
    cin >> n;
    for (int i = 1; i < n; i ++)
    {
        int v, u;
        cin >> v >> u;
        adj[v].push_back(u);
        adj[u].push_back(v);
    }

    euler(1, 0);
    for (int i = 1; i <= n; i ++)
    {
        max_chain[i] = -1;
    }

    dfs(1, 0);

    for (int i = 1; i <= n; i ++)
    {
        act[i] = 0;
        reverse(adj[i].begin(), adj[i].end());
    }
    euler(1, 0);
    dfs(1, 0);

    for (int i = n; i > 0; i --)
    {
        max_chain[i] = max(max_chain[i], max_chain[i + 1]);
    }

    for (int i = 1; i <= n; i ++)
    {
        if (i % 2 == 1)
            cout << 1 << endl;
        else
            cout << max_chain[i] + 1 << endl;
    }
}

int main()
{
    speed();
    solve();
    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 16 / 16
• Subtask 3: 0 / 80