oj.uz

Submission #593964

# Submission time Handle Problem Language Result Execution time Memory
593964 2022-07-11T18:25:20 Z vladislav11 Newspapers (CEOI21_newspapers) C++14
4 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>

using namespace std;

int n, m;
vector< vector<int> > grp;

int main ()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m;

    grp.resize( n+1 );

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

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

    cout << "YES\n";

    if ( n == 1 )
    {
        cout << "1\n1\n";
        return 0;
    }

    if ( n == 2 )
    {
        cout << "1\n1\n";
        return 0;
    }

    vector<int> ans;

    for ( int i=n-1; i>1; i-- )
        ans.push_back( i );

    for ( int i=n&(~1); i>1; i-- )
        ans.push_back( i );

    cout << ans.size() << '\n';

    for ( auto& el : ans )
        cout << el << ' ';
    cout << '\n';

    return 0;
}

Subtask #1
0.0 / 12.0

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

Subtask #2
4.0 / 8.0

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

Subtask #3
0.0 / 80.0

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