# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680292 | mjhmjh1104 | Wells (CEOI21_wells) | C++17 | 20 ms | 35540 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 <vector>
#include <utility>
#include <algorithm>
using namespace std;
int n, k, K, b[1500006];
vector<int> adj[1500006];
bool dfs(int x, int dist, int prev = -1) {
if (b[x]) {
if (dist != -1 && dist % K) return false;
dist = 0;
}
int ndist = dist;
if (ndist != -1) ndist++;
for (auto &i: adj[x]) if (i != prev && !dfs(i, ndist, x)) return false;
return true;
}
int main() {
scanf("%d%d", &n, &k);
K = k;
if (k % 2 == 0) K /= 2;
for (int i = 0; i < n - 1; i++) {
int u, v;
scanf("%d%d", &u, &v);
u--, v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
for (int i = 0; i < n; i++) if ((int)adj[i].size() > 2) b[i] = 1;
if (!dfs(0, -1)) puts("NO\n0");
else puts("YES\n1");
}
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... |