Submission #602778

#TimeUsernameProblemLanguageResultExecution timeMemory
602778cadmiumskyNewspapers (CEOI21_newspapers)C++14
4 / 100
1 ms212 KiB
#include <bits/stdc++.h>
 
using namespace std;
const int nmax = 1e3 + 5;
vector<int> g[nmax];
 
int main() {  
  int n, m;
  cin >> n >> m;
  if(m == n - 1) {
    cout << "YES\n1\n1\n";
  }
  else if(m == n) {
    for(int i = 0, x, y; i < m; i++) {
      cin >> x >> y;
      g[x].push_back(y);
      g[y].push_back(x);
    }
    for(int i = 1; i <= n; i++) {
      if(g[i].size() != 2) {
        cout << "NO\n";
        return 0;
      }
    }
    cout << "YES\n1\n1\n";
  }
  else
    cout << "NO\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...