oj.uz

Submission #601771

# Submission time Handle Problem Language Result Execution time Memory
601771 2022-07-22T09:49:17 Z Valaki2 Newspapers (CEOI21_newspapers) C++14
6 / 100
 1 ms 316 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

void solve() {
    int n, m;
    cin >> n >> m;
    if(n == 1) {
        cout << "YES\n1\n1\n";
        return;
    }
    if(n == 2) {
        cout << "YES\n2\n1 1\n";
        return;
    }
    cout << "YES\n";
    cout << 2 * n - 3 << "\n";
    for(int i = 1; i <= n - 1; i++) {
        cout << i << " ";
    }
    for(int i = n - 1; i >= 2; i--) {
        cout << i << " ";
    }
    cout << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Subtask #1
0.0 / 12.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 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 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
6.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 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 Provide a successful but not optimal strategy.
7 Partially correct 0 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 1 ms 212 KB Provide a successful but not optimal strategy.
15 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
16 Partially correct 1 ms 288 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 1 ms 316 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 Correct 0 ms 212 KB Output is correct
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 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 -