oj.uz

Submission #752418

# Submission time Handle Problem Language Result Execution time Memory
752418 2023-06-03T02:51:15 Z GrindMachine Meetings 2 (JOI21_meetings2) C++17
0 / 100
 5 ms 9728 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

shares some similar ideas to:
https://codeforces.com/contest/1824/problem/B2

*/

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[N];
vector<ll> subsiz(N), par(N), depth(N);

void dfs1(ll u, ll p){
    subsiz[u] = 1;
    par[u] = p;

    trav(v,adj[u]){
        if(v == p) conts;
        depth[v] = depth[u] + 1;
        dfs1(v,u);
        subsiz[u] += subsiz[v];
    }
}

void solve(int test_case)
{
    ll n; cin >> n;
    rep1(i,n-1){
        ll u,v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }

    dfs1(1,-1);

    rep1(k,n){
        if(k & 1){
            cout << 1 << endl;
            conts; 
        }

        ll ans = 0;

        rep1(u,n){
            if(subsiz[u] >= k/2){
                ll p = u;
                ll best = -1;

                while(true){
                    if(n-subsiz[p] < k/2){
                        break;
                    }

                    best = p;
                    p = par[p];
                }

                if(best != -1){
                    amax(ans, depth[u] - depth[best] + 1);
                }
            }
        }

        ans++;
        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9728 KB Output is correct
4 Incorrect 4 ms 9684 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9728 KB Output is correct
4 Incorrect 4 ms 9684 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9728 KB Output is correct
4 Incorrect 4 ms 9684 KB Output isn't correct
5 Halted 0 ms 0 KB -