Submission #992515

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<vector>
#include<array>
#include<string>
#include<stack>
#include<queue>
#include<algorithm>
#include<cassert>
#include<functional>
#include<random>
#include<complex>
#include<bitset>
#include<chrono>
//#include<boost/multiprecision/cpp_int.hpp>
#define int int64_t
#define uint uint64_t
#define REP(i, a, b) for (int64_t i = (int64_t)(a); i < (int64_t)(b); i++)
#define rep(i, a) REP(i, 0, a)
#define EACH(i, a) for (auto i: a)
#define ITR(x, a) for (auto x = a.begin(); x != a.end(); x++)
#define ALL(a) (a.begin()), (a.end())
#define HAS(a, x) (a.find(x) != a.end())
#define Min(x) *min_element(ALL(x))
#define Max(x) *max_element(ALL(x))
#define Unique(L) (L.erase(unique(ALL(L)), L.end()))
#define veccat(v1, v2) std::copy((v2).begin(),(v2).end(),std::back_inserter(v1)/*v1の後ろにv2を入れる*/)
#define intmax (std::numeric_limits<int64_t>::max() / 4)
using namespace std;
//typedef boost::multiprecision::cpp_int bigint;
const double EPS = 1e-9;
const double PI = acos(-1.0);



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, M;
	cin >> N >> M;
	vector<unordered_set<int>>lang_graph(M);
	vector<int>speaker_num(M);
	rep(i, N) {
		int K,x;
		cin >> K;
		vector<int>lang_list(K);
		rep(j, K)cin >> lang_list[j];
		rep(j, K)lang_list[j]--;//0-origin
		rep(j, K)speaker_num[lang_list[j]]++;
		rep(j, K)REP(x, j + 1, K) {
			//lang_list[j]とlang_list[x]を話せる人がいるので辺を引く
			lang_graph[lang_list[j]].insert(lang_list[x]);
			lang_graph[lang_list[x]].insert(lang_list[j]);
		}
	}

	//通訳を2人以上挟んでもいいと解釈して解く
	vector<int>searched(M);
	stack<int>dfs;
	rep(i, M)if (speaker_num[i]) { dfs.push(i); break; }
	while (!dfs.empty()) {
		auto x = dfs.top(); dfs.pop();
		if (searched[x])continue;
		searched[x] = 1;
		for (auto y : lang_graph[x]) {
			dfs.push(y);
		}
	}
	rep(i, M)if (searched[i] == 0 && speaker_num[i]) {
		cout << "NO" << endl;
		return 0;
	}

	cout << "YES" << endl;



}

Submission Info

Judge Result