제출 #963953

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
963953		vjudge1	Meetings 2 (JOI21_meetings2)	C++17	20 / 100	4046 ms	17492 KiB

meetings2

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #include <x86intrin.h>

#include <bits/stdc++.h>
#include <chrono>
#include <random>

// @author: Vlapos

namespace operators
{
    template <typename T1, typename T2>
    std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x)
    {
        in >> x.first >> x.second;
        return in;
    }

    template <typename T1, typename T2>
    std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x)
    {
        out << x.first << " " << x.second;
        return out;
    }

    template <typename T1>
    std::istream &operator>>(std::istream &in, std::vector<T1> &x)
    {
        for (auto &i : x)
            in >> i;
        return in;
    }

    template <typename T1>
    std::ostream &operator<<(std::ostream &out, std::vector<T1> &x)
    {
        for (auto &i : x)
            out << i << " ";
        return out;
    }

    template <typename T1>
    std::ostream &operator<<(std::ostream &out, std::set<T1> &x)
    {
        for (auto &i : x)
            out << i << " ";
        return out;
    }
}

// name spaces
using namespace std;
using namespace operators;
// end of name spaces

// defines
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define uint unsigned int
#define all(vc) vc.begin(), vc.end()
// end of defines

// usefull stuff

void boost()
{
    ios_base ::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

inline int getbit(int &x, int &bt) { return (x >> bt) & 1; }

const int dx4[4] = {-1, 0, 0, 1};
const int dy4[4] = {0, -1, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1};

const ll INF = (1e18) + 500;
const int BIG = (1e9) * 2 + 100;
const int MAXN = (1e5) + 5;
const int MOD7 = (1e9) + 7;
const int MOD9 = (1e9) + 9;
const uint MODFFT = 998244353;

// #define int ll

struct segTreeSum
{
    vector<int> tree;
    int sz;

    void init(int n)
    {
        sz = n;
        tree.resize(2 * sz, -1);
    }

    int get(int l, int r) // [l, r)
    {
        l += sz;
        r += sz;
        int res = 0;

        while (l < r)
        {
            if (l & 1)
                res = max(res, tree[l++]);
            if (r & 1)
                res = max(res, tree[--r]);
            l >>= 1;
            r >>= 1;
        }

        return res;
    }

    void set(int pos, int val)
    {
        pos += sz;
        tree[pos] = max(val, tree[pos]);
        pos >>= 1;
        while (pos)
        {
            tree[pos] = max(tree[pos << 1], tree[(pos << 1) + 1]);
            pos >>= 1;
        }
    }
};

struct test
{
    vector<vector<int>> tree;
    vector<int> answers, used, sz;
    segTreeSum rng;
    int n;

    void dfsSz(int v, int pr = -1)
    {
        sz[v] = 1;
        for (auto tov : tree[v])
            if (tov != pr and !used[tov])
            {
                dfsSz(tov, v);
                sz[v] += sz[tov];
            }
    }

    void dfs(int v, int d, int pr, int SZ)
    {
        int p = min(SZ, sz[v]);
        answers[p * 2] = max(answers[p * 2], d);
        for (auto tov : tree[v])
        {
            if (tov != pr)
                dfs(tov, d + 1, v, SZ);
        }
    }

    void solve(int testcase)
    {
        boost();

        cin >> n;

        used.resize(n);
        sz.resize(n);
        rng.init(n);
        tree.resize(n);
        answers.resize(n + 1);
        for (int i = 0; i < n - 1; ++i)
        {
            int v, tov;
            cin >> v >> tov;
            --v, --tov;
            tree[v].pb(tov);
            tree[tov].pb(v);
        }

        for (int i = 0; i < n; ++i)
        {
            dfsSz(i);
            for (auto tov : tree[i])
                dfs(tov, 2, i, n - sz[tov]);
        }

        for (int i = (n / 2) * 2 - 2; i > 0; i -= 2)
        {
            answers[i] = max(answers[i], answers[i + 2]);
        }
        for (int i = 1; i <= n; ++i)
        {
            cout << max(1, answers[i]) << "\n";
        }
    }
};

main()
{
    boost();
    int q = 1;
    // cin >> q;
    for (int i = 0; i < q; i++)
    {
        test t;
        t.solve(i);
    }
    return 0;
}
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
//                                                                                    //
//                               Coded by Der_Vlἀpos                                  //
//                                                                                    //
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//

컴파일 시 표준 에러 (stderr) 메시지

meetings2.cpp:205:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  205 | main()
      | ^~~~

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