Submission #620974

#TimeUsernameProblemLanguageResultExecution timeMemory
620974berrNewspapers (CEOI21_newspapers)C++17
0 / 100
1 ms340 KiB
#include <bits/stdc++.h> using namespace std; #define int long long vector<int> adj[1005], vis(1005); int flag=1; int dfs(int x, int y) { vis[x]=1; int maxk=0, t=0, s=0; for(auto i: adj[x]) { if(i==y) continue; else if(vis[i]==1) { flag=0; } else { int z=dfs(i, x); if(z>1) t++; s++; maxk=max(z, maxk); } } if(t>2||(t==2&&s>0)) flag=0; return maxk+1; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, m; cin>>n>>m; for(int i=0; i<m; i++) { int x, y; cin>>x>>y; adj[x].push_back(y); adj[y].push_back(x); } for(int i=1; i<=n; i++) { for(int l=1; l<=n; l++) vis[l]=0; dfs(i, 0); } if(flag==0) cout<<"NO\n"; else { cout<<"YES\n"<<"2 1 1\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...