# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291665 | spdskatr | Village (BOI20_village) | C++14 | 196 ms | 34248 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 <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
using namespace std;
int N, dp[100005][2], ans[100005], conn[100005], seen[100005]; // 0 = isolated, 1 = attached
vector<int> graph[100005], g2[100005];
vector<int> broken[100005], unbroken[100005];
vector<int> order;
int sz[100005], ans2[100005];
long long tot;
vector<int> nds;
void dfs(int x, int p) {
dp[x][1] = 0;
int mindiff = 2069696969;
for (int v : graph[x]) {
if (v != p) {
dfs(v, x);
int df = max(0, dp[v][0] + 1 - dp[v][1]);
if (mindiff > df) {
mindiff = df;
conn[x] = v;
}
if (dp[v][0] + 1 > dp[v][1]) {
broken[x].push_back(v);
dp[x][1] += dp[v][0] + 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |