oj.uz

Submission #601784

# Submission time Handle Problem Language Result Execution time Memory
601784 2022-07-22T09:58:13 Z Valaki2 Newspapers (CEOI21_newspapers) C++14
4 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

void no() {
    cout << "NO\n";
    exit(0);
}

void solve() {
    int n, m;
    cin >> n >> m;
    if(n == 1) {
        cout << "YES\n1\n1\n";
        return;
    }
    if(m != n - 1) {
        no();
    }
    vector<int> deg(1 + n, 0);
    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        deg[a]++;
        deg[b]++;
    }
    int cnt = 0;
    for(int i = 1; i <= n; i++) {
        if(deg[i] == 1) {
            cnt++;
        }
    }
    if(cnt != 2) {
        no();
    }
    cout << "YES\n1\n1\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Subtask #1
0.0 / 12.0

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

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
7 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
12 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
14 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
15 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
16 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 212 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

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