oj.uz

Submission #957208

# Submission time Handle Problem Language Result Execution time Memory
957208 2024-04-03T07:23:26 Z LucaIlie Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 468 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e3;
bool vis[MAX_N + 1], side[MAX_N + 1];
vector<int> adj[MAX_N + 1];

bool checkBipartite( int u ) {
    vis[u] = true;
    bool ok = true;
    for ( int v: adj[u] ) {
        if ( !vis[v] ) {
            side[v] = side[u] ^ 1;
            ok &= checkBipartite( v );
        } else if ( side[v] == side[u] )
            ok = false;
    }

    return ok;
}

int main() {
    int n, m;

    cin >> n >> m;
    for ( int i = 0; 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;
    }

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