| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 701742 | chenyan | Deblo (COCI18_deblo) | C++17 | 148 ms | 56168 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>
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb emplace_back
#define N 200010
vector<int>c[N];
bitset<N>vis;
int a[N],ans,dp[30][2][N];
void dfs(int v){
	vis[v]=1;
	int i;
	ans+=a[v];
	for(i=0;i<25;i++)
		dp[i][(a[v]>>i)&1][v]++;
	for(int u:c[v]){
		if(vis[u])continue;
		dfs(u);
		for(i=0;i<25;i++){
			ans+=(dp[i][0][v]*dp[i][1][u]+dp[i][1][v]*dp[i][0][u])*(1<<i);
			dp[i][0][v]+=dp[i][(a[v]>>i)&1][u];
			dp[i][1][v]+=dp[i][(a[v]>>i)&1^1][u];
		}
	}
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int u,v,n,m,i,j,k;
	cin>>n;
	for(i=1;i<=n;i++)cin>>a[i];
	for(i=0;i<n-1;i++){
		cin>>u>>v;
		c[u].pb(v);
		c[v].pb(u);
	}
	dfs(1);
	cout<<ans<<'\n';
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
