oj.uz

답안 #999260

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
999260 2024-06-15T08:47:36 Z crafticat Newspapers (CEOI21_newspapers) C++17
6 / 100
 1 ms 600 KB 
#include <bits/stdc++.h>

using namespace std;
vector<vector<int>> g;
int MAX_DEP = 0;

vector<int> ans;

void dfs(int x, int p) {
    if (g[x].size() == 1 && p != 0) return;
    ans.push_back(x);
    for (auto child : g[x]) {
        if (child == p) continue;
        dfs(child,x);
    }
    ans.push_back(x);
}

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

    int n, m; cin >> n >> m;

    g.resize(n + 1);
    for (int i = 0; i < m; ++i) {
        int a, b; cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    if (m != n -1) {
        cout << "NO\n";
        return 0;
    }

    if (n == 1) {
        cout << "YES\n";
        cout << "1\n";
        cout << "1\n";
        return 0;
    }

    vector<int> siz(n + 1);
    for (int i = 1; i <= n; ++i) {
        if (g[i].size() == 1) {
            siz[i]--;
            for (auto child : g[i]) {
                siz[child]--;
            }
        }
        siz[i]+= g[i].size();
    }
    for (int i = 1; i <= n; ++i) {
        if (siz[i] == 1 && g[i].size() <= 4) {
            for (auto child : g[i])
                siz[child]--;
        }
    }
    for (int i = 1; i <= n; ++i) {
        if (siz[i] > 2) {
            cout << "NO\n";
            return 0;
        }
    }
    dfs(1,0);
    cout << "YES\n";
    cout << ans.size() << "\n";
    for (auto x: ans) {
        cout << x << " ";
    }

    return 0;
}

Subtask #1
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Correct 0 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Correct 0 ms 348 KB Output is correct
10 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
11 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
12 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
13 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
14 Correct 0 ms 348 KB Output is correct
15 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
16 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
17 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
18 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
19 Correct 0 ms 348 KB Output is correct
20 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
21 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
22 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
23 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
24 Correct 0 ms 348 KB Output is correct
25 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
26 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
27 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
28 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
29 Correct 0 ms 348 KB Output is correct
30 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
31 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
32 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
33 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
34 Incorrect 0 ms 348 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #2
6.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
7 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
8 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
9 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
10 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
11 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
12 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
13 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
14 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
15 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
16 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
17 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
18 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
19 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
20 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Correct 0 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Correct 0 ms 348 KB Output is correct
10 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
11 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
12 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
13 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
14 Correct 0 ms 348 KB Output is correct
15 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
16 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
17 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
18 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
19 Correct 0 ms 348 KB Output is correct
20 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
21 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
22 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
23 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
24 Correct 0 ms 348 KB Output is correct
25 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
26 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
27 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
28 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
29 Correct 0 ms 348 KB Output is correct
30 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
31 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
32 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
33 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
34 Incorrect 0 ms 348 KB Output isn't correct
35 Halted 0 ms 0 KB -