#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int n, m; cin >> n >> m;
for(int i = 0; i < m; i++){
int a, b; cin >> a >> b;
}
cout << "YES\n";
if(n == 3){
cout << 2 << '\n';
cout << 2 << ' ' << 2 << endl;
return 0;
}
if(n == 1){
cout << 1 << '\n' << 1 << endl;
return 0;
}
cout << n << endl;
for(int i = 1; i < n; i++)
cout << i << ' ';
cout << n - 1 << '\n';
}
# |
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 |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 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 |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Partially correct |
1 ms |
212 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 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
1 ms |
316 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
0 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 |
0 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 |
320 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
324 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 |
324 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
# |
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 |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 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 |
- |