Submission #606704

#TimeUsernameProblemLanguageResultExecution timeMemory
606704radalNewspapers (CEOI21_newspapers)C++17
6 / 100
8 ms12116 KiB
#include <bits/stdc++.h> #pragma GCC target("sse,sse2") #pragma GCC optimize("unroll-loops,O3") #define rep(i,l,r) for (int i = l; i < r; i++) #define repr(i,r,l) for (int i = r; i >= l; i--) #define X first #define Y second #define all(x) (x).begin() , (x).end() #define pb push_back #define endl '\n' #define debug(x) cerr << #x << " : " << x << endl; using namespace std; typedef long long ll; typedef long double ld; typedef pair<int,int> pll; constexpr int N = 5e5+20,mod = 1e9+7,inf = 1e9+10,sq = 340; inline int mkay(int a,int b){ if (a+b >= mod) return a+b-mod; if (a+b < 0) return a+b+mod; return a+b; } inline int poww(int a,int k){ if (k < 0) return 0; int z = 1; while (k){ if (k&1) z = 1ll*z*a%mod; a = 1ll*a*a%mod; k /= 2; } return z; } vector<int> adj[N],ve; void dfs(int v,int p){ ve.pb(v); for (int u : adj[v]) if (u != p) dfs(u,v); } int main(){ ios :: sync_with_stdio(0); cin.tie(0); int n,m; cin >> n >> m; if (n == 1){ cout << "YES" << endl << 1 << endl << 1; return 0; } if (n-1 < m){ cout << "NO"; return 0; } rep(i,1,n){ int u,v; cin >> u >> v; adj[u].pb(v); adj[v].pb(u); } int mx = 0; rep(i,1,n+1) mx = max(mx,(int)adj[i].size()); if (mx == n-1){ cout << "YES" << endl << 2 << endl; rep(i,1,n+1){ if ((int)adj[i].size() != n-1) continue; cout << i << ' ' << i << endl; return 0; } } if (mx == 2){ cout << "YES" << endl; rep(i,1,n+1){ if (adj[i].size() == 1){ dfs(i,0); break; } } cout << 2*n-(n&1)-2 << endl; if (n&1){ rep(i,0,n-1) cout << ve[i] << ' '; rep(i,1,n-1) cout << ve[i] << ' '; return 0; } rep(j,0,2) rep(i,0,n-1) cout << ve[i] << ' '; return 0; } cout << "NO" << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...