oj.uz

Submission #752502

# Submission time Handle Problem Language Result Execution time Memory
752502 2023-06-03T05:35:59 Z GrindMachine Meetings 2 (JOI21_meetings2) C++17
20 / 100
 426 ms 126412 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 = 4e3 + 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);
vector<ll> tin(N), tout(N);
ll timer = 1;

void dfs1(ll u, ll p){
    tin[u] = timer++;
    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];
    }

    tout[u] = timer++;
}

ll dis[N][N];

void dfs2(ll u, ll p, ll s){
    trav(v,adj[u]){
        if(v == p) conts;
        dis[s][v] = dis[s][u] + 1;
        dfs2(v,u,s);
    }
}

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(u,n){
        dfs2(u,-1,u);
    }

    vector<ll> ans(2*n+5, 1);

    rep1(u,n){
        rep1(v,n){
            if(depth[u] < depth[v]) conts;
            ll d = dis[u][v];

            if(tin[v] <= tin[u] and tout[v] >= tout[u]){
                ll mn = min(subsiz[u], n-subsiz[v]);
                amax(ans[mn*2], d+2);
            }
            else{
                ll mn = min(subsiz[u], subsiz[v]);
                amax(ans[mn*2], d+1);
            }
        }
    }

    rev(i,n,1){
        amax(ans[i], ans[i+1]);
    }

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

        cout << ans[k] << endl;
    }
}

int main()
{
    fastio;

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

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

    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 580 KB Output is correct
9 Correct 1 ms 580 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 576 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 580 KB Output is correct
21 Correct 1 ms 596 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 580 KB Output is correct
9 Correct 1 ms 580 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 576 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 580 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 417 ms 125668 KB Output is correct
23 Correct 409 ms 125740 KB Output is correct
24 Correct 422 ms 124432 KB Output is correct
25 Correct 398 ms 124968 KB Output is correct
26 Correct 426 ms 124536 KB Output is correct
27 Correct 408 ms 126220 KB Output is correct
28 Correct 389 ms 126204 KB Output is correct
29 Correct 393 ms 126220 KB Output is correct
30 Correct 387 ms 126140 KB Output is correct
31 Correct 407 ms 126212 KB Output is correct
32 Correct 423 ms 126352 KB Output is correct
33 Correct 370 ms 126368 KB Output is correct
34 Correct 351 ms 126184 KB Output is correct
35 Correct 261 ms 126124 KB Output is correct
36 Correct 320 ms 126288 KB Output is correct
37 Correct 242 ms 126224 KB Output is correct
38 Correct 323 ms 126412 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 580 KB Output is correct
9 Correct 1 ms 580 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 576 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 580 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 417 ms 125668 KB Output is correct
23 Correct 409 ms 125740 KB Output is correct
24 Correct 422 ms 124432 KB Output is correct
25 Correct 398 ms 124968 KB Output is correct
26 Correct 426 ms 124536 KB Output is correct
27 Correct 408 ms 126220 KB Output is correct
28 Correct 389 ms 126204 KB Output is correct
29 Correct 393 ms 126220 KB Output is correct
30 Correct 387 ms 126140 KB Output is correct
31 Correct 407 ms 126212 KB Output is correct
32 Correct 423 ms 126352 KB Output is correct
33 Correct 370 ms 126368 KB Output is correct
34 Correct 351 ms 126184 KB Output is correct
35 Correct 261 ms 126124 KB Output is correct
36 Correct 320 ms 126288 KB Output is correct
37 Correct 242 ms 126224 KB Output is correct
38 Correct 323 ms 126412 KB Output is correct
39 Runtime error 3 ms 980 KB Execution killed with signal 11
40 Halted 0 ms 0 KB -