oj.uz

답안 #386379

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386379 2021-04-06T13:27:15 Z Mamnoon_Siam Meetings 2 (JOI21_meetings2) C++17
100 / 100
 2366 ms 86664 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
#define all(v) begin(v), end(v)
#define sz(v) (int)(v).size()
#define fi first
#define se second

/**
 * Author: Lucian Bicsi
 * Date: 2017-10-31
 * License: CC0
 * Source: folklore
 * Description: Zero-indexed max-tree. Bounds are inclusive to the left and exclusive to the right. Can be changed by modifying T, f and unit.
 * Time: O(\log N)
 * Status: stress-tested
 */

struct Tree {
  typedef int T;
  static constexpr T unit = INT_MIN;
  T f(T a, T b) { return max(a, b); } // (any associative fn)
  vector<T> s; int n;
  Tree(int _n = 0, T def = unit) : s(2*_n, def), n(_n) {}
  void update(int pos, T val) {
    pos--;
    pos += n;
    s[pos] = f(s[pos], val);
    for (; pos >>= 1;) // do u mean += val???
      s[pos] = f(s[pos << 1], s[pos << 1 | 1]);
  }
  T query(int b, int e) { // query [b, e)
    b--;
    T ra = unit, rb = unit;
    for (b += n, e += n; b < e; b >>= 1, e >>= 1) {
      if (b & 1) ra = f(ra, s[b++]);
      if (e & 1) rb = f(s[--e], rb);
    }
    return f(ra, rb);
  }
  void reset(int pos) {
    pos--;
    pos += n;
    s[pos] = unit;
    for (; pos >>= 1;) // do u mean += val???
      s[pos] = f(s[pos << 1], s[pos << 1 | 1]);
  }
} tr;

const int N = 2e5 + 5;
const int lg = 18;
using tri = array<int, 3>; // index, length, size

vector<ii> upds;

int n;
int sub[N], in[N], tym = 0, lvl[N], dp[lg][N];
vi g[N];
int sub0[N];
int vis[N]; // already centroid

bool isanc(int u, int v) { // is u v's anc?
  return in[u] <= in[v] and in[v] < in[u]+sub[u];
}
int __lca(int u, int v) {
  if(lvl[u] > lvl[v]) swap(u, v);
  int d = lvl[v] - lvl[u];
  for(int i = 0; i < lg; ++i)
    if(d >> i & 1) v = dp[i][v];
  if(u == v) return u;
  for(int i = lg-1; i >= 0; --i)
    if(dp[i][u] != dp[i][v])
      u = dp[i][u], v = dp[i][v];
  return dp[0][u];
}
int kth_anc(int u, int k) {
  for(int i = 0; i < lg; ++i)
    if(k >> i & 1) u = dp[i][u];
  return u;
}
int dis(int u, int v) {
  return lvl[u] + lvl[v] - 2*lvl[__lca(u,v)];
}
int directed_size(int u, int v) { // it MUST be and EDGE
  return in[u] < in[v] ? sub0[v] : n - sub0[u];
}

void dfs_sizes(int u, int dad) {
  sub[u] = 1;
  for(int v : g[u]) if(!vis[v] and v != dad) {
    dfs_sizes(v, u);
    sub[u] += sub[v];
  }
}

int centroid(int u, int dad, int thr) {
  for(int v : g[u]) if(!vis[v] and v != dad and sub[v] > thr) {
    return centroid(v, u, thr);
  } return u;
}

void dfs_calc(int u, int dad, int level, vector<ii>& bag) {
  bag.emplace_back(level, directed_size(dad, u));
  for(int v : g[u]) if(!vis[v] and v != dad) {
    dfs_calc(v, u, level+1, bag);
  }
}

int decompose(int u) {
  dfs_sizes(u, -1);
  int cen = centroid(u, -1, sub[u]/2);
  vi back;
  vector<vector<ii>> bags;
  for(int v : g[cen]) if(!vis[v]) {
    back.emplace_back(directed_size(v, cen));
    bags.push_back({});
    dfs_calc(v, cen, 1, bags.back());
  }
  for(int i = 0; i < sz(back); ++i) {
    for(auto& [len, size] : bags[i]) {
      int mx = tr.query(size, n);
      if(mx != INT_MIN) {
        upds.emplace_back(mx + len + 1, size);
      }
    }
    for(auto& [len, size] : bags[i]) {
      tr.update(size, len);
    }
  }
  for(int i = 0; i < sz(back); ++i) {
    for(auto& [len, size] : bags[i]) {
      tr.reset(size);
    }
  }
  for(int i = sz(back)-1; i >= 0; --i) {
    for(auto& [len, size] : bags[i]) {
      int mx = tr.query(size, n);
      if(mx != INT_MIN) {
        upds.emplace_back(mx + len + 1, size);
      }
    }
    for(auto& [len, size] : bags[i]) {
      tr.update(size, len);
    }
  }
  for(int i = 0; i < sz(back); ++i) {
    for(auto& [len, size] : bags[i]) {
      tr.reset(size);
    }
  }
  for(int i = 0; i < sz(back); ++i) {
    for(auto& [len, size] : bags[i]) {
      upds.emplace_back(len+1, min(size, back[i]));
    }
  }
  vis[cen] = 1;
  for(int v : g[cen]) if(!vis[v]) {
    decompose(v);
  }
  return cen;
}

