| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 384902 | AdiZer0 | Deblo (COCI18_deblo) | C++17 | 143 ms | 58220 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pb push_back
#define whole(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = (int)1e5 + 7;
const int INF = (int)1e9 + 7;
const ll linf = (ll)1e18 + 1;
ll c[N], ans[27], dp[N][27][2];
vector<ll> g[N]; 
  
void dfs(int v, int par = 1) { 
    for (int bit = 0; bit < 26; ++bit) { 
        if ((c[v] >> bit) & 1) { 
            ++ans[bit];
            dp[v][bit][1] = 1;
        } else dp[v][bit][0] = 1;
    }
    for (int to : g[v]) { 
        if (par == to) continue;
        dfs(to, v);
        for (int bit = 0; bit < 26; ++bit) { 
            ans[bit] += (dp[v][bit][1] * 1ll * dp[to][bit][0]);
            ans[bit] += (dp[v][bit][0] * 1ll * dp[to][bit][1]);
            if ((c[v] >> bit) & 1) {
                dp[v][bit][1] += dp[to][bit][0];
                dp[v][bit][0] += dp[to][bit][1];
            } else { 
                dp[v][bit][1] += dp[to][bit][1];
                dp[v][bit][0] += dp[to][bit][0];
            }
        }
    }
}
int main() {
    ll n; scanf ("%lld", &n);
    for (int i = 1; i <= n; ++i) scanf ("%lld", c + i);
    for (int i = 1; i < n; ++i) { 
        ll u, v; scanf ("%lld %lld", &u, &v);
        g[u].pb(v), g[v].pb(u);
    }
    dfs(1);
    ll res = 0;
    for (int i = 0; i < 26; ++i) res += (ans[i] * 1ll * (1ll << i));
    printf ("%lld\n", res);
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
