# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
541588 | mat_v | Newspapers (CEOI21_newspapers) | C++14 | 1 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define mod 998244353
#define xx first
#define yy second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ll long long
#define pii pair<int,int>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;/// find_by_order(x)(x+1th) , order_of_key() (strictly less)
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int n,m;
vector<int> graf[1005];
int deg[1005];
int pom[1005];
vector<int> v;
bool bio[1005];
void dfs(int x){
bio[x] = 1;
v.pb(x);
v.pb(x);
for(auto c:graf[x]){
if(bio[c])continue;
if(deg[c] == 1)continue;
dfs(c);
}
}
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n >> m;
ff(i,1,m){
int a,b;
cin >> a >> b;
graf[a].pb(b);
graf[b].pb(a);
deg[a]++;
deg[b]++;
}
if(m >= n){
cout << "NO\n";
return 0;
}
if(n == 2){
cout << "YES\n";
cout << 2 << "\n" << 1 << " " << 1 << "\n";
return 0;
}
ff(i,1,n){
int klk = 0;
for(auto c:graf[i]){
if(deg[c]>1)klk++;
}
pom[i] = klk;
if(klk >= 3){
cout << "NO\n";
return 0;
}
}
int poc = 0;
ff(i,1,n){
if(pom[i] <= 1 && deg[i] > 1)poc = i;
}
dfs(poc);
cout << "YES\n";
cout << v.size() << "\n";
for(auto c:v)cout << c << " ";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |