結果

問題 No.2910 単体ホモロジー入門
ユーザー 👑 binapbinap
提出日時 2024-10-04 23:28:59
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 3,650 bytes
コンパイル時間 4,592 ms
コンパイル使用メモリ 266,408 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-04 23:29:05
合計ジャッジ時間 5,022 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,820 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 1 ms
6,816 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 1 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 2 ms
6,820 KB
testcase_08 AC 1 ms
6,816 KB
testcase_09 AC 2 ms
6,820 KB
testcase_10 AC 2 ms
6,820 KB
testcase_11 AC 2 ms
6,816 KB
testcase_12 AC 1 ms
6,820 KB
testcase_13 AC 2 ms
6,820 KB
testcase_14 AC 2 ms
6,820 KB
testcase_15 AC 2 ms
6,816 KB
testcase_16 AC 1 ms
6,816 KB
testcase_17 AC 1 ms
6,816 KB
testcase_18 AC 2 ms
6,816 KB
testcase_19 AC 1 ms
6,816 KB
testcase_20 AC 2 ms
6,816 KB
testcase_21 AC 2 ms
6,820 KB
testcase_22 AC 1 ms
6,816 KB
testcase_23 AC 1 ms
6,816 KB
testcase_24 AC 2 ms
6,820 KB
testcase_25 AC 1 ms
6,820 KB
testcase_26 AC 2 ms
6,816 KB
testcase_27 AC 1 ms
6,816 KB
testcase_28 AC 2 ms
6,816 KB
testcase_29 AC 1 ms
6,820 KB
testcase_30 AC 1 ms
6,816 KB
testcase_31 AC 1 ms
6,820 KB
testcase_32 AC 1 ms
6,820 KB
testcase_33 AC 2 ms
6,816 KB
testcase_34 AC 2 ms
6,820 KB
testcase_35 AC 2 ms
6,820 KB
testcase_36 AC 2 ms
6,816 KB
testcase_37 AC 2 ms
6,816 KB
testcase_38 AC 1 ms
6,820 KB
testcase_39 AC 1 ms
6,820 KB
testcase_40 AC 2 ms
6,816 KB
testcase_41 AC 1 ms
6,820 KB
testcase_42 AC 2 ms
6,816 KB
testcase_43 AC 1 ms
6,816 KB
testcase_44 AC 1 ms
6,816 KB
testcase_45 AC 2 ms
6,820 KB
testcase_46 AC 1 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

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;
	cin >> n >> m;
	vector<vector<int>> G(n, vector<int>(n));
	rep(i, m){
		int u, v;
		cin >> u >> v;
		G[u][v] = 1;
		G[v][u] = 1;
	}
	vector<int> v(3);
	cin >> v;
	
	sort(v.begin(), v.end());
	
	string ans = "No\n";
	
	if(n >= 3){
		vector<int> perm(3);
		rep(i, 3) perm[i] = i;
		do{
			vector<int> perm_sorted = perm;
			sort(perm_sorted.begin(), perm_sorted.end());
			if(perm_sorted[0] == v[0] and perm_sorted[1] == v[1] and perm_sorted[2] == v[2]) continue;
			if(G[perm[0]][perm[1]] == 1 and G[perm[1]][perm[2]] == 1 and G[perm[2]][perm[0]] == 1) ans = "Yes\n";
		}while(next_permutation(perm.begin(), perm.end()));
	}
	if(n >= 4){
		vector<int> perm(4);
		rep(i, 4) perm[i] = i;
		do{
			vector<int> perm_sorted(3);
			rep(i, 3) perm_sorted[i] = perm[i];
			sort(perm_sorted.begin(), perm_sorted.end());
			if(perm_sorted[0] == v[0] and perm_sorted[1] == v[1] and perm_sorted[2] == v[2]) continue;
			if(G[perm[0]][perm[1]] == 1 and G[perm[1]][perm[2]] == 1 and G[perm[2]][perm[0]] == 1) ans = "Yes\n";
		}while(next_permutation(perm.begin(), perm.end()));
	}
	if(n >= 4){
		vector<int> perm(4);
		rep(i, 4) perm[i] = i;
		do{
			if(G[perm[0]][perm[1]] == 1 and G[perm[1]][perm[2]] == 1 and G[perm[2]][perm[3]] == 1 and G[perm[3]][perm[0]] == 1) ans = "Yes\n";
		}while(next_permutation(perm.begin(), perm.end()));
	}
	cout << ans;
	
	return 0;
}
0