oj.uz

Submission #832222

# Submission time Handle Problem Language Result Execution time Memory
832222 2023-08-21T07:00:53 Z QwertyPi Newspapers (CEOI21_newspapers) C++14
6 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define int long long
using namespace std;

const int MAXN = 1e3 + 11;
int32_t main(){
    int n, m; cin >> n >> m;
    if(n == 1){
        cout << "YES\n1\n1\n";
        return 0;
    }
    cout << "YES" << endl;
    cout << (n - 1) * 2 + 1 << endl;
    if(n % 2){
        for(int i = 1; i <= n; i++){
            cout << i << ' ';
        }
        for(int i = 1; i <= n - 1; i++){
            cout << i << ' ';
        }
    }else{
        for(int i = 1; i <= n - 1; i++){
            cout << i << ' ';
        }
        for(int i = 1; i <= n; i++){
            cout << i << ' ';
        }
    }
}

Subtask #1
0.0 / 12.0

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

Subtask #2
6.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 Provide a successful but not optimal strategy.
3 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
4 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
6 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
7 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
8 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
9 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
10 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
11 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
12 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
13 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
14 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
15 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
16 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
17 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
18 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
19 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
20 Partially correct 1 ms 212 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 1 ms 212 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -