結果
問題 | No.1023 Cyclic Tour |
ユーザー | ningenMe |
提出日時 | 2020-04-10 22:19:01 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 212 ms / 2,000 ms |
コード長 | 5,304 bytes |
コンパイル時間 | 2,425 ms |
コンパイル使用メモリ | 179,320 KB |
実行使用メモリ | 20,228 KB |
最終ジャッジ日時 | 2023-10-14 01:02:23 |
合計ジャッジ時間 | 12,612 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 1 ms
4,352 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 68 ms
4,852 KB |
testcase_05 | AC | 69 ms
4,848 KB |
testcase_06 | AC | 77 ms
4,988 KB |
testcase_07 | AC | 72 ms
4,900 KB |
testcase_08 | AC | 90 ms
12,932 KB |
testcase_09 | AC | 94 ms
13,688 KB |
testcase_10 | AC | 93 ms
13,616 KB |
testcase_11 | AC | 112 ms
13,828 KB |
testcase_12 | AC | 114 ms
15,312 KB |
testcase_13 | AC | 108 ms
14,416 KB |
testcase_14 | AC | 99 ms
14,448 KB |
testcase_15 | AC | 111 ms
14,296 KB |
testcase_16 | AC | 202 ms
17,828 KB |
testcase_17 | AC | 209 ms
18,052 KB |
testcase_18 | AC | 212 ms
17,316 KB |
testcase_19 | AC | 198 ms
17,156 KB |
testcase_20 | AC | 144 ms
12,704 KB |
testcase_21 | AC | 146 ms
13,160 KB |
testcase_22 | AC | 167 ms
13,960 KB |
testcase_23 | AC | 176 ms
14,196 KB |
testcase_24 | AC | 200 ms
15,932 KB |
testcase_25 | AC | 143 ms
13,072 KB |
testcase_26 | AC | 146 ms
13,224 KB |
testcase_27 | AC | 139 ms
12,336 KB |
testcase_28 | AC | 182 ms
15,700 KB |
testcase_29 | AC | 193 ms
16,132 KB |
testcase_30 | AC | 190 ms
16,060 KB |
testcase_31 | AC | 169 ms
15,352 KB |
testcase_32 | AC | 176 ms
16,500 KB |
testcase_33 | AC | 179 ms
16,268 KB |
testcase_34 | AC | 126 ms
5,532 KB |
testcase_35 | AC | 132 ms
5,692 KB |
testcase_36 | AC | 154 ms
13,048 KB |
testcase_37 | AC | 164 ms
15,452 KB |
testcase_38 | AC | 174 ms
15,884 KB |
testcase_39 | AC | 171 ms
14,048 KB |
testcase_40 | AC | 168 ms
14,832 KB |
testcase_41 | AC | 167 ms
14,640 KB |
testcase_42 | AC | 145 ms
11,836 KB |
testcase_43 | AC | 144 ms
13,472 KB |
testcase_44 | AC | 73 ms
11,028 KB |
testcase_45 | AC | 123 ms
19,860 KB |
testcase_46 | AC | 118 ms
20,228 KB |
testcase_47 | AC | 75 ms
11,152 KB |
testcase_48 | AC | 143 ms
13,460 KB |
testcase_49 | AC | 147 ms
13,448 KB |
testcase_50 | AC | 140 ms
13,168 KB |
testcase_51 | AC | 135 ms
11,256 KB |
testcase_52 | AC | 142 ms
11,800 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; #define ALL(obj) (obj).begin(),(obj).end() #define SPEED cin.tie(0);ios::sync_with_stdio(false); template<class T> using PQ = priority_queue<T>; template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>; constexpr long long MOD = (long long)1e9 + 7; constexpr long long MOD2 = 998244353; constexpr long long HIGHINF = (long long)1e18; constexpr long long LOWINF = (long long)1e15; constexpr long double PI = 3.1415926535897932384626433L; template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);} template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));} template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;} template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;} template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} void print(void) {cout << endl;} template <class Head> void print(Head&& head) {cout << head;print();} template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);} template <class T> void chmax(T& a, const T b){a=max(a,b);} template <class T> void chmin(T& a, const T b){a=min(a,b);} void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;} void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;} void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;} class StronglyConnectedComponents{ int nodeNum; vector<vector<int>> edge,revEdge; vector<int> label,visited,order; void dfs(int curr){ visited[curr] = 1; for(int next:edge[curr]) if(!visited[next]) dfs(next); order.push_back(curr); } void revDfs(int curr,int labelId){ visited[curr] = 1; label[curr] = labelId; for(int next:revEdge[curr]) if(!visited[next]) revDfs(next,labelId); } public: StronglyConnectedComponents(const int& nodeNum) : nodeNum(nodeNum), edge(nodeNum), revEdge(nodeNum), label(nodeNum), visited(nodeNum) { // do nothing } int operator[](int idx) { return label[idx]; } void makeEdge(const int from,const int to) { edge[from].push_back(to); revEdge[to].push_back(from); } void solve(void) { for(int i = 0; i < nodeNum; ++i) visited[i] = 0; for(int i = 0; i < nodeNum; ++i) if(!visited[i]) dfs(i); for(int i = 0; i < nodeNum; ++i) visited[i] = 0; reverse(order.begin(),order.end()); int labelId = 0; for(int i:order) if(!visited[i]) revDfs(i,labelId++); } void print(void) { for(auto labelId:label) cout << labelId << " "; cout << endl; } }; //Union Find Tree class UnionFindTree { public: vector<int> parent; vector<int> rank; UnionFindTree(int N) : parent(N), rank(N,0){ for (int i = 0; i < N; ++i) parent[i] = i; } int root(int n) { return (parent[n] == n ? n : parent[n] = root(parent[n])); } int same(int n, int m) { return root(n) == root(m); } void unite(int n, int m) { n = root(n); m = root(m); if (n == m) return; if(rank[n]<rank[m]) { parent[n] = m; } else{ parent[m] = n; if(rank[n] == rank[m]) rank[n]++; } } }; //verify https://atcoder.jp/contests/abc097/tasks/arc097_b int main() { int N,M; cin >> N >> M; vector<pair<int,int>> edge; vector<pair<int,int>> bedge; for(int i = 0; i < M; ++i) { int a,b; cin >> a >> b; a--,b--; int c; cin >> c; if(c==1){ bedge.push_back({a,b}); } else{ edge.push_back({a,b}); } } UnionFindTree uf(N); for(auto& e:bedge){ int a = e.first,b = e.second; corner(uf.same(a,b),"Yes"); uf.unite(a,b); } StronglyConnectedComponents scc(N); for(auto& e:edge){ int a = e.first,b = e.second; corner(uf.same(a,b),"Yes"); scc.makeEdge(uf.root(a),uf.root(b)); } scc.solve(); vector<int> cnt(N,0); for(int i = 0; i < N; ++i) cnt[scc[i]]++; for(int i = 0; i < N; ++i) corner(cnt[i] > 1,"Yes"); cout << "No" << endl; return 0; }