oj.uz

Submission #912840

# Submission time Handle Problem Language Result Execution time Memory
912840 2024-01-20T02:45:01 Z juliany2 Newspapers (CEOI21_newspapers) C++17
8 / 100
 1 ms 600 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()

const int N = 1007;
int n, m;
vector<int> adj[N];

int main() {
    cin.tie(0)->sync_with_stdio(false);

    cin >> n >> m;

    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;

        adj[u].push_back(v);
        adj[v].push_back(u);
    }

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

    if (n == 1)
        cout << "YES" << '\n' << 1 << '\n' << 1 << '\n';
    else if (n == 2)
        cout << "YES" << '\n' << 2 << '\n' << 1 << ' ' << 1 << '\n';
    else {
        cout << "YES" << '\n' << 2 * (n - 2) << '\n';
        for (int i = 2; i <= n - 1; i++)
            cout << i << ' ';
        for (int i = n - 1; i >= 2; i--)
            cout << i << ' ';
        cout << '\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 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 600 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 344 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 600 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 344 KB Output isn't correct
10 Halted 0 ms 0 KB -