#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
bool ok[1<<20] = {0};
bool v[1<<20] = {0};
vector<vll>adj;
vll ans;
bool solve(ll mask){
if(ok[mask]){
return 1;
}
if(v[mask]){
return 0;
}
v[mask] = 1;
f(j,0,20){
if(mask & (1LL<<j)){
ll num = mask ^ (1LL<<j);
ans.pb(j+1);
ll neo = 0;
f(i,0,20){
if(num & (1LL<<i)){
for(auto x:adj[i]){
neo |= (1<<x);
}
}
}
ok[mask] |= solve(neo);
if(ok[mask]){
break;
}
ans.pop_back();
}
}
return ok[mask];
}
int main(void){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,m;
cin>>n>>m;
adj.assign(n+5,vll());
f(i,0,m){
ll a,b;
cin>>a>>b;
adj[a].pb(b);
adj[b].pb(a);
}
ok[0] = 1;
ll num = (1<<n) - 1;
if(solve(num)){
cout<<"YES\n";
for(auto x:ans){
cout<<x<<" ";
}
}
else{
cout<<"NO\n";
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Unexpected end of file - int32 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Unexpected end of file - int32 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Unexpected end of file - int32 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
