Submission #713429

#TimeUsernameProblemLanguageResultExecution timeMemory
713429PacybwoahNewspapers (CEOI21_newspapers)C++14
8 / 100
1 ms340 KiB
#include<iostream>
#include<vector>
using namespace std;
vector<vector<int>> graph;
int main(){
    int n,m;
    cin>>n>>m;
    int a,b;
    graph.resize(n+1);
    vector<int> deg(n+1);
    int maxdeg=0;
    for(int i=0;i<m;i++){
        cin>>a>>b;
        deg[a]++;
        deg[b]++;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    for(int i=1;i<=n;i++) if(maxdeg<deg[i]) maxdeg=deg[i];
    if(n<=m){
        cout<<"NO\n";
    }
    else if(n==3||n==2){
        cout<<"YES\n2\n2 2";
    }
    else if(n==1){
        cout<<"YES\n1\n1";
    }
    else if(maxdeg==2||maxdeg==m){
        cout<<"YES\n";
        cout<<(n-2)*2<<"\n";
        for(int i=2;i<n;i++) cout<<i<<" ";
        for(int i=n-1;i>=2;i--) cout<<i<<" ";
    }
    else cout<<"NO\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...