oj.uz

답안 #853039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
853039 2023-09-23T10:54:34 Z danikoynov Meetings 2 (JOI21_meetings2) C++14
100 / 100
 1351 ms 32840 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];

void input()
{
    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);
    }
}

int used[maxn], sub[maxn], init_sub[maxn];

void init_calc(int v, int p)
{
    init_sub[v] = 1;
    for (int u : adj[v])
    {
        if (u == p || used[u])
            continue;
        init_calc(u, v);
        init_sub[v] += init_sub[u];
    }

}
void calc(int v, int p)
{
    sub[v] = 1;
    for (int u : adj[v])
    {
        if (u == p || used[u])
            continue;
        calc(u, v);
        sub[v] += sub[u];
    }
}

int find_centroid(int v, int p, int sz)
{
    for (int u : adj[v])
    {
        if (u == p || used[u])
            continue;
        if (sub[u] > sz / 2)
            return find_centroid(u, v, sz);
    }
    return v;
}

int depth[maxn], temp_sub[maxn];
void make_data(int v, int p)
{
    ///cout << "make data " << v << " " << p << endl;
    for (int u : adj[v])
    {
        if (used[u] || u == p)
            continue;
        depth[u] = depth[v] + 1;

        if (init_sub[u] < init_sub[v])
            temp_sub[u] = init_sub[u];
        else
            temp_sub[u] = n - init_sub[v];
            make_data(u, v);
    }
}

set < pair < int, int > > act;
int max_path[maxn];
void check(int v, int p, int gb)
{
    int id = 2 * min(gb, temp_sub[v]);

    max_path[id] = max(max_path[id], depth[v]);

    pair < int, int > cur = {temp_sub[v],  -1};
    set < pair < int, int > > :: iterator it = act.lower_bound(cur);

    if (it != act.end())
    {
        ///if (2 * temp_sub[v] >= 4 && depth[v] + it -> second == 6)
        ///cout << "check " << v << " " << 2 * temp_sub[v] << " " << depth[v] << " " << it -> second << endl;
        max_path[2 * temp_sub[v]] = max(max_path[2 * temp_sub[v]], it -> second + depth[v]);
    }

    for (int u : adj[v])
    {
        if (used[u] || u == p)
            continue;
        check(u, v, gb);
    }
}

void add(int v, int p)
{
    pair < int, int > cur = {temp_sub[v],  depth[v]};
    set < pair < int, int > > :: iterator it = act.lower_bound(cur);
    ///if (depth[v] >= 3 && temp_sub[v] >= 2)
   /// cout << "ADD " << v << " " << temp_sub[v] << " " << depth[v] << endl;
    if (it == act.end() || it -> second < depth[v])
    {
        act.insert(cur);
        while(true)
        {
            it = act.find(cur);
            if (it == act.begin())
                break;
            it = prev(it);
            if (it -> second <= depth[v])
                act.erase(it);
            else
                break;
        }
    }

    for (int u : adj[v])
    {
        if (used[u] || u == p)
            continue;
        add(u, v);
    }

}
void decompose(int v)
{
    calc(v, 0);
    v = find_centroid(v, 0, sub[v]);

    /// v is centroid

     used[v] = 1;
     depth[v] = 0;
     make_data(v, 0);
    ///cout << "centroid " << v << endl;
    for (int j = 0; j < adj[v].size(); j ++)
    {
        int u = adj[v][j];
        if (used[u])
            continue;
        check(u, v, n - temp_sub[u]);
        add(u, v);
    }
    act.clear();

    reverse(adj[v].begin(), adj[v].end());
    for (int j = 0; j < adj[v].size(); j ++)
    {
        int u = adj[v][j];
        if (used[u])
            continue;
        check(u, v, n - temp_sub[u]);
        add(u, v);
    }
    act.clear();

    for (int u : adj[v])
    {
        if (!used[u])
        {
            decompose(u);
        }
    }
}
void solve()
{
    input();
    init_calc(1, 0);
    for (int i = 1; i <= n; i ++)
        max_path[i] = -1;
    decompose(1);
    for (int i = n; i > 0; i --)
        max_path[i] = max(max_path[i], max_path[i + 1]);

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


}

int main()
{
    speed();
    solve();
    return 0;
}
/**
14
10 14
3 10
14 13
1 3
3 5
3 11
12 14
14 6
11 8
2 3
7 8
9 7
1 4

*/

Compilation message

meetings2.cpp: In function 'void make_data(int, int)':
meetings2.cpp:89:9: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
   89 |         else
      |         ^~~~
meetings2.cpp:91:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
   91 |             make_data(u, v);
      |             ^~~~~~~~~
meetings2.cpp: In function 'void decompose(int)':
meetings2.cpp:162:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  162 |     for (int j = 0; j < adj[v].size(); j ++)
      |                     ~~^~~~~~~~~~~~~~~
meetings2.cpp:173:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  173 |     for (int j = 0; j < adj[v].size(); j ++)
      |                     ~~^~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 3 ms 9676 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 2 ms 9564 KB Output is correct
5 Correct 2 ms 9564 KB Output is correct
6 Correct 2 ms 9564 KB Output is correct
7 Correct 2 ms 9564 KB Output is correct
8 Correct 2 ms 9564 KB Output is correct
9 Correct 2 ms 9564 KB Output is correct
10 Correct 2 ms 9564 KB Output is correct
11 Correct 2 ms 9564 KB Output is correct
12 Correct 2 ms 9564 KB Output is correct
13 Correct 2 ms 9564 KB Output is correct
14 Correct 2 ms 9564 KB Output is correct
15 Correct 2 ms 9564 KB Output is correct
16 Correct 2 ms 9656 KB Output is correct
17 Correct 2 ms 9564 KB Output is correct
18 Correct 2 ms 9564 KB Output is correct
19 Correct 2 ms 9564 KB Output is correct
20 Correct 2 ms 9564 KB Output is correct
21 Correct 2 ms 9564 KB Output is correct
22 Correct 6 ms 9816 KB Output is correct
23 Correct 6 ms 9828 KB Output is correct
24 Correct 6 ms 9780 KB Output is correct
25 Correct 7 ms 9972 KB Output is correct
26 Correct 6 ms 9820 KB Output is correct
27 Correct 6 ms 9820 KB Output is correct
28 Correct 6 ms 9828 KB Output is correct
29 Correct 7 ms 9832 KB Output is correct
30 Correct 6 ms 9816 KB Output is correct
31 Correct 6 ms 9820 KB Output is correct
32 Correct 12 ms 9988 KB Output is correct
33 Correct 11 ms 10076 KB Output is correct
34 Correct 3 ms 9820 KB Output is correct
35 Correct 3 ms 9820 KB Output is correct
36 Correct 6 ms 9820 KB Output is correct
37 Correct 3 ms 9816 KB Output is correct
38 Correct 7 ms 9820 KB Output is correct
39 Correct 426 ms 16440 KB Output is correct
40 Correct 504 ms 16308 KB Output is correct
41 Correct 557 ms 16456 KB Output is correct
42 Correct 504 ms 16572 KB Output is correct
43 Correct 426 ms 16568 KB Output is correct
44 Correct 473 ms 16572 KB Output is correct
45 Correct 1095 ms 23924 KB Output is correct
46 Correct 1351 ms 32840 KB Output is correct
47 Correct 114 ms 19656 KB Output is correct
48 Correct 87 ms 19720 KB Output is correct
49 Correct 523 ms 19852 KB Output is correct
50 Correct 98 ms 19916 KB Output is correct
51 Correct 617 ms 29696 KB Output is correct