#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FFOR(i,a,b,c) for(int i=(a);(c)>0?i<=(b):i>=(b);i+=(c))
#define FOOR(i,a,b) FFOR(i,a,b-1,1)
#define ROOF(i,a,b) FFOR(i,b-1,a,-1)
#define FOR(i,n) FOOR(i,0,n)
#define ROF(i,n) ROOF(i,0,n)
#define FORR(x,v) for(auto &x:v)
#define all(v) (v).begin(),(v).end()
#define lla(v) (v).rbegin(),(v).rend()
#define sz(v) (int)((v).size())
#define vc vector
#define pb push_back
#define ppb pop_back
#define bk back()
#define fr front()
#define pp pop()
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define bg begin()
#define en end()
#define em empty()
#define f first
#define s second
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N,M;
cin>>N>>M;
FOR(i,M){
int x,y;
cin>>x>>y;
x--,y--;
}
cout<<"YES\n";
if(N==1){
cout<<"1\n1";
return 0;
}
vc<int> ans(N-1);
iota(all(ans),1);
FOOR(i,N%2==0?2:1,N) ans.pb(i);
cout<<sz(ans)<<"\n";
FORR(x,ans)cout<<x<<" ";
return 6/22;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 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 |
0 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 |
1 ms |
212 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 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 |
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 |
0 ms |
212 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 |
212 KB |
Failed to provide a successful strategy. |
| 11 |
Partially correct |
0 ms |
340 KB |
Failed to provide a successful strategy. |
| 12 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 13 |
Partially correct |
0 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 |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 16 |
Partially correct |
0 ms |
340 KB |
Failed to provide a successful strategy. |
| 17 |
Partially correct |
0 ms |
340 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 |
340 KB |
Failed to provide a successful strategy. |
| 20 |
Partially correct |
0 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 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 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 |
0 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 |
- |