void dfs_initial(int u, int dad) {
  in[u] = ++tym;
  sub0[u] = 1;
  lvl[u] = dad ? lvl[dad] + 1 : 0;
  dp[0][u] = dad;
  for(int i = 1; i < lg; ++i)
    dp[i][u] = dp[i-1][dp[i-1][u]];
  for(int v : g[u]) if(v != dad) {
    dfs_initial(v, u);
    sub0[u] += sub0[v];
  }
}

int main(int argc, char const *argv[])
{
#ifdef LOCAL
  freopen("in", "r", stdin);
#endif
  upds.reserve(3*lg*N);
  scanf("%d", &n);
  tr = Tree(n);
  // assert(n <= 4000);
  for(int i = 1; i < n; ++i) {
    int u, v; scanf("%d %d", &u, &v);
    g[u].emplace_back(v);
    g[v].emplace_back(u);
  }
  dfs_initial(1, 0);
  decompose(1);
  vi ans(n+1, 1);
  sort(all(upds)); reverse(all(upds));
  int ptr = 0;
  for(auto [d, mn] : upds) {
    while(ptr < mn) {
      ans[2*(++ptr)] = d;
    }
  }
  for(int i = 1; i <= n; ++i)
    printf("%d\n", ans[i]);
  return 0;
}

Compilation message

meetings2.cpp: In function 'int main(int, const char**)':
meetings2.cpp:185:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  185 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
meetings2.cpp:189:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  189 |     int u, v; scanf("%d %d", &u, &v);
      |               ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 5 ms 5100 KB Output is correct
9 Correct 5 ms 5100 KB Output is correct
10 Correct 6 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5104 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 5 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 5 ms 5100 KB Output is correct
9 Correct 5 ms 5100 KB Output is correct
10 Correct 6 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5104 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 5 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 17 ms 6380 KB Output is correct
23 Correct 20 ms 6252 KB Output is correct
24 Correct 17 ms 6252 KB Output is correct
25 Correct 17 ms 6252 KB Output is correct
26 Correct 17 ms 6252 KB Output is correct
27 Correct 16 ms 6252 KB Output is correct
28 Correct 17 ms 6252 KB Output is correct
29 Correct 16 ms 6252 KB Output is correct
30 Correct 16 ms 6252 KB Output is correct
31 Correct 17 ms 6252 KB Output is correct
32 Correct 23 ms 6380 KB Output is correct
33 Correct 24 ms 6508 KB Output is correct
34 Correct 10 ms 5996 KB Output is correct
35 Correct 8 ms 5996 KB Output is correct
36 Correct 17 ms 6252 KB Output is correct
37 Correct 11 ms 6124 KB Output is correct
38 Correct 16 ms 6252 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 5 ms 5100 KB Output is correct
9 Correct 5 ms 5100 KB Output is correct
10 Correct 6 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5104 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 5 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 17 ms 6380 KB Output is correct
23 Correct 20 ms 6252 KB Output is correct
24 Correct 17 ms 6252 KB Output is correct
25 Correct 17 ms 6252 KB Output is correct
26 Correct 17 ms 6252 KB Output is correct
27 Correct 16 ms 6252 KB Output is correct
28 Correct 17 ms 6252 KB Output is correct
29 Correct 16 ms 6252 KB Output is correct
30 Correct 16 ms 6252 KB Output is correct
31 Correct 17 ms 6252 KB Output is correct
32 Correct 23 ms 6380 KB Output is correct
33 Correct 24 ms 6508 KB Output is correct
34 Correct 10 ms 5996 KB Output is correct
35 Correct 8 ms 5996 KB Output is correct
36 Correct 17 ms 6252 KB Output is correct
37 Correct 11 ms 6124 KB Output is correct
38 Correct 16 ms 6252 KB Output is correct
39 Correct 1407 ms 70264 KB Output is correct
40 Correct 1346 ms 68444 KB Output is correct
41 Correct 1406 ms 69060 KB Output is correct
42 Correct 1357 ms 69344 KB Output is correct
43 Correct 1386 ms 69376 KB Output is correct
44 Correct 1380 ms 69876 KB Output is correct
45 Correct 2366 ms 86664 KB Output is correct
46 Correct 2326 ms 83896 KB Output is correct
47 Correct 437 ms 47448 KB Output is correct
48 Correct 323 ms 50512 KB Output is correct
49 Correct 1548 ms 71148 KB Output is correct
50 Correct 485 ms 49616 KB Output is correct
51 Correct 1324 ms 70584 KB Output is correct