oj.uz

Submission #956965

# Submission time Handle Problem Language Result Execution time Memory
956965 2024-04-02T18:13:24 Z LucaIlie Newspapers (CEOI21_newspapers) C++17
6 / 100
 2 ms 604 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 );
    }

    cout << "YES\n";
    cout << 2 * n << "\n";
    for ( int i = 1; i <= n; i++ )
        cout << i << " ";
    for ( int i = n; i >= 1; i-- )
        cout << i << " ";

    return 0;
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
2 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
4 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
6.0 / 8.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
2 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
7 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
8 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
9 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
10 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
11 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
12 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
13 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
14 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
15 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
16 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
17 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
18 Partially correct 2 ms 604 KB Provide a successful but not optimal strategy.
19 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
20 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
2 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
4 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -