제출 #971524

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
971524	2024-04-28 18:01:54	vjudge1	Meetings 2 (JOI21_meetings2)	C++14	100 / 100	318 ms	25884 KiB

meetings2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pf push_front
#define fi first
#define se second
const ll mod = 1e9+7, mxn = 2e5+7;
ll sz[mxn], max_h[mxn], old_max_h[mxn], n, h[mxn], ans[mxn];
bool del[mxn];
vector<vector<ll>> g(mxn);
void dfs_sz(ll u, ll v) {sz[u] = 1; for (ll i : g[u]) {if (i != v && !del[i]) {dfs_sz(i,u); sz[u] += sz[i];}}}
ll dfs_ctr(ll u, ll v, ll szx) {for (ll i : g[u]) {if (i != v && !del[i] && sz[i] > szx/2) {return dfs_ctr(i,u,szx);}} return u;}
void dfs_mx(ll u, ll v)
{
    sz[u] = 1;
    for (ll i : g[u]) {if (i != v && !del[i]) {h[i] = h[u]+1; dfs_mx(i,u); sz[u] += sz[i];}}
    max_h[sz[u]] = max(max_h[sz[u]],h[u]);
}
void solve(ll u)
{
    dfs_sz(u,u); u = dfs_ctr(u,u,sz[u]); h[u] = 1; ll reset_bound = 0;
    for (ll i : g[u])
    {
        if (!del[i]) 
        {
            h[i] = 2; dfs_mx(i,u); reset_bound = max(reset_bound,sz[i]);
            for (ll j = sz[i]; j >= 0; j--) max_h[j] = max(max_h[j],max_h[j+1]);
            for (ll j = sz[i]; j >= 0; j--)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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