結果
問題 |
No.1023 Cyclic Tour
|
ユーザー |
![]() |
提出日時 | 2020-04-12 00:03:37 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 301 ms / 2,000 ms |
コード長 | 3,218 bytes |
コンパイル時間 | 1,354 ms |
コンパイル使用メモリ | 117,896 KB |
実行使用メモリ | 31,432 KB |
最終ジャッジ日時 | 2024-09-19 17:40:56 |
合計ジャッジ時間 | 14,010 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 49 |
ソースコード
#include <iostream> #include <string> #include <cstdlib> #include <cmath> #include <vector> #include <map> #include <set> #include <algorithm> #include <queue> #include <stack> #include <functional> #include <bitset> #include <assert.h> using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<char> vc; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<double> vd; typedef pair<ll,ll> P; typedef vector<P> vpl; typedef tuple<ll,ll,ll> tapu; #define rep(i,n) for(ll i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = 1<<30; const ll linf = 1LL<<62; const int MAX = 510000; ll dy[8] = {0,1,0,-1,1,-1,1,-1}; ll dx[8] = {1,0,-1,0,1,-1,-1,1}; const double pi = acos(-1); const double eps = 1e-7; template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){ if(a<b){ a = b; return true; } else return false; } template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << endl;} template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << endl; } const int mod = 1e9 + 7; //const int mod = 998244353; struct UnionFind{ vl p; vl rank; vl cnt; UnionFind(ll n){ rank.resize(n,0); p.resize(n,0); cnt.resize(n,0); rep(i,n){ p[i] = i; rank[i] = 0; cnt[i] = 1; } } ll find(ll x){ if(x != p[x]) p[x] = find(p[x]); return p[x]; } bool same(ll x, ll y){ return find(x) == find(y); } void unite(ll x, ll y){ x = find(x); y = find(y); if(x == y) return; if(rank[x] > rank[y]){ p[y] = x; cnt[x] += cnt[y]; }else{ p[x] = y; cnt[y] += cnt[x]; if(rank[x] == rank[y]) rank[y]++; } } ll size(ll x){ return cnt[find(x)]; } }; int main(){ ll n,m; cin >> n >> m; vvl G(n); vector<vpl> edges(2); rep(i,m){ ll a,b,c; cin >> a >> b >> c; a--; b--; c--; edges[c].emplace_back(a,b); if(!c){ G[a].push_back(b); G[b].push_back(a); } } vl visit(n,false); rep(i,n){ if(G[i].empty() || visit[i]) continue; visit[i] = true; queue<P> q; q.emplace(i,-1); while(!q.empty()){ P p = q.front(); q.pop(); ll u = p.first; ll par = p.second; for(auto v : G[u]){ if(v == par) continue; if(visit[v]){ puts("Yes"); return 0; } visit[v] = true; q.emplace(v,u); } } } vvl g(n); vl indeg(n,0); UnionFind uf(n); map<P,ll> mp; for(auto i : edges[0]) uf.unite(i.first,i.second); for(auto i : edges[1]){ ll a = uf.find(i.first); ll b = uf.find(i.second); if(mp[P(a,b)] > 0) continue; g[a].push_back(b); indeg[b]++; } rep(i,n) visit[i] = false; rep(i,n){ if(g[i].empty() || visit[i] || indeg[i]) continue; visit[i] = true; queue<ll> q; q.push(i); while(!q.empty()){ ll u = q.front(); q.pop(); for(auto v : g[u]){ indeg[v]--; if(!indeg[v] && !visit[v]){ visit[v] = true; q.push(v); } } } } rep(i,n){ if(indeg[i]){ puts("Yes"); return 0; } } puts("No"); }