oj.uz

답안 #576728

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
576728 2022-06-13T11:16:14 Z talant117408 Newspapers (CEOI21_newspapers) C++17
4 / 100
 2 ms 532 KB 
#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];
int depth[N], furthest[N];
vector <int> diameter, order;
int df, vf, in_diameter[N];

void find_furthest(int v, int p, int dist) {
    order.pb(v);
    if (dist > df) {
        df = dist;
        vf = v;
        diameter = order;
    }
    for (auto to : graph[v]) {
        if (to == p) continue;
        find_furthest(to, v, dist+1);
    }
    order.pop_back();
}

int dfs(int v, int p) {
    int mx = 0;
    for (auto to : graph[v]) {
        if (to == p || in_diameter[to]) continue;
        depth[to] = depth[v] + 1;
        mx = max(mx, dfs(to, v));
    }
    furthest[v] = mx;
    return depth[v];
}

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);
    }
    if (m >= n) {
        cout << "NO" << endl;
        return;
    }
    if (n <= 9) {
        cout << "YES\n1\n1";
        return;
    }
    find_furthest(1, 1, 0);
    df = 0;
    find_furthest(vf, vf, 0);
    df = 0;
    for (auto to : diameter) in_diameter[to] = 1;
    for (int i = 0; i < sz(diameter); i++) {
        auto to = diameter[i];
        dfs(to, to);
        if (depth[to] >= 3 && i >= 3 && i <= n-4) {
            df++;
        }
    }
    if (df >= 3) {
        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.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
7 Correct 0 ms 348 KB Output is correct
8 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
9 Incorrect 1 ms 468 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
3 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
7 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 356 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 392 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
15 Partially correct 1 ms 480 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
19 Partially correct 2 ms 532 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 468 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
7 Correct 0 ms 348 KB Output is correct
8 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
9 Incorrect 1 ms 468 KB Output isn't correct
10 Halted 0 ms 0 KB -