結果

問題 No.2910 単体ホモロジー入門
ユーザー dadas
提出日時 2024-10-04 21:28:38
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 3,306 bytes
コンパイル時間 2,005 ms
コンパイル使用メモリ 202,072 KB
最終ジャッジ日時 2025-02-24 15:01:44
ジャッジサーバーID
（参考情報） 		judge4 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 47
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
void _main();
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	_main();
	return 0;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vl = std::vector<ll>;
using vii = std::vector<pair<int, int> >;
using vvl = std::vector<vl>;
using vll = std::vector<pair<ll , ll> >;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using vs = std::vector<std::string>;
using vvs = std::vector<vs>;
using vb = std::vector<bool>;
using vvb = std::vector<vb>;
using vc = std::vector<char>;
using vvc = std::vector<vc>;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using piil = std::pair<pair<int, int>, ll>;
using mii = std::map<int, int>;
using mll = std::map<ll, ll>;
using pql = std::priority_queue<ll>;
using pqi = std::priority_queue<int>;
using pqiil = std::priority_queue<pair<pair<int, int>, ll> >;
using pqii = std::priority_queue<pair<int, int> >;

#define pb push_back
#define ps push
#define eb emplace_back
#define is insert
#define er erase
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sf(i) sizeof(i)
#define endl "\n"
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, L, R) for(ll i = L;i<=R;i++)
#define pcis precision

template<typename T>
struct infinity {
	static constexpr T max=std::numeric_limits<T>::max();
	static constexpr T min=std::numeric_limits<T>::min();
	static constexpr T value=std::numeric_limits<T>::max()/2;
	static constexpr T mvalue=std::numeric_limits<T>::min()/2;
};
template<typename T>constexpr T INF=infinity<T>::value;
constexpr ll lINF=INF<ll>;
constexpr int iINF = INF<int>;
constexpr ld PI = 3.1415926535897932384626;

vl adj[5];
ll A;
ll B;
bool vst[5];
bool DFS(ll node, ll par) {
	vst[node] = true;
	for (auto i : adj[node]) {
		if (node == A && i == B)continue;
		if (node == B && i == A)continue;
		if (i==par)continue;
		if (vst[i])return true;
		if (DFS(i, node))return true;
	}
	return false;
}

void _main() {

	ll N, M;
	cin >>N >> M;
	for (ll i = 1; i<=M; i++) {
		ll a, b;
		cin >> a >> b;
		adj[a].pb(b);
		adj[b].pb(a);
	}

	set<ll> se;
	for (ll i = 1; i<=3; i++) {
		ll c;
		cin >> c;
		se.is(c);
	}
	if (se.size() >= 3) {
		A = *se.begin();
		B = *next(se.begin());
	}
	for (ll i = 1; i<=N; i++) {
		if (vst[i])continue;
		if (DFS(i,-1)) {
			cout << "Yes" << endl;
			return;
		}
	}

	memset(vst, 0 ,sf(vst));

	if (se.size() >= 3) {
		A = *next(se.begin());
		B = *next(next(se.begin()));
	}
	for (ll i = 1; i<=N; i++) {
		if (vst[i])continue;
		if (DFS(i,-1)) {
			cout << "Yes" << endl;
			return;
		}
	}

	memset(vst, 0 ,sf(vst));

	if (se.size() >= 3) {
		A = *se.begin();
		B = *next(next(se.begin()));
	}
	for (ll i = 1; i<=N; i++) {
		if (vst[i])continue;
		if (DFS(i,-1)) {
			cout << "Yes" << endl;
			return;
		}
	}

	cout << "No" << endl;
	return;













}
0