結果

問題 No.2618 除霊
ユーザー risujirohrisujiroh
提出日時 2024-01-26 23:26:56
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,425 ms / 2,000 ms
コード長 7,148 bytes
コンパイル時間 5,185 ms
コンパイル使用メモリ 311,372 KB
実行使用メモリ 62,436 KB
最終ジャッジ日時 2024-01-26 23:27:31
合計ジャッジ時間 32,067 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,676 KB
testcase_01 AC 2 ms
6,676 KB
testcase_02 AC 2 ms
6,676 KB
testcase_03 AC 2 ms
6,676 KB
testcase_04 AC 2 ms
6,676 KB
testcase_05 AC 2 ms
6,676 KB
testcase_06 AC 522 ms
38,468 KB
testcase_07 AC 464 ms
38,256 KB
testcase_08 AC 819 ms
41,208 KB
testcase_09 AC 1,049 ms
41,976 KB
testcase_10 AC 1,395 ms
44,416 KB
testcase_11 AC 304 ms
36,908 KB
testcase_12 AC 932 ms
62,436 KB
testcase_13 AC 115 ms
36,348 KB
testcase_14 AC 695 ms
43,664 KB
testcase_15 AC 128 ms
35,748 KB
testcase_16 AC 155 ms
35,896 KB
testcase_17 AC 499 ms
40,448 KB
testcase_18 AC 759 ms
42,668 KB
testcase_19 AC 169 ms
36,884 KB
testcase_20 AC 138 ms
36,012 KB
testcase_21 AC 472 ms
39,016 KB
testcase_22 AC 729 ms
44,188 KB
testcase_23 AC 146 ms
37,000 KB
testcase_24 AC 148 ms
36,492 KB
testcase_25 AC 477 ms
40,524 KB
testcase_26 AC 707 ms
42,536 KB
testcase_27 AC 157 ms
36,444 KB
testcase_28 AC 135 ms
36,800 KB
testcase_29 AC 512 ms
40,508 KB
testcase_30 AC 743 ms
44,104 KB
testcase_31 AC 931 ms
61,328 KB
testcase_32 AC 188 ms
36,208 KB
testcase_33 AC 329 ms
37,584 KB
testcase_34 AC 401 ms
37,576 KB
testcase_35 AC 538 ms
39,220 KB
testcase_36 AC 661 ms
40,796 KB
testcase_37 AC 786 ms
40,680 KB
testcase_38 AC 940 ms
42,248 KB
testcase_39 AC 1,031 ms
42,880 KB
testcase_40 AC 1,143 ms
43,004 KB
testcase_41 AC 1,291 ms
44,300 KB
testcase_42 AC 1,425 ms
44,564 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

struct S {
  int min;
  int count;
};

S op(S x, S y) {
  S ret;
  ret.min = std::min(x.min, y.min);
  ret.count = 0;
  if (x.min == ret.min) {
    ret.count += x.count;
  }
  if (y.min == ret.min) {
    ret.count += y.count;
  }
  return ret;
}

S e() { return {inf(), 0}; }

S mapping(int f, S x) {
  x.min += f;
  return x;
}

int composition(int g, int f) { return f + g; }

int id() { return 0; }

void solve() {
  int n;
  scan(n);
  std::vector<std::array<int, 2>> edges(n - 1);
  scan(edges);
  --edges;
  std::vector<bool> exists(n);
  {
    int m;
    scan(m);
    while (m--) {
      int v;
      scan(v);
      --v;
      exists[v] = true;
    }
  }
  std::vector<std::vector<int>> g(n);
  for (const int e : rep(len(edges))) {
    const auto [i, j] = edges[e];
    g[i].emplace_back(j);
    g[j].emplace_back(i);
  }
  std::vector<int> depth(n);
  std::vector<std::vector<int>> lst(n);
  std::vector<int> parent(n, -1);
  fix([&](auto self, int i) -> void {
    lst[depth[i]].push_back(i);
    for (const int j : g[i]) {
      g[j].erase(ranges::find(g[j], i));
      depth[j] = depth[i] + 1;
      parent[j] = i;
      self(j);
    }
  })(0);
  std::vector<int> order;
  order.reserve(n);
  std::vector<int> rank(n);
  for (const auto& v : lst) {
    for (const int i : v) {
      rank[i] = len(order);
      order.push_back(i);
    }
  }
  std::vector<std::vector<int>> events(n);
  for (const int i : rep(n)) {
    if (!exists[i]) {
      continue;
    }
    if (i) {
      events[parent[i]].push_back(i);
      events[parent[i]].push_back(~i);
    }
    events[i].push_back(i);
    events[i].push_back(~i);
    if (len(g[i])) {
      events[g[i][0]].push_back(i);
      events[g[i].back()].push_back(~i);
    }
  }
  atcoder::lazy_segtree<S, op, e, int, mapping, composition, id> seg(std::vector<S>(n, {0, 1}));
  const auto add = [&](int i, int c = 1) {
    if (i) {
      seg.apply(rank[parent[i]], c);
    }
    seg.apply(rank[i], c);
    if (len(g[i])) {
      seg.apply(rank[g[i][0]], rank[g[i].back()] + 1, c);
    }
  };
  for (const int i : rep(n) | views::filter(at(exists, _1))) {
    add(i);
  }
  std::vector<int> ans(n);
  for (const int i : order) {
    for (const int j : events[i] | views::filter(0 <= _1)) {
      add(j, -1);
    }
    const S s = seg.all_prod();
    if (s.min == 0) {
      ans[i] = n - s.count;
    }
    for (const int j : events[i] | views::filter(_1 < 0) | views::transform(~_1)) {
      add(j);
    }
  }
  for (const int e : ans) {
    print(e);
  }
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

#include <atcoder/lazysegtree>

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <std::signed_integral T = int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}

template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}

template <class T>
concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, Tuple auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  for (string_view sep = ""; auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, Tuple auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

}  // namespace std

#define DEF_INC_OR_DEC(op) \
  auto& operator op(Range auto&& r) { \
    for (auto&& e : r) { \
      op e; \
    } \
    return r; \
  } \
  auto& operator op(Tuple auto&& t) { \
    std::apply([](auto&... xs) { (op xs, ...); }, t); \
    return t; \
  }

DEF_INC_OR_DEC(++)
DEF_INC_OR_DEC(--)

#undef DEF_INC_OR_DEC

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

#define FWD(...) static_cast<decltype(__VA_ARGS__)&&>(__VA_ARGS__)

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const { return f_(std::ref(*this), FWD(xs)...); }

 private:
  F f_;
};

template <class T>
concept LambdaExpr = std::is_placeholder_v<std::remove_cvref_t<T>> != 0 ||
                     std::is_bind_expression_v<std::remove_cvref_t<T>>;

auto operator++(LambdaExpr auto&& x, int) {
  return std::bind([](auto&& x) -> decltype(auto) { return FWD(x)++; }, FWD(x));
}

auto operator--(LambdaExpr auto&& x, int) {
  return std::bind([](auto&& x) -> decltype(auto) { return FWD(x)--; }, FWD(x));
}

#define DEF_UNARY_OP(op) \
  auto operator op(LambdaExpr auto&& x) { \
    return std::bind([](auto&& x) -> decltype(auto) { return op FWD(x); }, FWD(x)); \
  }

DEF_UNARY_OP(++)
DEF_UNARY_OP(--)
DEF_UNARY_OP(+)
DEF_UNARY_OP(-)
DEF_UNARY_OP(~)
DEF_UNARY_OP(!)
DEF_UNARY_OP(*)
DEF_UNARY_OP(&)

#undef DEF_UNARY_OP

#define DEF_BINARY_OP(op) \
  template <class T1, class T2> \
    requires LambdaExpr<T1> || LambdaExpr<T2> \
  auto operator op(T1&& x, T2&& y) { \
    return std::bind([](auto&& x, auto&& y) -> decltype(auto) { return FWD(x) op FWD(y); }, \
                     FWD(x), FWD(y)); \
  }

DEF_BINARY_OP(+=)
DEF_BINARY_OP(-=)
DEF_BINARY_OP(*=)
DEF_BINARY_OP(/=)
DEF_BINARY_OP(%=)
DEF_BINARY_OP(^=)
DEF_BINARY_OP(&=)
DEF_BINARY_OP(|=)
DEF_BINARY_OP(<<=)
DEF_BINARY_OP(>>=)
DEF_BINARY_OP(+)
DEF_BINARY_OP(-)
DEF_BINARY_OP(*)
DEF_BINARY_OP(/)
DEF_BINARY_OP(%)
DEF_BINARY_OP(^)
DEF_BINARY_OP(&)
DEF_BINARY_OP(|)
DEF_BINARY_OP(<<)
DEF_BINARY_OP(>>)
DEF_BINARY_OP(==)
DEF_BINARY_OP(!=)
DEF_BINARY_OP(<)
DEF_BINARY_OP(>)
DEF_BINARY_OP(<=)
DEF_BINARY_OP(>=)
DEF_BINARY_OP(&&)
DEF_BINARY_OP(||)

#undef DEF_BINARY_OP

template <class T1, class T2>
  requires LambdaExpr<T1> || LambdaExpr<T2>
auto at(T1&& x, T2&& y) {
  return std::bind([](auto&& x, auto&& y) -> decltype(auto) { return FWD(x)[FWD(y)]; }, FWD(x),
                   FWD(y));
}

template <int I>
auto get(LambdaExpr auto&& x) {
  return std::bind([](auto&& x) -> decltype(auto) { return std::get<I>(FWD(x)); }, FWD(x));
}

inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }

using namespace std::literals;
using namespace std::placeholders;

namespace ranges = std::ranges;
namespace views = std::views;

using i64 = std::int64_t;

#define len(...) static_cast<int>(ranges::size(__VA_ARGS__))

#endif  // __INCLUDE_LEVEL__
0