結果
問題 | No.1023 Cyclic Tour |
ユーザー | fiord |
提出日時 | 2020-04-12 02:10:16 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,232 bytes |
コンパイル時間 | 1,302 ms |
コンパイル使用メモリ | 132,596 KB |
実行使用メモリ | 30,344 KB |
最終ジャッジ日時 | 2023-10-21 06:34:58 |
合計ジャッジ時間 | 29,397 ms |
ジャッジサーバーID (参考情報) |
judge10 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
5,976 KB |
testcase_01 | AC | 4 ms
5,976 KB |
testcase_02 | AC | 4 ms
5,972 KB |
testcase_03 | AC | 4 ms
5,912 KB |
testcase_04 | AC | 290 ms
18,212 KB |
testcase_05 | AC | 298 ms
18,236 KB |
testcase_06 | AC | 339 ms
19,724 KB |
testcase_07 | AC | 309 ms
18,888 KB |
testcase_08 | AC | 278 ms
17,736 KB |
testcase_09 | AC | 274 ms
17,476 KB |
testcase_10 | AC | 271 ms
17,216 KB |
testcase_11 | AC | 309 ms
18,280 KB |
testcase_12 | AC | 283 ms
17,532 KB |
testcase_13 | AC | 265 ms
16,828 KB |
testcase_14 | AC | 251 ms
16,868 KB |
testcase_15 | AC | 273 ms
17,356 KB |
testcase_16 | AC | 573 ms
26,288 KB |
testcase_17 | AC | 584 ms
26,656 KB |
testcase_18 | AC | 605 ms
27,232 KB |
testcase_19 | AC | 578 ms
26,304 KB |
testcase_20 | AC | 645 ms
27,580 KB |
testcase_21 | AC | 649 ms
27,780 KB |
testcase_22 | AC | 627 ms
27,008 KB |
testcase_23 | AC | 639 ms
27,712 KB |
testcase_24 | AC | 653 ms
27,900 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 627 ms
27,800 KB |
testcase_28 | AC | 650 ms
27,464 KB |
testcase_29 | AC | 595 ms
26,668 KB |
testcase_30 | AC | 640 ms
28,000 KB |
testcase_31 | AC | 584 ms
27,248 KB |
testcase_32 | AC | 615 ms
30,344 KB |
testcase_33 | WA | - |
testcase_34 | AC | 621 ms
26,868 KB |
testcase_35 | AC | 655 ms
27,844 KB |
testcase_36 | AC | 649 ms
27,404 KB |
testcase_37 | AC | 604 ms
29,104 KB |
testcase_38 | AC | 589 ms
27,484 KB |
testcase_39 | AC | 642 ms
27,300 KB |
testcase_40 | AC | 631 ms
27,260 KB |
testcase_41 | AC | 607 ms
27,248 KB |
testcase_42 | WA | - |
testcase_43 | AC | 573 ms
26,120 KB |
testcase_44 | WA | - |
testcase_45 | AC | 256 ms
27,972 KB |
testcase_46 | AC | 255 ms
27,880 KB |
testcase_47 | AC | 268 ms
28,032 KB |
testcase_48 | AC | 612 ms
28,040 KB |
testcase_49 | AC | 605 ms
28,264 KB |
testcase_50 | AC | 604 ms
28,128 KB |
testcase_51 | AC | 615 ms
28,040 KB |
testcase_52 | AC | 619 ms
28,120 KB |
ソースコード
#define _CRT_SECURE_NO_WARNINGS #define _USE_MATH_DEFINES #include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <cassert> #include <string> #include <vector> #include <utility> #include <complex> #include <set> #include <map> #include <unordered_map> #include <queue> #include <stack> #include <deque> #include <tuple> #include <bitset> #include <limits> #include <algorithm> #include <array> #include <random> #include <complex> #include <regex> using namespace std; typedef long double ld; typedef long long ll; typedef vector<int> vint; typedef vector<ll> vll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef complex<ld> compd; #define quickIO() {cin.tie(0); cout.sync_with_stdio(false);} #define reach(i,a) for(auto i:a) #define rep(i,n) for(int i=0;i<((int)n);i++) #define REP(i,n) for(int i=0;i<=((int)n);i++) #define srep(i,a,n) for(int i=a;i<((int)n);i++) #define SREP(i,a,n) for(int i=a;i<=((int)n);i++) #define rrep(i,n) for(int i=n-1;i>=0;i--) #define RREP(i,n) for(int i=n;i>=0;i--) #define all(a) (a).begin(),(a).end() #define mp(a,b) make_pair(a,b) #define mt make_tuple #define pb push_back template<typename T> istream& operator >> (istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; } template<typename T> ostream& operator << (ostream& os, vector<T>& vec) { os << "["; rep(i, vec.size()) os << (i ? ", " : "") << vec[i]; os << "]"; return os; } template<typename T> istream& operator >> (istream& is, pair<T, T>& p) { is >> p.first >> p.second; return is; } template<typename T> ostream& operator << (ostream& os, pair<T, T>& p) { os << p.first << " " << p.second; return os; } template<typename T> bool operator < (vector<T>& a, vector<T>& b) { rep(i, a.size()) { if (i == b.size()) return false; if (a[i] < b[i]) return true; else if (a[i] > b[i]) return false; } return false; } template<typename T> bool operator > (vector<T>& a, vector<T>& b) { rep(i, a.size()) { if (i == b.size()) return true; if (a[i] < b[i]) return false; else if (a[i] > b[i]) return true; } return false; } int bitcnt(ll x) { x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555); x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333); x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F); x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF); x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF); x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF); return x; } int bitcnt(int x) { x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555); x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333); x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F); x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF); x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF); return x; } ll sqrtll(ll x) { ll left = 0, right = x; rep(i, 100) { ll mid = (left + right) >> 1; if (mid * mid <= x) left = mid; else right = mid; } return left; } ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); } #define debug(x) printf("Case #%d: ", x) #undef DEBUG const ld infl = 1e100; const ll mod = 998244353; const ld eps = 1e-9; const ll inf = 1e15; const int dx[] = { 1,0,-1,0,1, -1 }; const int dy[] = { 0,1,0,-1,1, -1 }; set<pii> edge_set; set<pii> can_ignore; vint edge[100000]; bool found[100000]; bool visit[100000]; bool dfs(int i, int p) { found[i] = true; for (int to : edge[i]) { if (to == p) continue; if (found[to] && !visit[to]) return true; int parent = (can_ignore.count(mp(i, to)) ? -1 : i); if (!found[to] && dfs(to, parent)) return true; } visit[i] = true; return false; } int main() { int n, m; cin >> n >> m; rep(i, m) { int a, b, c; cin >> a >> b >> c; a--; b--; if (c == 1) { edge[a].push_back(b); edge[b].push_back(a); } else if (c == 2) { edge[a].push_back(b); } if (edge_set.count(mp(a, b))) { can_ignore.insert(mp(a, b)); can_ignore.insert(mp(b, a)); } else { edge_set.insert(mp(a, b)); edge_set.insert(mp(b, a)); } } rep(i, n) { if (visit[i] == 0) { if (dfs(i, -1)) { cout << "Yes" << endl; return 0; } } } cout << "No" << endl; return 0; }