oj.uz

Submission #928832

# Submission time Handle Problem Language Result Execution time Memory
928832 2024-02-17T06:27:22 Z math_rabbit_1028 Newspapers (CEOI21_newspapers) C++14
8 / 100
 28 ms 620 KB 
#include <bits/stdc++.h>
using namespace std;

int N, M;
vector<int> adj[1010];

int dfs(int v, int p=-1) {
    vector<int> vec;
    int depth = 0;
    for (int u : adj[v]) {
        if (u == p) continue;
        vec.push_back(dfs(u, v)+1);
        depth = max(depth, vec.back());
    }
    sort(vec.begin(), vec.end());
    reverse(vec.begin(), vec.end());
    if (vec.size() >= 3 && vec[0] >= 2 && vec[1] >= 2 && vec[2] >= 2) {
        cout << "NO\n";
        exit(0);
    }
    return depth;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> M;
    for (int i = 1; i <= M; i++) {
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    if (M >= N) {
        cout << "NO\n";
        return 0;
    }

    for (int i = 1; i <= N; i++) {
        dfs(i);
    }
    
    cout << "YES\n";
    if (N == 1) cout << "1\n1\n";
    else if (N == 2) cout << "2\n1 1\n";
    else {
        cout << 2*N-4 << "\n";
        for (int i = 2; i <= N-1; i++) cout << i << " ";
        for (int i = N-1; i >= 2; i--) cout << i << " ";
        cout << "\n";   
    }

    return 0;
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 25 ms 604 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 10 ms 348 KB Output is correct
14 Correct 12 ms 348 KB Output is correct
15 Correct 13 ms 344 KB Output is correct
16 Correct 28 ms 620 KB Output is correct
17 Correct 27 ms 604 KB Output is correct
18 Correct 27 ms 600 KB Output is correct
19 Correct 28 ms 604 KB Output is correct
20 Correct 27 ms 604 KB Output is correct

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Halted 0 ms 0 KB -