# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1165819 | fryingduc | The Xana coup (BOI21_xanadu) | C++20 | 51 ms | 15432 KiB |
#include "bits/stdc++.h"
using namespace std;
#ifdef duc_debug
#include "bits/debug.h"
#else
#define debug(...)
#endif
const int maxn = 1e5 + 5;
int n, a[maxn];
int f[maxn][2][2];
vector<int> g[maxn];
int ff[2][2];
void dfs(int u, int prev) {
f[u][a[u]][0] = 0;
f[u][a[u] ^ 1][1] = 1;
for (auto v : g[u]) {
if (v == prev) continue;
dfs(v, u);
memset(ff, 0x3f, sizeof(ff));
for (int i = 0; i < 2; ++i) {
ff[i][0] = min(ff[i][0], f[u][i ^ 1][0] + f[v][0][1]);
ff[i][0] = min(ff[i][0], f[u][i][0] + f[v][0][0]);
ff[i][1] = min(ff[i][1], f[u][i][1] + f[v][1][0]);
ff[i][1] = min(ff[i][1], f[u][i ^ 1][1] + f[v][1][1]);
}
for (int i = 0; i < 2; ++i) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |