제출 #1123979

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123979		mychecksedad	Newspapers (CEOI21_newspapers)	C++20	4 / 100	20 ms	27720 KiB

newspapers

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;


int n, m;
vector<int> g[N];
bool no = 0;
vector<int> vis(N);
void dfs(int v, int p){
  vis[v] = vis[p] == 1 ? 2 : 1;
  for(int u: g[v]){
    if(vis[u]){
      if(vis[u] == vis[v]){
        no = 1;
        break;
      }
    }else{
      dfs(u, v);
    }
  }
}
void solve(){
  cin >> n >> m;
  for(int i = 1; i <= m; ++i){
    int u, v; cin >> u >> v;
    g[u].pb(v);
    g[v].pb(u);
  }
  vis[1] = 1;
  dfs(1, 1);
  if(no || m >= n){
    cout << "NO";
  }else{
    cout << "YES\n";
    cout << "1\n1";
  }
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

• Subtask 1: 0 / 12
• Subtask 2: 4 / 8
• Subtask 3: 0 / 80