結果
問題 | No.1023 Cyclic Tour |
ユーザー | fiord |
提出日時 | 2020-04-12 01:57:15 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,940 bytes |
コンパイル時間 | 1,556 ms |
コンパイル使用メモリ | 125,644 KB |
実行使用メモリ | 15,812 KB |
最終ジャッジ日時 | 2023-10-21 06:08:50 |
合計ジャッジ時間 | 14,112 ms |
ジャッジサーバーID (参考情報) |
judge9 / judge10 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,056 KB |
testcase_01 | AC | 3 ms
6,056 KB |
testcase_02 | AC | 3 ms
6,056 KB |
testcase_03 | AC | 3 ms
6,004 KB |
testcase_04 | AC | 103 ms
9,456 KB |
testcase_05 | AC | 105 ms
9,436 KB |
testcase_06 | AC | 120 ms
9,712 KB |
testcase_07 | AC | 109 ms
9,584 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 108 ms
8,876 KB |
testcase_12 | AC | 100 ms
8,580 KB |
testcase_13 | AC | 93 ms
8,432 KB |
testcase_14 | WA | - |
testcase_15 | AC | 97 ms
8,480 KB |
testcase_16 | AC | 171 ms
9,220 KB |
testcase_17 | AC | 173 ms
9,176 KB |
testcase_18 | AC | 181 ms
9,100 KB |
testcase_19 | AC | 173 ms
9,048 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 199 ms
9,668 KB |
testcase_23 | WA | - |
testcase_24 | AC | 199 ms
9,428 KB |
testcase_25 | AC | 190 ms
9,740 KB |
testcase_26 | AC | 193 ms
9,848 KB |
testcase_27 | AC | 180 ms
9,764 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | AC | 188 ms
9,416 KB |
testcase_34 | AC | 181 ms
9,516 KB |
testcase_35 | AC | 194 ms
9,828 KB |
testcase_36 | WA | - |
testcase_37 | AC | 179 ms
9,712 KB |
testcase_38 | WA | - |
testcase_39 | AC | 200 ms
9,492 KB |
testcase_40 | AC | 181 ms
9,216 KB |
testcase_41 | WA | - |
testcase_42 | AC | 196 ms
9,844 KB |
testcase_43 | WA | - |
testcase_44 | AC | 115 ms
9,816 KB |
testcase_45 | AC | 107 ms
15,760 KB |
testcase_46 | AC | 106 ms
15,760 KB |
testcase_47 | AC | 114 ms
15,812 KB |
testcase_48 | WA | - |
testcase_49 | AC | 186 ms
9,876 KB |
testcase_50 | WA | - |
testcase_51 | AC | 183 ms
9,196 KB |
testcase_52 | AC | 187 ms
9,188 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 }; vint edge[100000]; int visit[100000]; bool dfs(int i, int p, int k) { visit[i] = true; for (int to : edge[i]) { if (to == p) continue; if (visit[to] == k) return true; if (visit[to] == 0 && dfs(to, i, k)) return 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); } } int k = 0; rep(i, n) { if (visit[i] == 0) { if (dfs(i, -1, ++k)) { cout << "Yes" << endl; return 0; } } } cout << "No" << endl; return 0; }