#include<bits/stdc++.h>
using namespace std;
vector<int>v[1001];
int main()
{
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++)
{
int x,y;
cin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
if(m>=n)cout<<"NO";
else
{
int cnt2,cntbig;
cnt2=cntbig=0;
for(int i=1;i<=n;i++)
{
if(v[i].size()==2)cnt2++;
if(v[i].size()>2)cntbig++;
}
if(cntbig>0 && cntbig+2>1){cout<<"NO\n";}
else cout<<"YES\n1\n1";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
5 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Partially correct |
1 ms |
204 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
1 ms |
204 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
1 ms |
204 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
1 ms |
204 KB |
Failed to provide a successful strategy. |
7 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
1 ms |
204 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
1 ms |
204 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
13 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
2 ms |
332 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
5 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |