답안 #1060847

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1060847	2024-08-16T02:12:36 Z	thinknoexit	Newspapers (CEOI21_newspapers)	C++17	8 / 100	1 ms	456 KB

newspapers

#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    if (n <= 2) {
        cout << "YES\n";
        cout << n << '\n';
        for (int i = 1;i <= n;i++) cout << 1 << ' ';
        return 0;
    }
    cout << "YES\n";
    cout << 2 * (n - 2) << '\n';
    for (int i = 2;i < n;i++) {
        cout << i << ' ';
    }
    for (int i = n - 1;i > 1;i--) {
        cout << i << ' ';
    }
    return 0;
}

Subtask #1

0.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	456 KB	Failed to provide a successful strategy.
7	Incorrect	0 ms	348 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #2

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct

Subtask #3

0.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	456 KB	Failed to provide a successful strategy.
7	Incorrect	0 ms	348 KB	Output isn't correct
8	Halted	0 ms	0 KB	-