結果

問題 No.2780 The Bottle Imp
コンテスト
ユーザー MMRZ
提出日時 2024-06-07 23:17:45
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,530 bytes
コンパイル時間 4,754 ms
コンパイル使用メモリ 270,172 KB
実行使用メモリ 44,624 KB
最終ジャッジ日時 2024-12-27 14:33:26
合計ジャッジ時間 6,551 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 36 WA * 4
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "cp_templates/template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 1 "cp_templates/data_structure/union_find.hpp"

struct union_find {
	vector<int> v;

	union_find(size_t size) : v(size, -1) {}

	int root(int x){
		return (v[x] < 0 ? x : v[x] = root(v[x]));
	}

	bool is_root(int x){
		return root(x) == x;
	}

	void unite(int x, int y){
		x = root(x);
		y = root(y);
		if(x != y){
			if(v[x] > v[y])swap(x, y);
			v[x] += v[y];
			v[y] = x;
		}
	}

	bool is_same(int x,int y){
		return root(x) == root(y);
	}

	int get_size(int x){
		x = root(x);
		return -v[x];
	}
};
#line 3 "2780.cpp"
using namespace mmrz;

void SOLVE(){
	int n;
	cin >> n;
	vector<vector<int>> g(n), rg(n);
	rep(i, n){
		int a;
		cin >> a;
		rep(j, a){
			int b;
			cin >> b;
			b--;
			g[i].pb(b);
			rg[b].pb(i);
		}
	}
	
	vector<bool> used(n);
	vector<int> cmp(n);
	vector<int> vs;

	auto dfs = [&](auto f, int v) -> void {
		used[v] = true;
		rep(i, len(g[v])){
			if(not used[g[v][i]])f(f, g[v][i]);
		}
		vs.pb(v);
	};

	auto rdfs = [&](auto f, int v, int k) -> void {
		used[v] = true;
		cmp[v] = k;
		rep(i, len(rg[v])){
			if(not used[rg[v][i]])f(f, rg[v][i], k);
		}
	};

	rep(i, n){
		if(not used[i])dfs(dfs, i);
	}
	rep(i, n)used[i] = false;

	int k = 0;
	for(int i = len(vs)-1;i >= 0;i--){
		if(not used[vs[i]])rdfs(rdfs, vs[i], k++);
	}
	vector<set<int>> g_st(k), rg_st(k);
	rep(i, n){
		for(auto to : g[i])if(cmp[i] != cmp[to])g_st[cmp[i]].insert(cmp[to]);
		for(auto to : g[i])if(cmp[i] != cmp[to])rg_st[cmp[to]].insert(cmp[i]);
	}
	vector<int> indeg(k), outdeg(k);
	union_find uf(k);
	rep(i, k){
		for(auto to : g_st[i]){
			indeg[to]++;
			outdeg[i]++;
			uf.unite(i, to);
		}
	}
	int st = 0;
	rep(i, k){
		if(indeg[i] == 0)st = i;
	}
	
	vector<int> dis(k, hinf<int>());
	dis[st] = 0;
	queue<int> q;
	q.push(st);
	while(not q.empty()){
		int p = q.front();
		q.pop();
		for(auto to : g_st[p]){
			if(dis[to] != hinf<int>())continue;
			dis[to] = dis[p]+1;
			q.push(to);
			break;
		}
	}
	vector<bool> vis(n, false);
	int cur = max_element(all(dis))-dis.begin();
	vis[cur] = true;
	if(dis[cur] == hinf<int>()){
		cout << "No" << endl;
		return;
	}
	q.push(cur);
	while(not q.empty()){
		int p = q.front();
		cerr << dis[p] << endl;
		q.pop();
		int mx = -1, mi = -1;
		for(auto to : rg_st[p]){
			if(chmax(mx, dis[to])){
				mi = to;
			}
		}
		if(mi == -1)break;
		vis[mi] = true;
		q.push(mi);
	}
	rep(i, k){
		if(not vis[i]){
			cout << "No" << endl;
			return;
		}
	}
	cout << "Yes" << endl;
	
}

void mmrz::solve(){
	int t = 1;
	//cin >> t;
	while(t--)SOLVE();
}
0