//In the name of God
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll maxn = 2e6 + 100;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r+", stdin);freopen("output.txt", "w+", stdout);
#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) ll((x).size())
#define all(x) (x).begin(), (x).end()
ll pw(ll a, ll b){
ll c = 1;
while(b){
if(b & 1) c = c * a % mod;
a = a * a % mod;
b >>= 1;
}
return c;
}
int n, m, g[maxn], d[maxn], p[maxn], pp[maxn];
bool vis[maxn];
queue<int> q;
int get(int x){
int y = 0;
for(int i = 0; i < n; i++){
if((x >> i) & 1) y |= g[i];
}
return y;
}
int main(){
fast_io;
cin >> n >> m;
for(int i = 0; i < m; i++){
int v, u;
cin >> v >> u;
v--;
u--;
g[v] |= (1 << u);
g[u] |= (1 << v);
}
p[(1 << n) - 1] = -1;
vis[(1 << n) - 1] = 1;
q.push((1 << n) - 1);
while(!q.empty()){
int v = q.front();
q.pop();
for(int i = 0; i < n; i++){
int u = get(v & (~(1 << i)));
if(!vis[u]){
vis[u] = 1;
d[u] = d[v] + 1;
p[u] = v;
pp[u] = i;
q.push(u);
}
}
}
if(!vis[0]){
cout << "NO\n";
return 0;
}
cout << d[0] << "\n";
int v = 0;
vector<int> vec;
while(p[v] != -1){
vec.pb(pp[v]);
v = p[v];
}
reverse(all(vec));
for(int i : vec){
cout << i + 1 << " ";
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
332 KB |
Token "1" doesn't correspond to pattern "YES|NO" |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
332 KB |
Token "1" doesn't correspond to pattern "YES|NO" |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
332 KB |
Token "1" doesn't correspond to pattern "YES|NO" |
| 2 |
Halted |
0 ms |
0 KB |
- |
