oj.uz

Submission #999178

# Submission time Handle Problem Language Result Execution time Memory
999178 2024-06-15T07:50:53 Z IdanRosen Newspapers (CEOI21_newspapers) C++
4 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;

vector<vector<ll>> adj;

bool cycle = false;

vector<bool> vis;
void search(int node, int prev = -1) {
    vis[node] = true;

    for (ll nei : adj[node]) {
        if (nei == prev) continue;

        if (vis[nei]) {
            cycle = true;
            break;
        }

        search(nei, node);
    }
}

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

    ll n, m;
    cin >> n >> m;

    adj.resize(n);
    for (int i = 0; i < m; i++) {
        ll a, b;
        cin >> a >> b;
        a--;
        b--;

        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    vis.resize(n, false);
    search(0);

    if (cycle) {
        cout << "NO\n";
    } else {
        cout << "YES\n";
        cout << "1\n1\n";
    }
}

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 1 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 0 ms 460 KB Failed to provide a successful strategy.
7 Correct 0 ms 348 KB Output is correct
8 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 1 ms 348 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 1 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 1 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 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 604 KB Failed to provide a successful strategy.
11 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
13 Partially correct 1 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 1 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 1 ms 348 KB Failed to provide a successful strategy.
19 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
20 Partially correct 0 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 1 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 0 ms 460 KB Failed to provide a successful strategy.
7 Correct 0 ms 348 KB Output is correct
8 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 1 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -