Submission #602821

#TimeUsernameProblemLanguageResultExecution timeMemory
602821cadmiumskyNewspapers (CEOI21_newspapers)C++14
4 / 100
1 ms340 KiB
#include <bits/stdc++.h>
 
using namespace std;
 
const int nmax = 1e3 + 5;
bool vec[nmax];
vector<int> g[nmax];

int main() {  
  int n, m;
  cin >> n >> m;
  if(m == n - 1) {
    int found = -1, cnt = 0;
    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(found == -1 && g[i].size() == 1) {
        found = 1;
        continue;
      }
      if(g[i].size() - 1 >= 2)
        cnt++;
    }
    if(cnt > 1)
      cout << "NO\n";
    else
      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...