結果

問題 No.2780 The Bottle Imp
ユーザー akiaa11akiaa11
提出日時 2024-06-12 16:39:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 92 ms / 2,000 ms
コード長 4,223 bytes
コンパイル時間 5,261 ms
コンパイル使用メモリ 277,704 KB
実行使用メモリ 42,640 KB
最終ジャッジ日時 2024-06-12 16:39:15
合計ジャッジ時間 8,250 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 42 ms
13,476 KB
testcase_08 AC 42 ms
13,612 KB
testcase_09 AC 43 ms
13,484 KB
testcase_10 AC 43 ms
13,360 KB
testcase_11 AC 43 ms
13,488 KB
testcase_12 AC 92 ms
23,712 KB
testcase_13 AC 85 ms
23,576 KB
testcase_14 AC 17 ms
7,060 KB
testcase_15 AC 17 ms
7,068 KB
testcase_16 AC 17 ms
6,940 KB
testcase_17 AC 18 ms
7,060 KB
testcase_18 AC 17 ms
7,060 KB
testcase_19 AC 17 ms
7,064 KB
testcase_20 AC 17 ms
6,944 KB
testcase_21 AC 17 ms
6,948 KB
testcase_22 AC 14 ms
6,976 KB
testcase_23 AC 17 ms
7,116 KB
testcase_24 AC 33 ms
11,728 KB
testcase_25 AC 62 ms
17,916 KB
testcase_26 AC 25 ms
10,116 KB
testcase_27 AC 19 ms
8,680 KB
testcase_28 AC 19 ms
8,740 KB
testcase_29 AC 26 ms
14,040 KB
testcase_30 AC 22 ms
11,924 KB
testcase_31 AC 34 ms
14,636 KB
testcase_32 AC 11 ms
6,944 KB
testcase_33 AC 49 ms
31,448 KB
testcase_34 AC 74 ms
42,640 KB
testcase_35 AC 9 ms
6,940 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 2 ms
6,940 KB
testcase_38 AC 9 ms
6,944 KB
testcase_39 AC 32 ms
17,292 KB
testcase_40 AC 33 ms
17,256 KB
testcase_41 AC 33 ms
17,168 KB
testcase_42 AC 2 ms
6,940 KB
testcase_43 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() >> 2;
constexpr int inf=numeric_limits<int>::max() >> 1;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int main(){
	ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
	int n;cin>>n;
	scc_graph g(n);
	vector<veci> g2(n);
	rep(i, n){
		int k;cin>>k;
		rep(j, k){
			int b;cin>>b;
			g.add_edge(i, b - 1);
			g2[i].push_back(b - 1);
		}
	}
	auto r = g.scc();
	dsu t(n);
	rep(i, r.size())
		rep(j, 1, r[i].size())
			t.merge(r[i][j], r[i][j - 1]);
	vector<veci> g3(n), g4(n);
	rep(i, r.size() - 1){
		for(auto v : r[i]) for(auto nv : g2[v])
			if(!t.same(v, nv)){
				g3[t.leader(v)].push_back(t.leader(nv));
				g4[t.leader(nv)].push_back(t.leader(v));
			}
	}
	veci dist(n, -1);
	dist[t.leader(r.back()[0])] = 0;
	queue<int> q;
	q.push(t.leader(r.back()[0]));
	while(q.size()){
		auto v = q.front(); q.pop();
		for(auto nv : g4[v]) if(dist[nv] == -1){
			dist[nv] = dist[v] + 1;
			q.push(nv);
		}
	}
	int v = 0;
	veci used(n);
	auto dfs = [&](auto f, int v) -> void{
		int mx = -1, t;
		for(auto nv: g3[v]) if(chmax(mx, dist[nv])) t = nv;
		used[v] = 1;
		if(mx == -1) return;
		f(f, t);
	};
	dfs(dfs, t.leader(0));
	int u = 1;
	rep(i, n) u &= used[t.leader(i)];
	cout<<(u ? "Yes" : "No")<<endl;
}
0