#include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
std::cout << "YES" << std::endl;
if (N == 1) {
std::cout << 1 << '\n' << 1 << std::endl;
} else if (N <= 3) {
std::cout << 2 << '\n' << 2 << ' ' << 2 << std::endl;
} else {
std::cout << 2 + (N - 3) * 3 + 1 << std::endl;
std::cout << 2 << ' ' << 2 << ' ';
for (int i = 3; i <= N - 1; ++i) {
std::cout << i + 1 << ' ' << i - 1 << ' ' << i << ' ';
}
std::cout << N - 1 << std::endl;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Partially correct |
1 ms |
300 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
1 ms |
300 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
1 ms |
300 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
300 KB |
Output is correct |
4 |
Partially correct |
1 ms |
300 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
304 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
1 ms |
300 KB |
Failed to provide a successful strategy. |
7 |
Partially correct |
1 ms |
296 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
13 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Partially correct |
1 ms |
300 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
1 ms |
300 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
1 ms |
300 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |