Submission #1229524

#TimeUsernameProblemLanguageResultExecution timeMemory
1229524raspyNewspapers (CEOI21_newspapers)C++20
50 / 100
112 ms4704 KiB
#include <bits/stdc++.h> #define vi vector<int> // #define int long long #define pb push_back #define all(x) (x).begin(), (x).end() using namespace std; const int N = 1e3+10; vi graf[N]; int dfs(int u, int p=-1) { int mx = 0; for (int v:graf[u]) if (v!=p) mx=max(mx, dfs(v, u)+1); return mx; } signed main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; graf[u].pb(v);graf[v].pb(u); } if (m!=n-1) { cout << "NO\n"; return 0; } for (int i = 1; i <= n; i++) { int cnt = 0; for (int v:graf[i]) if (dfs(v, i)>=2) cnt++; if (cnt>2) { cout << "NO\n"; return 0; } } cout << "YES\n1\n1\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...