結果
問題 | No.2377 SUM AND XOR on Tree |
ユーザー |
![]() |
提出日時 | 2023-07-07 23:32:32 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 475 ms / 4,000 ms |
コード長 | 7,539 bytes |
コンパイル時間 | 2,660 ms |
コンパイル使用メモリ | 225,436 KB |
最終ジャッジ日時 | 2025-02-15 08:39:13 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 33 |
ソースコード
#ifdef LOCAL//#define _GLIBCXX_DEBUG#else#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")#endif#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef unsigned long long ull;typedef long double ld;typedef pair<ll, ll> P;typedef pair<int, int> Pi;typedef vector<ll> Vec;typedef vector<int> Vi;typedef vector<string> Vs;typedef vector<char> Vc;typedef vector<P> VP;typedef vector<VP> VVP;typedef vector<Vec> VV;typedef vector<Vi> VVi;typedef vector<Vc> VVc;typedef vector<VV> VVV;typedef vector<VVV> VVVV;#define MAKEVV(variable, a, ...) VV variable(a, Vec(__VA_ARGS__))#define MAKEVVc(variable, a, ...) VVc variable(a,Vc(__VA_ARGS__))#define MAKEVVV(variable, a, b, ...) VVV variable(a, VV(b, Vec(__VA_ARGS__)))#define MAKEVVVV(variable, a, b, c, ...) VVVV variable(a, VVV(b, (VV(c, Vec(__VA_ARGS__)))))#define endl '\n'#define REP(i, a, b) for(ll i=(a); i<(b); i++)#define PER(i, a, b) for(ll i=(a); i>=(b); i--)#define rep(i, n) REP(i, 0, n)#define per(i, n) PER(i, n, 0)const ll INF = 4'000'000'000'000'000'010LL;const ll MOD=998244353;#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;#define YES(n) cout << ((n) ? "YES" : "NO") << endl;#define ALL(v) v.begin(), v.end()#define rALL(v) v.rbegin(), v.rend()#define pb(x) push_back(x)#define mp(a, b) make_pair(a,b)#define Each(a,b) for(auto &a :b)#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)#define SUM(a) accumulate(ALL(a),0LL)#define outminusone(a) cout<< ( a==INF ? -1 : a ) <<endl#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())#define fi first#define se secondtemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }template<class T>auto lb(vector<T> &X, T x){return lower_bound(ALL(X),x) - X.begin();}template<class T>auto ub(vector<T> &X, T x){return upper_bound(ALL(X),x) - X.begin();}ll popcnt(ll x){return __builtin_popcount(x);}ll topbit(ll t){return t==0?-1:63-__builtin_clzll(t);}ll floor(ll y,ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return (y-x+1)/x;}return y/x;};ll ceil(ll y, ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return y/x;}return (y+x-1)/x;};template<typename T1, typename T2>istream &operator>>(istream &i, pair<T1, T2> &p) { return i>>p.first>>p.second; }template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}template<typename T1, typename T2>ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }template<class T>ostream &operator<<(ostream &os, const vector<T> &v) {bool f = false;for(const auto &d: v) {if(f) os<<" ";f = true;os<<d;}return os;}template <class T> ostream& operator<<(ostream& os, const set<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";}template <class T> ostream& operator<<(ostream& os, const multiset<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os<< d;}return os << "}";}template<class T, class U>ostream &operator<<(ostream &os, const map<T, U> &s) {bool f = false;os<<endl;for(auto p: s) {if(f) os<<endl;f = true;os<<p.first<<": "<<p.second;}return os<<endl;}void out() { cout << endl; }template <class Head, class... Tail> void out(const Head &head, const Tail &...tail) {cout << head;if(sizeof...(tail)) cout << ' ';out(tail...);}#ifdef LOCALtemplate<typename T>ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {int len=vv.size();for(int i=0; i<len; ++i) {if(i==0)s<<endl;s<<i<<":"<<vv[i];if(i!=len-1)s<<endl;}return s;}struct PrettyOS {ostream& os;bool first;template <class T> auto operator<<(T&& x) {if (!first) os << ", ";first = false;os << x;return *this;}};template <class... T> void dbg0(T&&... t) {(PrettyOS{cerr, true} << ... << t);}#define dbg(...)do {cerr << #__VA_ARGS__ << ": ";dbg0(__VA_ARGS__);cerr << endl;} while (false);#else#define dbg(...)#endif//mintstruct mint {ll x; // typedef long long ll;mint(ll x=0):x((x%MOD+MOD)%MOD){}mint operator-() const { return mint(-x);}mint& operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint& operator-=(const mint a) {if ((x += MOD-a.x) >= MOD) x -= MOD;return *this;}mint& operator*=(const mint a) { (x *= a.x) %= MOD; return *this;}bool operator==(const mint a) const { return x == a.x;}mint operator+(const mint a) const { return mint(*this) += a;}mint operator-(const mint a) const { return mint(*this) -= a;}mint operator*(const mint a) const { return mint(*this) *= a;}mint pow(ll n) const {mint x = *this, r = 1;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}// for prime MODmint inv() const { return pow(MOD-2);}mint& operator/=(const mint& a) { return *this *= a.inv();}mint operator/(const mint a) const { return mint(*this) /= a;}};istream& operator>>(istream& is, const mint& a) { return is >> a.x;}ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}typedef vector<mint> Vmint;typedef vector<Vmint> VVmint;typedef vector<VVmint> VVVmint;typedef vector<VVVmint> VVVVmint;#define MAKEVVmint(variable, a, ...) VVmint variable(a,Vmint(__VA_ARGS__))#define MAKEVVVmint(variable, a, b, ...) VVVmint variable(a, VVmint(b, Vmint(__VA_ARGS__)))#define MAKEVVVVmint(variable, a, b, c, ...) VVVVmint variable(a, VVVmint(b, (VVmint(c, Vmint(__VA_ARGS__)))))struct combination {vector<mint> fact, ifact;combination(ll n):fact(n+1),ifact(n+1) {assert(n < MOD);fact[0] = 1;for (ll i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;ifact[n] = fact[n].inv();for (ll i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;}mint nCr(ll n, ll k){if (k < 0 || k > n) return 0;return fact[n]*ifact[k]*ifact[n-k];}mint operator()(ll n, ll k) {return nCr(n,k);}mint nHr(ll n, ll r){//n個の要素をr個の区画分ける、0個の区画があってもよい。return nCr(n+r-1,r-1);}};int solve(){ll n;cin>>n;VV g(n);rep(i,n-1){ll u,v;cin>>u>>v;u--;v--;g[u].pb(v);g[v].pb(u);}mint ans = 0;Vec a(n);cin>>a;rep(bit,30){auto hasbit = [](ll x, ll i )->bool{return (1LL<<i) & x;};//xにi番目のbitが立っているかauto dfs = [&](auto &&self, ll v, ll p)->Vmint{Vmint dp(2);dp[hasbit(a[v],bit)]+=1;Each(nx, g[v]){if(nx == p)continue;Vmint dpv = self(self,nx,v);Vmint pre(2);swap(dp,pre);//切るdp[0] += pre[0] * dpv[1];dp[1] += pre[1] * dpv[1];//繋ぐrep(j,2){rep(k,2){dp[j^k] += pre[j] * dpv[k];}}}return dp;};ans += mint(1<<bit) * dfs(dfs,0,-1)[1];}out(ans);return 0;}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);cout<<std::setprecision(20);// ll T;// cin>>T;// while(T--)solve();}