oj.uz

Submission #576548

# Submission time Handle Problem Language Result Execution time Memory
576548 2022-06-13T07:34:24 Z tengiz05 Newspapers (CEOI21_newspapers) C++17
8 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

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

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
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 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
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 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -