# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384867 | AdiZer0 | Deblo (COCI18_deblo) | C++17 | 1094 ms | 8556 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>
#define pb push_back
#define whole(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = (int)1e5 + 7;
const int INF = (int)1e9 + 7;
const ll linf = (ll)1e18 + 1;
int c[N], d[N];
vector<int> g[N];
void bfs(int s) {
queue<int> q;
d[s] = c[s];
q.push(s);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int to : g[v]) {
if (d[to] == -1) {
d[to] = (d[v] ^ c[to]);
q.push(to);
}
}
}
}
int main() {
int n; scanf ("%d", &n);
for (int i = 1; i <= n; ++i) scanf ("%d", c + i);
for (int i = 1; i < n; ++i) {
int u, v; scanf ("%d %d", &u, &v);
g[u].pb(v), g[v].pb(u);
}
ll ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) d[j] = -1;
bfs(i);
for (int j = i; j <= n; ++j) ans += d[j];
}
printf ("%lld\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |