結果
問題 | No.1221 木 *= 3 |
ユーザー |
![]() |
提出日時 | 2023-10-09 13:25:58 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 82 ms / 2,000 ms |
コード長 | 3,263 bytes |
コンパイル時間 | 1,155 ms |
コンパイル使用メモリ | 124,500 KB |
最終ジャッジ日時 | 2025-02-17 06:26:25 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 18 |
ソースコード
#include<iostream>#include<vector>#include<algorithm>#include<cstring>#include<cassert>#include<cmath>#include<ctime>#include<iomanip>#include<numeric>#include<stack>#include<queue>#include<map>#include<unordered_map>#include<set>#include<unordered_set>#include<bitset>#include<random>using namespace std;template<int m> struct modint{private:unsigned int value;static constexpr int mod() {return m;}public:constexpr modint(const long long x = 0) noexcept{long long y = x;if(y < 0 || y >= mod()){y %= mod();if(y < 0) y += mod();}value = (unsigned int)y;}constexpr unsigned int val() noexcept {return value;}constexpr modint &operator+=(const modint &other) noexcept{value += other.value;if(value >= mod()) value -= mod();return *this;}constexpr modint &operator-=(const modint &other) noexcept{unsigned int x = value;if(x < other.value) x += mod();x -= other.value;value = x;return *this;}constexpr modint &operator*=(const modint &other) noexcept{unsigned long long x = value;x *= other.value;value = (unsigned int) (x % mod());return *this;}constexpr modint &operator/=(const modint &other) noexcept{return *this *= other.inverse();}constexpr modint inverse() const noexcept{assert(value);long long a = value,b = mod(),x = 1,y = 0;while(b){long long q = a/b;a -= q*b; swap(a,b);x -= q*y; swap(x,y);}return modint(x);}constexpr modint power(long long N) const noexcept{assert(N >= 0);modint p = *this,ret = 1;while(N){if(N & 1) ret *= p;p *= p;N >>= 1;}return ret;}constexpr modint operator+() {return *this;}constexpr modint operator-() {return modint() - *this;}constexpr modint &operator++(int) noexcept {return *this += 1;}constexpr modint &operator--(int) noexcept {return *this -= 1;}friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}};//using mint = modint<998244353>;using mint = modint<1000000007>;int N,A[1 << 17],B[1 << 17];vector<int> G[1 << 17];long long dp[1 << 17][2];void dfs(int u,int p){long long ep[2][2];int cur = 0;ep[cur][0] = A[u],ep[cur][1] = 0;for(int v:G[u]) if(v != p){dfs(v,u);int nxt = 1-cur;ep[nxt][0] = ep[nxt][1] = -(long long)1e18;ep[nxt][0] = max(dp[v][0],dp[v][1]) + ep[cur][0];ep[nxt][1] = max(dp[v][0],dp[v][1] + B[u]+B[v]) + ep[cur][1];cur = nxt;}dp[u][0] = ep[cur][0];dp[u][1] = ep[cur][1];}void solve(){cin >> N;for(int i = 0;i < N;i++) cin >> A[i];for(int i = 0;i < N;i++) cin >> B[i];for(int i = 1;i < N;i++){int u,v;cin >> u >> v;u--; v--;G[u].push_back(v);G[v].push_back(u);}dfs(0,-1);cout << max(dp[0][0],dp[0][1]) << endl;}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int tt = 1;//cin >> tt;while(tt--) solve();}