# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
170923 | MatesV13 | Deblo (COCI18_deblo) | C++11 | 16 ms | 1528 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;
long long n, val[1005], a, b, ans;
vector<int> c[1005];
bool v[1005][1005];
void dfs(int poc, int kraj, long long sol){
sol^=val[kraj]; ans+=sol; v[poc][kraj]=1;
for (int i=0; i<c[kraj].size(); i++){
if (!v[poc][c[kraj][i]])
dfs(poc, c[kraj][i], sol);
}
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n; for (int i=1; i<=n; i++) cin >> val[i];
for (int i=1; i<n; i++){
cin >> a >> b;
c[a].push_back(b);
c[b].push_back(a);
}
for (int i=1; i<=n; i++){dfs(i, i, 0LL); ans+=val[i];}
cout << ans/2;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |