oj.uz

Submission #892372

# Submission time Handle Problem Language Result Execution time Memory
892372 2023-12-25T09:17:24 Z Pannda Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;

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

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

    vector<vector<int>> adj(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    if (m != n - 1) {
        cout << "NO\n";
        return 0;
    }

    int cnt3 = 0;
    int cnt2 = 0;
    for (int u = 0; u < n; u++) {
        if (adj[u].size() >= 3) {
            cnt3++;
        }
        if (adj[u].size() == 2) {
            cnt2++;
        }
    }

    if (cnt3 == 0) {
        cout << "YES\n";
        cout << "1\n1\n";
    } else {
        if (cnt3 >= 2) {
            cout << "NO\n";
            return 0;
        }
        if (cnt2 >= 2) {
            cout << "NO\n";
            return 0;
        } else {
            cout << "YES\n";
            cout << "1\n1\n";
            return 0;
        }
    }
}

Subtask #1
0.0 / 12.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 0 ms 348 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Incorrect 0 ms 348 KB Output isn't correct
7 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 1 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 600 KB Failed to provide a successful strategy.
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 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 0 ms 344 KB Failed to provide a successful strategy.
15 Partially correct 0 ms 460 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 492 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 464 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 348 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.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 0 ms 348 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -