제출 #519278

#제출 시각아이디문제언어결과실행 시간메모리
519278AmShZNewspapers (CEOI21_newspapers)C++11
0 / 100
1 ms332 KiB
//khodaya khodet komak kon # include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair <int, int> pii; typedef pair <pii, int> ppi; typedef pair <int, pii> pip; typedef pair <pii, pii> ppp; typedef pair <ll, ll> pll; # define A first # define B second # define endl '\n' # define sep ' ' # define all(x) x.begin(), x.end() # define kill(x) return cout << x << endl, 0 # define SZ(x) int(x.size()) # define lc id << 1 # define rc id << 1 | 1 # define fast_io ios::sync_with_stdio(0);cin.tie(0); cout.tie(0); ll power(ll a, ll b, ll md) {return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md));} const int xn = 1e3 + 10; const int xm = - 20 + 10; const int sq = 320; const int inf = 1e9 + 10; const ll INF = 1e18 + 10; const ld eps = 1e-15; const int mod = 998244353; const int base = 257; int n, m; vector <int> adj[xn]; int main(){ fast_io; cin >> n >> m; for (int i = 1; i <= m; ++ i){ int v, u; cin >> v >> u; adj[v].push_back(u); adj[u].push_back(v); } if (n == 1){ cout << "YES" << endl; cout << 1 << endl; cout << 1 << endl; return 0; } if (n == 2){ cout << "YES" << endl; cout << 2 << endl; cout << 1 << sep << 1 << endl; return 0; } if (n == 3){ cout << "YES" << endl; cout << 2 << endl; cout << 2 << sep << 2 << endl; return 0; } if (n == 4){ cout << "YES" << endl; cout << 4 << endl; cout << "2 3 3 2" << endl; return 0; } kill("NO"); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...