oj.uz

답안 #852942

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852942 2023-09-23T08:44:17 Z danikoynov Meetings 2 (JOI21_meetings2) C++14
20 / 100
 4000 ms 20800 KB 
/**
 ____ ____ ____ ____ ____ ____
||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];

    for (int u : adj[v])
    {
        if (u == p)
            continue;
        virtual_sub[v] = n - sub[u];
        dfs(u, v);
    }
    for (int i = 1; i < tin[v]; i ++)
    {
        if (act[order[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]]);
        }
    }

    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 = 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.0 / 4.0

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

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 2 ms 9816 KB Output is correct
3 Correct 3 ms 9976 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9816 KB Output is correct
6 Correct 2 ms 9816 KB Output is correct
7 Correct 2 ms 9820 KB Output is correct
8 Correct 2 ms 9816 KB Output is correct
9 Correct 2 ms 9816 KB Output is correct
10 Correct 2 ms 9816 KB Output is correct
11 Correct 2 ms 9816 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 2 ms 9816 KB Output is correct
14 Correct 2 ms 9816 KB Output is correct
15 Correct 2 ms 9816 KB Output is correct
16 Correct 3 ms 9820 KB Output is correct
17 Correct 2 ms 9816 KB Output is correct
18 Correct 2 ms 9816 KB Output is correct
19 Correct 2 ms 9816 KB Output is correct
20 Correct 2 ms 9816 KB Output is correct
21 Correct 3 ms 9816 KB Output is correct
22 Correct 29 ms 10200 KB Output is correct
23 Correct 25 ms 10072 KB Output is correct
24 Correct 25 ms 10072 KB Output is correct
25 Correct 24 ms 10072 KB Output is correct
26 Correct 24 ms 10072 KB Output is correct
27 Correct 25 ms 9972 KB Output is correct
28 Correct 27 ms 10200 KB Output is correct
29 Correct 27 ms 10076 KB Output is correct
30 Correct 25 ms 10072 KB Output is correct
31 Correct 25 ms 10076 KB Output is correct
32 Correct 30 ms 10328 KB Output is correct
33 Correct 31 ms 10328 KB Output is correct
34 Correct 29 ms 10072 KB Output is correct
35 Correct 28 ms 9976 KB Output is correct
36 Correct 30 ms 10076 KB Output is correct
37 Correct 30 ms 10072 KB Output is correct
38 Correct 29 ms 10328 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 2 ms 9816 KB Output is correct
3 Correct 3 ms 9976 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 2 ms 9816 KB Output is correct
6 Correct 2 ms 9816 KB Output is correct
7 Correct 2 ms 9820 KB Output is correct
8 Correct 2 ms 9816 KB Output is correct
9 Correct 2 ms 9816 KB Output is correct
10 Correct 2 ms 9816 KB Output is correct
11 Correct 2 ms 9816 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 2 ms 9816 KB Output is correct
14 Correct 2 ms 9816 KB Output is correct
15 Correct 2 ms 9816 KB Output is correct
16 Correct 3 ms 9820 KB Output is correct
17 Correct 2 ms 9816 KB Output is correct
18 Correct 2 ms 9816 KB Output is correct
19 Correct 2 ms 9816 KB Output is correct
20 Correct 2 ms 9816 KB Output is correct
21 Correct 3 ms 9816 KB Output is correct
22 Correct 29 ms 10200 KB Output is correct
23 Correct 25 ms 10072 KB Output is correct
24 Correct 25 ms 10072 KB Output is correct
25 Correct 24 ms 10072 KB Output is correct
26 Correct 24 ms 10072 KB Output is correct
27 Correct 25 ms 9972 KB Output is correct
28 Correct 27 ms 10200 KB Output is correct
29 Correct 27 ms 10076 KB Output is correct
30 Correct 25 ms 10072 KB Output is correct
31 Correct 25 ms 10076 KB Output is correct
32 Correct 30 ms 10328 KB Output is correct
33 Correct 31 ms 10328 KB Output is correct
34 Correct 29 ms 10072 KB Output is correct
35 Correct 28 ms 9976 KB Output is correct
36 Correct 30 ms 10076 KB Output is correct
37 Correct 30 ms 10072 KB Output is correct
38 Correct 29 ms 10328 KB Output is correct
39 Execution timed out 4014 ms 20800 KB Time limit exceeded
40 Halted 0 ms 0 KB -