# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680292 | 2023-01-10T13:59:01 Z | mjhmjh1104 | Wells (CEOI21_wells) | C++17 | 20 ms | 35540 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 19 ms | 35412 KB | Output is partially correct |
2 | Incorrect | 20 ms | 35540 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 19 ms | 35412 KB | Output is partially correct |
2 | Incorrect | 20 ms | 35540 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 19 ms | 35412 KB | Output is partially correct |
2 | Incorrect | 20 ms | 35540 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 19 ms | 35412 KB | Output is partially correct |
2 | Incorrect | 20 ms | 35540 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |