Submission #994630

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

//諸機能
#pragma region MACRO 
#define putans(x)  std::cerr << "[ answer ]: " ; cout << (x) << endl
#define dputans(x) std::cerr << "[ answer ]: "; cout << setprecision(40) << (double)(x) << endl
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define RREP(i,n,a) for(int i=(int)(n-1); i>= a; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,n,0)
#define all(a) begin((a)),end((a))
#define mp make_pair
#define exist(container, n) ((container).find((n)) != (container).end())
#define equals(a,b) (fabs((a)-(b)) < EPS)
#ifdef _DEBUG //ファイルからテストデータを読み込む
std::ifstream ifs("data.txt");
#define put ifs >>
#else //ジャッジシステムでいい感じにやる
#define put cin >>
#endif
#pragma endregion
//デバッグなどの支援
#pragma region CODING_SUPPORT
#ifdef _DEBUG
#define dbg(var0) { std::cerr << ( #var0 ) << "=" << ( var0 ) << endl; }
#define dbg2(var0, var1) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; dbg(var1); }
#define dbg3(var0, var1, var2) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; dbg2(var1, var2); }
#define dbgArray(a,n) {std::cerr << (#a) << "=";  rep(i,n){std::cerr <<(a[i])<<",";} cerr<<endl;} 
#else
#define dbg(var0) {}
#define dbg2(var0, var1) {}
#define dbg3(var0, var1, var2) {}
#define dbgArray(a,n) {}
#endif 
#pragma endregion 
//typedef（書き換える、書き足す可能性ある）
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii; typedef pair<string, string> pss; typedef pair<int, string>pis;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
#pragma endregion
//諸々の定数(書き換える可能性ある)
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-10)
#define MOD (ll)(1e9 + 7)
#define INF (1000000)
#pragma endregion


int main() {
	int n, m; put n >> m;
	set<int> l[500000];
	set<int> usedL[500000];
	rep(i, n) {
		int k; put k;
		rep(j, k) {
			int s; put s;
			l[s - 1].insert(i);
			usedL[i].insert(s - 1);
		}
	}
	bool linked[500000];
	bool connected[500000];
	queue<int> qL;
	fill(linked, linked + 500000, false);
	fill(connected, connected + 500000, false);
	connected[0] = true;

	for (auto ittr = l[0].begin(); ittr != l[0].end(); ittr++)
	{
		qL.push(*ittr);
	}
	while (!qL.empty()) {
		int linkL = qL.front();
		dbg(linkL);
		qL.pop();
		if (linked[linkL]) continue;
		for (auto k = usedL[linkL].begin(); k != usedL[linkL].end(); k++)
		{
			cout << *k << endl;
			if (!connected[*k]) {
				connected[*k] = true;
				for (auto ittr = usedL[*k].begin(); ittr != usedL[*k].end(); ittr++)
				{
					if (!linked[*k]) qL.push(*ittr);
				}
			}
		}
		linked[linkL] = true;
	}
	rep(i, n) {
		if (!connected[i]) {
			cout << "NO" << endl;
			goto END;
		}
	}
	cout << "YES" << endl;
END:	return 0;
}
//
//int n, a; put n >> a;
//if (n > 1000001) {
//	return 0;
//}
//ll dp[1000001];
//rep(i, 1000001) {
//	dp[i] = i;
//}
//
//REP(i, 1, n + 1) {
//	int base = dp[i];
//	int j = 1;
//	int useTime = a + j;
//	while (i*j < n + 1) {
//		dp[i*j] = min(dp[i*j], dp[i] + useTime);
//		j++;
//		useTime++;
//	}
//	int s = 0;
//}
//ll minT = n;
//REP(i, 1, n) {
//	minT = min(minT, dp[i] + a + 1 + n / i);
//}

Submission Info

Judge Result