# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093133 | juicy | The Xana coup (BOI21_xanadu) | C++17 | 46 ms | 17176 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;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
const int N = 1e5 + 5, inf = 1e9;
int n;
int dp[N][2][2], f[2][2], a[N];
vector<int> g[N];
void dfs(int u, int p) {
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 2; ++j) {
f[i][j] = dp[u][i][j] = inf;
}
}
dp[u][a[u]][0] = 0;
dp[u][a[u] ^ 1][1] = 1;
for (int v : g[u]) {
if (v ^ p) {
dfs(v, u);
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 2; ++j) {
f[j ^ i][0] = min(f[j ^ i][0], dp[u][j][0] + dp[v][0][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... |