#386757 (C++17) No.899 γatheree

• 問題: No.899 γatheree
• ユーザー: ngtkana
• 提出日時: 2019-10-04 22:18:53
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: TLE
• 実行時間: -
• コード長: 3,491 bytes
• コンパイル時間: 2,213 ms
• コンパイル使用メモリ: 210,928 KB
• 実行使用メモリ: 16,928 KB
• 最終ジャッジ日時: 2024-10-03 07:56:33
• 合計ジャッジ時間: 10,760 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 10,624 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	254 ms; 9,984 KB
testcase_07	AC	257 ms; 9,984 KB
testcase_08	AC	247 ms; 9,984 KB
testcase_09	AC	243 ms; 9,856 KB
testcase_10	AC	248 ms; 9,856 KB
testcase_11	AC	245 ms; 9,856 KB
testcase_12	AC	247 ms; 9,856 KB
testcase_13	AC	247 ms; 9,984 KB
testcase_14	AC	242 ms; 9,856 KB
testcase_15	AC	243 ms; 9,856 KB
testcase_16	AC	240 ms; 9,856 KB
testcase_17	AC	246 ms; 9,856 KB
testcase_18	AC	244 ms; 9,856 KB
testcase_19	AC	241 ms; 9,856 KB
testcase_20	AC	235 ms; 10,112 KB
testcase_21	TLE	-
testcase_22	--	-
testcase_23	--	-

ソースコード

#include <bits/stdc++.h>
#define loop(n) for (int ngtkana_is_genius = 0; ngtkana_is_genius < int(n); ngtkana_is_genius++)
#define rep(i, begin, end) for(int i = int(begin); i < int(end); i++)
#define all(v) v.begin(), v.end()
#define rand(l, r) std::uniform_int_distribution<>(l, r)(mt)
using lint = long long;
auto cmn = [](auto& a, auto b){if (a > b) {a = b; return true;} return false;};
auto cmx = [](auto& a, auto b){if (a < b) {a = b; return true;} return false;};
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail){
  std::cerr << " " << head;
  debug_impl(tail...);
}
#ifndef STOPIT
#define debug(...)\
  std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\
  debug_impl(__VA_ARGS__);\
  std::cerr << std::noboolalpha;
#else
#define debug 0;
#endif

template <typename T>
auto make_vector_impl(size_t sz, T t) {return std::vector<T>(sz, t);}

template <size_t N, typename T, typename U, std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz, U u) {return make_vector_impl(sz, T(u));}

template <size_t N, typename T, std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz) {return std::vector<T>(sz);}

template <size_t N, typename T, typename... Args, std::enable_if_t<N != 1, std::nullptr_t> = nullptr>
auto make_vector(size_t a, Args... args) {return make_vector_impl(a, make_vector<N - 1, T>(args...));}

template <typename T, typename Size_t>
auto& at(T& t, Size_t i) {return t.at(i);}

template <typename T, typename Size_t, typename... Args>
auto& at(T& t, Size_t i, Args... args) {return at(t.at(i), args...);}

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr>
std::istream& operator>> (std::istream& is, Container& v)
  { for (auto & x : v) { is >> x; } return is; }

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr >
std::ostream& operator<< (std::ostream& os, Container const& v) {
 os << "{";
  for (auto it = v.begin(); it != v.end(); it++)
    {os << (it != v.begin() ? "," : "") << *it;}
  return os << "}";
}

template< typename F >
class fixed_point : F {
  public:
    explicit constexpr fixed_point (F&& f) noexcept
      : F(std::forward< F >(f)) {}
    template< typename ... Args >
    constexpr decltype(auto) operator()(Args&& ... args) const
      { return F::operator()(*this, std::forward< Args >(args)...); }
};
template< typename F >
static inline constexpr decltype(auto) fix (F&& f) noexcept
  { return fixed_point< F >{std::forward< F >(f)}; }

int main() {
  std::cin.tie(0); std::cin.sync_with_stdio(false);
  int n; std::cin >> n;
  auto graph = make_vector< 2, int >(n, 0);
  loop(n - 1) {
    int u, v; std::cin >> u >> v;
    graph.at(u).emplace_back(v);
    graph.at(v).emplace_back(u);
  }
  std::vector< lint > a(n); std::cin >> a;
  std::vector< int > ref(n, -1);
  int q; std::cin >> q;
  loop(q) {
    int x; std::cin >> x;

    fix([&](auto dfs, int crr, int prv, int d) -> void {
      a.at(x) += std::exchange(a.at(crr), 0);
      if (d <= 1) {
        for (auto const& nxt : graph.at(crr)) {
          if (nxt == prv) continue;
          dfs(nxt, crr, d + 1);
        }
      }
    })(x, x, 0);

    std::cout << a.at(x) << std::endl;
  }
  return 0;
}