oj.uz

Submission #725048

# Submission time Handle Problem Language Result Execution time Memory
725048 2023-04-16T14:37:54 Z MohammadAghil Meetings 2 (JOI21_meetings2) C++17
100 / 100
 403 ms 62060 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i = (l); i < (r); i++)
#define per(i,r,l) for(int i = (r); i >= (l); i--)
#define all(x) begin(x), end(x)
#define sz(x) (int)size(x)
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pp;

void dbg(){
     cerr << endl;
}
template<typename H, typename... T> void dbg(H h, T... t){
     cerr << h << ", ";
     dbg(t...);
}

void IOS(){
     cin.tie(0) -> sync_with_stdio(0);
     #ifndef ONLINE_JUDGE
          // freopen("inp.txt", "r", stdin);
          // freopen("out.txt", "w", stdout);
          #define er(...) cerr << __LINE__ << " <" << #__VA_ARGS__ << ">: ", dbg(__VA_ARGS__)
     #else
          #define er(...) 0
     #endif
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll mod = 1e9 + 7, mod2 = 1e9 + 9, maxn = 5e5 + 5, lg = 21, inf = ll(1e18) + 5, p = 9973;

ll pw(ll a, ll b){
     if(b == 0) return 1;
     ll k = pw(a, b>>1);
     return k*k*(b&1ll?a:1);
}

vector<int> adj[maxn];
int cnt[maxn], par[maxn][lg], h[maxn];

void dfs(int r, int p){
     cnt[r] = 1;
     for(int c: adj[r]) if(c - p){
          dfs(c, r);
          cnt[r] += cnt[c];
     }
}

vector<int> srt[maxn];
void dfs2(int r, int p){
     cnt[r] = 1;
     par[r][0] = p;
     rep(i,1,lg) par[r][i] = par[par[r][i-1]][i-1];
     for(int c: adj[r]) if(c - p){
          h[c] = h[r] + 1;
          dfs2(c, r);
          cnt[r] += cnt[c];
     }
     srt[cnt[r]].pb(r);
}

int lca(int u, int v){
     if(h[u] < h[v]) swap(u, v);
     per(i,lg-1,0) if(h[par[u][i]] >= h[v]) u = par[u][i];
     if(u == v) return u;
     per(i,lg-1,0) if(par[u][i] - par[v][i]) u = par[u][i], v = par[v][i];
     return par[u][0];
}

int dist(int u, int v){
     return h[u] + h[v] - 2*h[lca(u, v)];
}

int getCen(int r, int p, int tot){
     for(int c: adj[r]) if(c - p && cnt[c] + cnt[c] > tot) return getCen(c, r, tot);
     return r;
}

int main(){ IOS();
     int n; cin >> n;
     rep(i,1,n){
          int u, v; cin >> u >> v; u--, v--;
          adj[u].pb(v), adj[v].pb(u);
     }
     dfs(0, -1);
     int r = getCen(0, -1, n);
     dfs2(r, r);
     vector<int> ans(n + 1, 1);
     int u = r, v = r, diam = 0;
     for(int k = n>>1; k > 0; k--){
          for(int x: srt[k]){
               int d1 = dist(x, u), d2 = dist(x, v);
               if(d1 > diam){
                    diam = d1, v = x;
               } else if(d2 > diam){
                    diam = d2, u = x;
               }
          }
          ans[k<<1] = diam + 1;
     }
     rep(i,1,n+1) cout << ans[i] << '\n';
     return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23824 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23816 KB Output is correct
5 Correct 16 ms 23780 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 14 ms 23820 KB Output is correct
8 Correct 12 ms 23732 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 13 ms 23832 KB Output is correct
11 Correct 14 ms 23776 KB Output is correct
12 Correct 13 ms 23820 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 13 ms 23820 KB Output is correct
15 Correct 13 ms 23764 KB Output is correct
16 Correct 12 ms 23764 KB Output is correct
17 Correct 15 ms 23744 KB Output is correct
18 Correct 15 ms 23792 KB Output is correct
19 Correct 16 ms 23840 KB Output is correct
20 Correct 12 ms 23728 KB Output is correct
21 Correct 12 ms 23788 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23824 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23816 KB Output is correct
5 Correct 16 ms 23780 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 14 ms 23820 KB Output is correct
8 Correct 12 ms 23732 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 13 ms 23832 KB Output is correct
11 Correct 14 ms 23776 KB Output is correct
12 Correct 13 ms 23820 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 13 ms 23820 KB Output is correct
15 Correct 13 ms 23764 KB Output is correct
16 Correct 12 ms 23764 KB Output is correct
17 Correct 15 ms 23744 KB Output is correct
18 Correct 15 ms 23792 KB Output is correct
19 Correct 16 ms 23840 KB Output is correct
20 Correct 12 ms 23728 KB Output is correct
21 Correct 12 ms 23788 KB Output is correct
22 Correct 16 ms 24372 KB Output is correct
23 Correct 19 ms 24404 KB Output is correct
24 Correct 17 ms 24276 KB Output is correct
25 Correct 16 ms 24348 KB Output is correct
26 Correct 16 ms 24404 KB Output is correct
27 Correct 16 ms 24340 KB Output is correct
28 Correct 16 ms 24328 KB Output is correct
29 Correct 15 ms 24404 KB Output is correct
30 Correct 16 ms 24344 KB Output is correct
31 Correct 16 ms 24344 KB Output is correct
32 Correct 16 ms 24532 KB Output is correct
33 Correct 15 ms 24524 KB Output is correct
34 Correct 17 ms 24396 KB Output is correct
35 Correct 16 ms 24408 KB Output is correct
36 Correct 17 ms 24404 KB Output is correct
37 Correct 17 ms 24428 KB Output is correct
38 Correct 16 ms 24472 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23824 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23816 KB Output is correct
5 Correct 16 ms 23780 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 14 ms 23820 KB Output is correct
8 Correct 12 ms 23732 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 13 ms 23832 KB Output is correct
11 Correct 14 ms 23776 KB Output is correct
12 Correct 13 ms 23820 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 13 ms 23820 KB Output is correct
15 Correct 13 ms 23764 KB Output is correct
16 Correct 12 ms 23764 KB Output is correct
17 Correct 15 ms 23744 KB Output is correct
18 Correct 15 ms 23792 KB Output is correct
19 Correct 16 ms 23840 KB Output is correct
20 Correct 12 ms 23728 KB Output is correct
21 Correct 12 ms 23788 KB Output is correct
22 Correct 16 ms 24372 KB Output is correct
23 Correct 19 ms 24404 KB Output is correct
24 Correct 17 ms 24276 KB Output is correct
25 Correct 16 ms 24348 KB Output is correct
26 Correct 16 ms 24404 KB Output is correct
27 Correct 16 ms 24340 KB Output is correct
28 Correct 16 ms 24328 KB Output is correct
29 Correct 15 ms 24404 KB Output is correct
30 Correct 16 ms 24344 KB Output is correct
31 Correct 16 ms 24344 KB Output is correct
32 Correct 16 ms 24532 KB Output is correct
33 Correct 15 ms 24524 KB Output is correct
34 Correct 17 ms 24396 KB Output is correct
35 Correct 16 ms 24408 KB Output is correct
36 Correct 17 ms 24404 KB Output is correct
37 Correct 17 ms 24428 KB Output is correct
38 Correct 16 ms 24472 KB Output is correct
39 Correct 295 ms 50500 KB Output is correct
40 Correct 296 ms 49836 KB Output is correct
41 Correct 288 ms 50616 KB Output is correct
42 Correct 329 ms 50992 KB Output is correct
43 Correct 307 ms 50984 KB Output is correct
44 Correct 304 ms 51120 KB Output is correct
45 Correct 403 ms 57648 KB Output is correct
46 Correct 403 ms 62060 KB Output is correct
47 Correct 285 ms 51356 KB Output is correct
48 Correct 247 ms 51412 KB Output is correct
49 Correct 325 ms 51572 KB Output is correct
50 Correct 234 ms 51416 KB Output is correct
51 Correct 279 ms 59888 KB Output is correct