#include<iostream>
#include<vector>
using namespace std;
vector<vector<int>> graph;
int main(){
int n,m;
cin>>n>>m;
int a,b;
graph.resize(n+1);
for(int i=0;i<m;i++){
cin>>a>>b;
graph[a].push_back(b);
graph[b].push_back(a);
}
if(n==3||n==2){
cout<<"YES\n2\n2 2";
}
else if(n==1){
cout<<"YES\n1\n1";
}
else cout<<"YES\n1\n1";
}
# |
결과 |
실행 시간 |
메모리 |
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 |
Failed to provide a successful strategy. |
6 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
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 |
1 ms |
296 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 |
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 |
300 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
340 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 |
340 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
1 ms |
304 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
340 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 |
308 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
304 KB |
Failed to provide a successful strategy. |
# |
결과 |
실행 시간 |
메모리 |
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 |
Failed to provide a successful strategy. |
6 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |