結果
問題 | No.1023 Cyclic Tour |
ユーザー | suta28407928 |
提出日時 | 2020-04-12 02:17:37 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 203 ms / 2,000 ms |
コード長 | 2,785 bytes |
コンパイル時間 | 1,303 ms |
コンパイル使用メモリ | 106,836 KB |
実行使用メモリ | 15,896 KB |
最終ジャッジ日時 | 2023-10-21 06:44:56 |
合計ジャッジ時間 | 11,550 ms |
ジャッジサーバーID (参考情報) |
judge10 / judge9 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,348 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 90 ms
7,516 KB |
testcase_05 | AC | 90 ms
7,528 KB |
testcase_06 | AC | 94 ms
7,636 KB |
testcase_07 | AC | 93 ms
7,564 KB |
testcase_08 | AC | 110 ms
12,232 KB |
testcase_09 | AC | 107 ms
11,876 KB |
testcase_10 | AC | 106 ms
11,904 KB |
testcase_11 | AC | 115 ms
12,544 KB |
testcase_12 | AC | 116 ms
13,176 KB |
testcase_13 | AC | 107 ms
12,504 KB |
testcase_14 | AC | 109 ms
12,480 KB |
testcase_15 | AC | 113 ms
12,780 KB |
testcase_16 | AC | 188 ms
15,872 KB |
testcase_17 | AC | 192 ms
15,896 KB |
testcase_18 | AC | 192 ms
15,464 KB |
testcase_19 | AC | 186 ms
15,224 KB |
testcase_20 | AC | 178 ms
13,448 KB |
testcase_21 | AC | 177 ms
13,816 KB |
testcase_22 | AC | 183 ms
14,212 KB |
testcase_23 | AC | 189 ms
15,248 KB |
testcase_24 | AC | 202 ms
15,824 KB |
testcase_25 | AC | 175 ms
13,652 KB |
testcase_26 | AC | 177 ms
13,508 KB |
testcase_27 | AC | 168 ms
13,080 KB |
testcase_28 | AC | 196 ms
15,384 KB |
testcase_29 | AC | 198 ms
15,176 KB |
testcase_30 | AC | 203 ms
15,684 KB |
testcase_31 | AC | 186 ms
15,288 KB |
testcase_32 | AC | 182 ms
14,984 KB |
testcase_33 | AC | 198 ms
15,524 KB |
testcase_34 | AC | 65 ms
6,840 KB |
testcase_35 | AC | 151 ms
8,924 KB |
testcase_36 | AC | 182 ms
13,896 KB |
testcase_37 | AC | 179 ms
15,044 KB |
testcase_38 | AC | 185 ms
14,808 KB |
testcase_39 | AC | 186 ms
15,016 KB |
testcase_40 | AC | 188 ms
14,916 KB |
testcase_41 | AC | 187 ms
14,936 KB |
testcase_42 | AC | 179 ms
13,692 KB |
testcase_43 | AC | 190 ms
14,940 KB |
testcase_44 | AC | 97 ms
10,740 KB |
testcase_45 | AC | 113 ms
14,232 KB |
testcase_46 | AC | 105 ms
14,232 KB |
testcase_47 | AC | 98 ms
11,064 KB |
testcase_48 | AC | 174 ms
14,360 KB |
testcase_49 | AC | 175 ms
14,540 KB |
testcase_50 | AC | 172 ms
14,584 KB |
testcase_51 | AC | 173 ms
14,540 KB |
testcase_52 | AC | 179 ms
14,340 KB |
ソースコード
#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; vector<vpl> edges(2); UnionFind uf(n); rep(i,m){ ll a,b,c; cin >> a >> b >> c; a--; b--; c--; edges[c].emplace_back(a,b); if(!c){ if(uf.same(a,b)){ puts("Yes"); return 0; } uf.unite(a,b); } } vl visit(n,false); vvl g(n); vl indeg(n,0); for(auto i : edges[1]){ ll a = uf.find(i.first); ll b = uf.find(i.second); 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"); }