# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
894454 | d4xn | The Xana coup (BOI21_xanadu) | C++17 | 83 ms | 49784 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;
#define int long long
const int N = 1e5+5, inf = INT_MAX;
int n, dp[2][2][N]; // me he pulsado a mi mismo?, soy 0 o 1?, nodo
vector<int> adj[N];
bitset<N> bt;
void dfs(int x, int p) {
vector<vector<int>> sum(2, vector<int>(2, 0));
vector<int> mnSum(2, 0);
vector<int> cnt(2, 0);
vector<int> mnDif(2, inf);
for (int& y : adj[x]) {
if (y == p) continue;
dfs(y, x);
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
sum[i][j] += dp[i][j][y];
}
}
for (int i = 0; i < 2; i++) {
if (dp[0][i][y] < dp[1][i][y]) {
mnSum[i] += dp[0][i][y];
# | 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... |