結果

問題 No.2948 move move rotti
コンテスト
ユーザー 👑 binap
提出日時 2024-10-25 22:01:36
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 207 ms / 4,000 ms
コード長 3,294 bytes
コンパイル時間 4,232 ms
コンパイル使用メモリ 254,656 KB
最終ジャッジ日時 2025-02-24 23:19:42
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int main(){
	int n, m, k;
	cin >> n >> m >> k;
	vector<int> a(k);
	cin >> a;
	
	rep(i, k) a[i]--;
	
	vector<vector<int>> G(n, vector<int>(n));
	rep(i, m){
		int u, v;
		cin >> u >> v;
		u--; v--;
		G[u][v] = 1;
		G[v][u] = 1;
	}
	
	vector<vector<vector<int>>> possible(n, vector<vector<int>>(n, vector<int>(n)));
	vector<vector<vector<int>>> dp(n, vector<vector<int>>(n, vector<int>(1 << n)));
	
	rep(start, n){
		dp[start][start][1 << start] = 1;
		possible[start][start][0] = 1;
		rep(s, 1 << n){
			rep(from, n){
				if((s >> from) & 1){
					if(dp[start][from][s] == 0) continue;
					rep(to, n){
						if(G[from][to] == 0) continue;
						if((s >> to) & 1) continue;
						dp[start][to][s | (1 << to)] = 1;
						possible[start][to][__builtin_popcount(s)] = 1;
					}
				}
			}
		}
	}
	
	string ans = "No";
	rep(destination, n){
		rep(t, n){
			bool success = true;
			rep(i, k){
				if(possible[a[i]][destination][t] == 0) success = false;
			}
			if(success) ans = "Yes";
		}
	}
	cout << ans << "\n";
	return 0;
}
0