結果
問題 | No.1221 木 *= 3 |
ユーザー | Enjapma_kyopro |
提出日時 | 2020-09-04 22:01:12 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 71 ms / 2,000 ms |
コード長 | 3,643 bytes |
コンパイル時間 | 1,442 ms |
コンパイル使用メモリ | 171,140 KB |
実行使用メモリ | 18,544 KB |
最終ジャッジ日時 | 2023-08-17 15:37:49 |
合計ジャッジ時間 | 3,800 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
7,388 KB |
testcase_01 | AC | 3 ms
7,412 KB |
testcase_02 | AC | 3 ms
7,384 KB |
testcase_03 | AC | 4 ms
7,484 KB |
testcase_04 | AC | 4 ms
7,496 KB |
testcase_05 | AC | 3 ms
7,424 KB |
testcase_06 | AC | 3 ms
7,476 KB |
testcase_07 | AC | 71 ms
18,528 KB |
testcase_08 | AC | 70 ms
18,288 KB |
testcase_09 | AC | 69 ms
18,544 KB |
testcase_10 | AC | 69 ms
18,348 KB |
testcase_11 | AC | 69 ms
18,504 KB |
testcase_12 | AC | 63 ms
12,496 KB |
testcase_13 | AC | 59 ms
12,500 KB |
testcase_14 | AC | 63 ms
12,400 KB |
testcase_15 | AC | 63 ms
12,452 KB |
testcase_16 | AC | 65 ms
12,508 KB |
testcase_17 | AC | 71 ms
12,552 KB |
testcase_18 | AC | 66 ms
12,604 KB |
testcase_19 | AC | 70 ms
12,560 KB |
testcase_20 | AC | 70 ms
12,596 KB |
testcase_21 | AC | 71 ms
12,492 KB |
ソースコード
#include <bits/stdc++.h> #include <unistd.h> #include <sys/time.h> #include <stdlib.h> using namespace std; typedef long long ll; typedef pair<ll, ll> P; typedef pair<P, ll> T; typedef pair<long double , ll> Ps; typedef pair<ll, bool> Pb; const ll INF = 1e18; const ll fact_table = 3200008; long double Pi = 3.1415926535897932384626; priority_queue <ll> pql; priority_queue <P> pqp; priority_queue <P> bag; //big priority queue priority_queue <ll, vector<ll>, greater<ll> > pqls; priority_queue <P, vector<P>, greater<P> > pqps; //small priority queue //top pop ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1}; ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1}; //↓,→,↑,← #define endl "\n" #ifdef ENJAPMA #undef endl #endif #define p(x) cout<<x<<endl; #define el cout<<endl; #define pe(x) cout<<x<<" "; #define ps(x) cout<<fixed<<setprecision(25)<<x<<endl; #define pu(x) cout<<(x); #define pb push_back #define lb lower_bound #define ub upper_bound #define CLEAR(a) a = decltype(a)(); #define pc(x) cout << x << ","; #define rep(i, n) for (ll i = 0; i < (n); i ++) // const ll mod = 998244353ll; const ll mod = 1000000007ll; ll mypow(ll a, ll b, ll mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= mod; b >>= 1;}(x *= a) %= mod; b--;} return x;} void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;} void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;} void line() { p("--------------------"); return;} /* ll fact[fact_table + 5], rfact[fact_table + 5]; void c3_init() { fact[0] = rfact[0] = 1; for (ll i = 1; i <= fact_table; i++) { fact[i] = (fact[i - 1] * i) % mod; } rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod); for (ll i = fact_table; i >= 1; i--) { rfact[i - 1] = rfact[i] * i; rfact[i - 1] %= mod; } return; } ll c3(ll n, ll r) { return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod; } */ struct Timer { int64_t start; const int64_t CYCLES_PER_SEC = 2800000000; Timer() { reset(); } void reset() { start = getCycle(); } inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; } inline int64_t getCycle() { uint32_t low, high; __asm__ volatile ("rdtsc" : "=a" (low), "=d" (high)); return ((int64_t)low) | ((int64_t)high << 32); } }; bool multicase = false; ll n, m, k, w, a, b, c, d, e, h, q, ans, sum, l; typedef vector<ll> vec; typedef vector<vector<ll>> mat; ll x[100005], y[100005]; ll dp[100005][2]; vector<ll> G[100005]; void dfs(ll v, ll p = -1){ ll sum = 0; for(int i=0;i<G[v].size();i++){ ll nv = G[v][i]; if (nv == p) continue; dfs(nv, v); sum += max(dp[nv][0], dp[nv][1]); } // 消す場合 dp[v][0] = sum + x[v-1]; sum = 0; for(int i=0;i<G[v].size();i++){ ll nv = G[v][i]; if (nv == p) continue; sum += max(dp[nv][0], dp[nv][1] + y[nv-1] + y[v-1]); } dp[v][1] = sum; } void solve() { cin >> n; for (int i = 0; i < n; i++) { cin >> x[i]; } for (int i = 0; i < n; i++) { cin >> y[i]; } for (int i = 0; i < n - 1; i++) { cin >> a >> b; G[a].pb(b); G[b].pb(a); } dfs(1); ll ans = max(dp[1][0], dp[1][1]); p(ans); return; } int main() { // init(); ios::sync_with_stdio(false); cin.tie(nullptr); ll q, testcase = 1; if (multicase) { cin >> q; } else { q = 1; } while (q--) { // pu("Case ");pu("#");pu(testcase);pu(": "); solve(); testcase++; } // solve(); return 0; }