# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
778647 | vjudge1 | Deblo (COCI18_deblo) | C++17 | 1086 ms | 11024 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.
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<iostream>
#include <vector>
#include <bitset>
using namespace std;
#define lalala ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl "\n"
#define ll long long
#define pb push_back
#define N 100001
int arr[N];
vector<int> adj[N];
bitset<100001>isaret;
ll int dfs(int x,int once,int prevgel){
ll int topla=0;
if(isaret[x]==0)topla=prevgel^arr[x];
for(auto u:adj[x]){
if(u==once) continue;
topla+=dfs(u,x,prevgel^arr[x]);
}
return topla;
}
vector<int> yol;
void uff(int x,int once){
for(auto u:adj[x]){
if(u!=once)uff(u,x);
}
yol.pb(x);
}
int main(){
lalala;
int n;cin>>n;
for(int i=1;i<=n;i++)cin>>arr[i];
for(int i=0;i<n-1;i++){
int a,b;cin>>a>>b;
adj[a].pb(b);
adj[b].pb(a);
}
uff(1,0);
ll int cev=0;
for(int i=yol.size()-1;i>-1;i--){
cev+=dfs(yol[i],-1,0);
isaret[yol[i]]=1;
}
cout<<cev<<"\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |