| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 96631 | fadi57 | Deblo (COCI18_deblo) | C++14 | 156 ms | 20728 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 clr(i, j)     memset(i, j, sizeof(i))
#define pb            push_back
 
typedef long long     ll;
 
//-*-*-*-*-*-*-*-*-
  vector<ll>c[99999];ll sum=0;
  vector<ll>v[99999];ll w[999999];
void dfs(ll i,ll par){
 v[i].push_back(w[i]);
   
    for(auto &o:c[i]){
if(o==par){continue;}
dfs(o,i);
    }
    if(par==0){sum+=w[i]; return;}
for(auto &o:v[i]){
 v[par].push_back(o^w[par]);sum+=(o^w[par]);
    } 
   
    
}
 map<ll,ll>l;ll ans=-999;
 
int main()
{
   ll n;cin>>n;
for(int i=1;i<=n;i++){
 cin>>w[i];
   
}
 for(int i=0;i<n-1;i++){
    ll x,y;
 cin>>x>>y; c[x].push_back(y); c[y].push_back(x);
    
 }
 dfs(1,0);
 for(auto &o:v[1]){
 //cout<<o;
    }cout<<sum;
 
   }
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
