# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
999139 | 2024-06-15T07:19:58 Z | crafticat | Newspapers (CEOI21_newspapers) | C++17 | 1 ms | 344 KB |
#include <bits/stdc++.h> using namespace std; vector<vector<int>> g; int MAX_DEP = 0; int calcMaxDepth(int x, int p, int depth) { MAX_DEP = max(depth,MAX_DEP); for (auto child : g[x]) { if (child == p) continue; calcMaxDepth(child,x,depth + 1); } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; g.resize(n + 1); for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; g[a].push_back(b); g[b].push_back(a); } bool binary = true; int root = 0; for (int i = 1; i <= n; ++i) { if (g[i].size() > 2) root = i; } if (root == 0 && m == n - 1) { cout << "YES\n"; cout << "1\n"; cout << "1\n"; } if (MAX_DEP > 2 || m != n - 1) { cout << "NO\n"; } else { cout << "YES\n"; cout << "1\n"; cout << "1\n"; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Extra information in the output file |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Extra information in the output file |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Extra information in the output file |
2 | Halted | 0 ms | 0 KB | - |