oj.uz

Submission #999225

# Submission time Handle Problem Language Result Execution time Memory
999225 2024-06-15T08:24:47 Z crafticat Newspapers (CEOI21_newspapers) C++17
4 / 100
 2 ms 608 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) {
            for (auto child : g[i]) 
                siz[child]--;
        }
        siz[i]+= g[i].size();
    }
    for (int i = 1; i <= n; ++i) {
        if (siz[i] > 2) {
            cout << "NO\n";
            return 0;
        }
    }
    cout << "YES\n";
    cout << "1\n";
    cout << "1\n";

    return 0;
}

Subtask #1
0.0 / 12.0

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

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 2 ms 608 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
7 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
11 Partially correct 1 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 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
15 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
18 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 352 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

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