結果
問題 | No.2377 SUM AND XOR on Tree |
ユーザー |
👑 ![]() |
提出日時 | 2023-07-09 01:09:13 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 415 ms / 4,000 ms |
コード長 | 3,192 bytes |
コンパイル時間 | 2,167 ms |
コンパイル使用メモリ | 212,112 KB |
最終ジャッジ日時 | 2025-02-15 09:14:18 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 33 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (int i=(int)a;i<(int)b;i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}std::vector<std::vector<int>> tree_in(int N){std::vector<std::vector<int>> G(N);for(int i=0;i<N-1;i++){int a;int b;cin>>a>>b;a--,b--;G[a].push_back(b);G[b].push_back(a);}return G;}std::tuple<std::vector<int>,std::vector<int>,std::vector<int>> tree_order_pare_depth(std::vector<std::vector<int>> &G,int root){int n=G.size();std::vector<int> order={root},pare(n,-1),depth(n);pare[root]=-2;for(int i=0;i<n;i++){int a=order[i];for(auto x:G[a]){if(pare[x]==-1){pare[x]=a;depth[x]=depth[a]+1;order.push_back(x);}}}return {order,pare,depth};}std::vector<int> tree_diameter_path(std::vector<std::vector<int>> &G){int n=G.size();auto r=(std::get<0>(tree_order_pare_depth(G,0))).at(n-1);std::vector<int> order,pare,depth,ans;tie(order,pare,depth)=tree_order_pare_depth(G,r);int ind=order[n-1];while(ind!=-2){ans.push_back(ind);ind=pare[ind];}return ans;}void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,0,t) solve();}void solve(){int N;cin>>N;auto G=tree_in(N);vector<ll> A(N);rep(i,0,N) cin>>A[i];ll ans=0;auto[order,pare,depth]=tree_order_pare_depth(G,0);rep(d,0,30){vector dp(2,vector<ll>(N));rep(i,0,N){int a=order[N-i-1];if(A[a]&(1ll<<d)) dp[1][a]=1;else dp[0][a]=1;for(auto x:G[a]){if(pare[x]==a){vector<ll> q(2);rep(j,0,2) rep(k,0,2) q[j^k]+=(dp[j][x]*dp[k][a])%mod;rep(j,0,2) dp[j][a]=q[j];}}dp[0][a]=(dp[0][a]+dp[1][a])%mod;}ans+=((1ll<<d)*dp[1][0])%mod;}cout<<(ans%mod)<<"\n";}