# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156081 | IOrtroiii | 전압 (JOI14_voltage) | C++14 | 173 ms | 21080 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;
const int N = 100100;
int n, m;
vector<int> g[N];
vector<int> tr[N];
int cnt[N];
int ds[N];
int bad;
void dfs1(int v, int p) {
for (int u : g[v]) {
if (u == p) p = 0;
else if (ds[u] && ds[u] < ds[v]) {
// printf("back edge %d -> %d\n", v, u);
if ((ds[v] & 1) == (ds[u] & 1)) {
++bad;
cnt[v]++;
cnt[u]--;
} else {
cnt[v]--;
cnt[u]++;
}
} else if (!ds[u]) {
ds[u] = ds[v] + 1;
tr[v].emplace_back(u);
// printf("tree edge %d -> %d\n", v, u);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |