oj.uz

Submission #685049

# Submission time Handle Problem Language Result Execution time Memory
685049 2023-01-23T07:39:24 Z moonhero Newspapers (CEOI21_newspapers) C++14
4 / 100
 1 ms 352 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;

vector <int> g[1005];
bool used[1005], ok = 1;
int ln[1005], mx = 0;

void dfs (int v, int pr = 0) {
    used[v] = 1, ln[v] = ln[pr] + 1;
    mx = max(mx, ln[v]);
    for (auto it : g[v]) {
        if (!used[it]) dfs(it, v);
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, m; cin >> n >> m;
    ln[0] = 0;
    for (int i = 1; i <= m; i++) {
        int u, v; cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    } if (m != n - 1) {
        cout << "NO\n";
        return 0;
    } dfs(1);
    if (mx >= 2 || n == 1) {
        cout << "YES\n1\n1";
        return 0;
    } else cout << "NO\n";
    return 0;
}

Subtask #1
0.0 / 12.0

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

Subtask #2
4.0 / 8.0

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

Subtask #3
0.0 / 80.0

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