oj.uz

Submission #961132

# Submission time Handle Problem Language Result Execution time Memory
961132 2024-04-11T14:20:05 Z PagodePaiva Newspapers (CEOI21_newspapers) C++17
4 / 100
 3 ms 516 KB 
#include<bits/stdc++.h>
#define N 1010

using namespace std;

vector <int> g[N];

int main(){
    int n, m;
    cin>>n >>m;
    for(int i = 0;i <m;i++){
        int a, b;
        cin >> a >> b;
    }
    cout << "YES\n";
    if(n == 1){
        cout << 1 << endl;
        cout << 1 << endl;
        return 0;
    }
    if(n % 2 == 0){
        cout << 2*n-3 << endl;
        for(int i = n-1;i > 1;i--) cout << i << ' ';
        for(int i = n;i > 1;i--) cout << i << ' ';
        cout << endl;
    }
    else{
        cout << 2*(n-1)-2 << endl;
        for(int i = n-1;i > 1;i--) cout << i << ' ';
        for(int i = n-1;i > 1;i--) cout << i << ' ';
            cout << endl;
    }
    return 0;
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
3 Correct 0 ms 348 KB Output is correct
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 1 ms 516 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
7 Incorrect 1 ms 348 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 3 ms 344 KB Output is correct
2 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
3 Correct 1 ms 348 KB Output is correct
4 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
5 Correct 1 ms 348 KB Output is correct
6 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
7 Correct 1 ms 460 KB Output is correct
8 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
9 Correct 0 ms 420 KB Output is correct
10 Partially correct 2 ms 348 KB Provide a successful but not optimal strategy.
11 Partially correct 1 ms 464 KB Provide a successful but not optimal strategy.
12 Correct 1 ms 348 KB Output is correct
13 Partially correct 2 ms 348 KB Provide a successful but not optimal strategy.
14 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
15 Correct 1 ms 512 KB Output is correct
16 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
17 Correct 1 ms 344 KB Output is correct
18 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
19 Correct 1 ms 348 KB Output is correct
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 Correct 0 ms 344 KB Output is correct
2 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
3 Correct 0 ms 348 KB Output is correct
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 1 ms 516 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
7 Incorrect 1 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -