# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
527869 | aris12345678 | Deblo (COCI18_deblo) | C++14 | 1096 ms | 7064 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;
typedef long long ll;
const int mxN = 1e5+5;
vector<int> adj[mxN];
int a[mxN];
ll res[mxN];
void bfs(int s) {
queue<int> q;
res[s] = a[s];
q.push(s);
while(!q.empty()) {
int u = q.front();
q.pop();
for(auto &v : adj[u]) {
if(res[v] == -1) {
res[v] = 1LL*res[u]^a[v];
q.push(v);
}
}
}
}
int main() {
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++)
scanf("%d", &a[i]);
for(int i = 1; i < n; i++) {
int u, v;
scanf("%d %d", &u, &v);
adj[u-1].push_back(v-1);
adj[v-1].push_back(u-1);
}
ll ans = 0;
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++)
res[j] = -1;
bfs(i);
for(int j = i; j < n; j++)
ans += res[j];
}
printf("%lld\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |