답안 #832217

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
832217	2023-08-21T06:55:20 Z	QwertyPi	Newspapers (CEOI21_newspapers)	C++14	4 / 100	1 ms	340 KB

newspapers

#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 << endl;
    for(int i = 1; i <= n - 1; i++){
        cout << i << ' ' << i << ' ';
    }
    cout << endl;
}

Subtask #1

0.0 / 12.0

#	결과	실행 시간	메모리	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	Failed to provide a successful strategy.
4	Partially correct	1 ms	304 KB	Failed to provide a successful strategy.
5	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
6	Partially correct	0 ms	296 KB	Failed to provide a successful strategy.
7	Incorrect	1 ms	212 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #2

4.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	304 KB	Output is correct
3	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
4	Partially correct	0 ms	212 KB	Failed to provide a successful 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	Partially correct	1 ms	300 KB	Failed to provide a successful strategy.
8	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
9	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
10	Partially correct	0 ms	296 KB	Failed to provide a successful strategy.
11	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
12	Partially correct	0 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	0 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	0 ms	300 KB	Failed to provide a successful strategy.
18	Partially correct	1 ms	340 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.

Subtask #3

0.0 / 80.0

#	결과	실행 시간	메모리	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	Failed to provide a successful strategy.
4	Partially correct	1 ms	304 KB	Failed to provide a successful strategy.
5	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
6	Partially correct	0 ms	296 KB	Failed to provide a successful strategy.
7	Incorrect	1 ms	212 KB	Output isn't correct
8	Halted	0 ms	0 KB	-