oj.uz

답안 #928822

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928822 2024-02-17T06:21:36 Z math_rabbit_1028 Newspapers (CEOI21_newspapers) C++14
8 / 100
 8 ms 780 KB 
#include <bits/stdc++.h>
using namespace std;

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

vector<int> vec;
int depth;
void dfs(int v, int p=-1) {
    for (int u : adj[v]) {
        if (u == p) continue;
        depth++;
        dfs(u, v);
        depth--;
    }
    if (adj[v].size() == 0) vec.push_back(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++) {
        vec.clear();
        depth = 0;
        dfs(i);
        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";
            return 0;
        } 
    }
    
    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

# 결과 실행 시간 메모리 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 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 1 ms 604 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 1 ms 344 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 600 KB Output is correct
11 Correct 7 ms 572 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 3 ms 540 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 7 ms 348 KB Output is correct
17 Correct 7 ms 348 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 8 ms 780 KB Output is correct

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 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 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 1 ms 604 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 1 ms 344 KB Output isn't correct
10 Halted 0 ms 0 KB -