結果

問題 No.1221 木 *= 3
ユーザー maimai
提出日時 2020-09-04 22:48:48
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 50 ms / 2,000 ms
コード長 6,393 bytes
コンパイル時間 2,928 ms
コンパイル使用メモリ 222,648 KB
実行使用メモリ 19,756 KB
最終ジャッジ日時 2023-08-17 20:27:49
合計ジャッジ時間 4,953 ms
ジャッジサーバーID
(参考情報)
judge15 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 44 ms
19,756 KB
testcase_08 AC 46 ms
19,428 KB
testcase_09 AC 44 ms
19,696 KB
testcase_10 AC 50 ms
19,312 KB
testcase_11 AC 50 ms
19,368 KB
testcase_12 AC 32 ms
11,748 KB
testcase_13 AC 38 ms
11,828 KB
testcase_14 AC 41 ms
11,632 KB
testcase_15 AC 38 ms
11,812 KB
testcase_16 AC 41 ms
11,828 KB
testcase_17 AC 41 ms
9,272 KB
testcase_18 AC 46 ms
9,376 KB
testcase_19 AC 50 ms
9,440 KB
testcase_20 AC 50 ms
9,316 KB
testcase_21 AC 45 ms
9,276 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

template <typename I>
struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };
template<typename I>
static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {
  o << "[ "; iterate(i,f.b,f.e) o<<*i<<' ';
  return o << ']';
}
template <typename I>
struct MyMatrixFormat{
  const I& p; long long n, m;
  MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}
};
template<typename I>
static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {
  o<<'\n';
  repeat(i,(f.n)) {
    repeat(j,f.m) o<<f.p[i][j]<<' ';
    o<<'\n';
  }
  return o;
}
struct LOG_t { ~LOG_t() { cout << endl; } };
#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")
#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))
#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))
#define FMTV(v) FMTR(v.begin(),v.end())
#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
class MaiScanner {
  FILE* fp_;
  constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }
  inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);

class Graph {
 public:
  int n;
  vector<vector<int>> vertex_to;

  explicit Graph(int n = 1) : n(n), vertex_to(n) {}

  inline int size() const { return n; }
  void resize(int _n) { vertex_to.resize(n = _n); }
  void connect(int from, int to) {
    vertex_to[(int)from].emplace_back(to);
    vertex_to[(int)to].emplace_back(from);
  }
};

//

int N;
int A[100010];
int B[100010];

//

Graph graph;

// <erased, alived>
pair<ll, ll> dfs(int v, int prev =-1) {
  ll erased = A[v];
  vector<pair<ll,ll>> adjs;
  for (auto u : graph.vertex_to[v]) {
    if (u == prev) continue;
    auto p = dfs(u, v);
    erased += max(p.first, p.second - B[u]); // 親を消すので、親への辺の加味はありません
    adjs.push_back(p);
  }
  ll alived;
  {
    sort(all(adjs), [](const pair<ll,ll>& l, const pair<ll,ll>& r){ return l.second-l.first > r.second-r.first;});
    ll score = B[v];  // vを残したら親にB[v]点が加算される(親への辺を加味しないので)
    for (auto p : adjs) score += p.first;
    ll best = score;
    for (auto p : adjs) {
      // LOG << p;
      score += -p.first + p.second + B[v];
      // LOG << score;
      chmax(best, score);
    }
    alived = best;
  }
  // LOG << v << pair<int,int>{erased, alived};
  return {erased, alived};
}


int main() {
  
  scanner >> N;
  scanner.in(A, A+N);
  scanner.in(B, B+N);
  
  graph.resize(N);
  
  repeat(i, N-1) {
    int u, v;
    scanner >> u >> v;
    --u; --v;
    graph.connect(u, v);
  }
  
  auto best = dfs(0);
  
  cout << max(best.first, best.second - B[0]) << endl;
  
  return 0;
}
0