제출 #576724

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
576724		talant117408	Newspapers (CEOI21_newspapers)	C++17	4 / 100	1 ms	340 KiB

newspapers

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define long                unsigned long 
#define pb                  push_back
#define mp                  make_pair
#define all(v)              (v).begin(),(v).end()
#define rall(v)             (v).rbegin(),(v).rend()
#define lb                  lower_bound
#define ub                  upper_bound
#define sz(v)               int((v).size())
#define do_not_disturb      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl                '\n'

const int N = 1e3+3;
vector <int> graph[N];

void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;
        graph[a].pb(b);
        graph[b].pb(a);
    }
    bool flag = (m >= n);
    for (int i = 1; i <= n; i++) {
        int cnt = 0;
        for (auto to : graph[i]) {
            if (sz(graph[to]) == 1) continue;
            auto x = graph[to][0];
            if (x == i) x = graph[to][1];
            if (sz(graph[x]) > 1) cnt++;
        }
        if (cnt > 2) flag = 1;
    }
    if (flag) {
        cout << "NO" << endl;
        return;
    }
    //~ int forbidden, start = 1, forbidden_leaves = 0;
    //~ for (int i = 1; i <= n; i++) {
        //~ if (sz(graph[i]) == 1) {
            //~ start = graph[i][0];
            //~ forbidden = color[i];
            //~ break;
        //~ }
    //~ }
    //~ for (int i = 1; i <= n; i++) {
        //~ if (sz(graph[i]) == 1 && forbidden == color[i]) {
            //~ forbidden_leaves++;
        //~ }
    //~ }
    //~ set <int> visited;
    //~ vector <int> order;
    //~ int add = 1;
    //~ function <void(int, int)> dfs2 = [&](int v, int p) {
        //~ if (add) {                                     
            //~ visited.insert(v);
            //~ order.pb(v);
        //~ }
        //~ if (sz(visited) == n-forbidden_leaves) {
            //~ add = 0;
        //~ }
        //~ for (auto to : graph[v]) {
            //~ if (to == p) continue;
            //~ if (sz(graph[to]) == 1 && color[to] == forbidden) continue;
            //~ dfs2(to, v);
            //~ if (add) {
                //~ visited.insert(v);
                //~ order.pb(v);
            //~ }
        //~ }
    //~ };
    //~ dfs2(start, start);
    cout << "YES" << endl;
    cout << "1\n1";
    //~ cout << sz(order)*2 << endl;
    //~ for (auto to : order) cout << to << ' ';
    //~ for (auto to : order) cout << to << ' ';
}

int main() {
    do_not_disturb
    
    int t = 1;
    //~ cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}

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