結果
問題 | No.1023 Cyclic Tour |
ユーザー | kcvlex |
提出日時 | 2020-04-10 23:01:54 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,844 bytes |
コンパイル時間 | 1,855 ms |
コンパイル使用メモリ | 139,168 KB |
実行使用メモリ | 26,572 KB |
最終ジャッジ日時 | 2023-10-14 04:10:19 |
合計ジャッジ時間 | 16,108 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | WA | - |
testcase_03 | AC | 1 ms
4,348 KB |
testcase_04 | AC | 137 ms
16,924 KB |
testcase_05 | AC | 131 ms
16,980 KB |
testcase_06 | AC | 151 ms
18,564 KB |
testcase_07 | AC | 140 ms
17,796 KB |
testcase_08 | AC | 117 ms
15,452 KB |
testcase_09 | AC | 113 ms
15,136 KB |
testcase_10 | AC | 111 ms
14,956 KB |
testcase_11 | AC | 136 ms
15,944 KB |
testcase_12 | AC | 121 ms
14,900 KB |
testcase_13 | AC | 113 ms
14,076 KB |
testcase_14 | WA | - |
testcase_15 | AC | 119 ms
14,604 KB |
testcase_16 | AC | 259 ms
22,868 KB |
testcase_17 | AC | 264 ms
23,316 KB |
testcase_18 | AC | 269 ms
23,584 KB |
testcase_19 | AC | 257 ms
22,860 KB |
testcase_20 | AC | 308 ms
25,772 KB |
testcase_21 | AC | 296 ms
26,036 KB |
testcase_22 | AC | 282 ms
24,692 KB |
testcase_23 | AC | 296 ms
24,988 KB |
testcase_24 | AC | 284 ms
24,440 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 279 ms
24,900 KB |
testcase_28 | AC | 277 ms
24,248 KB |
testcase_29 | AC | 265 ms
23,164 KB |
testcase_30 | AC | 272 ms
24,636 KB |
testcase_31 | AC | 261 ms
23,848 KB |
testcase_32 | AC | 266 ms
24,640 KB |
testcase_33 | WA | - |
testcase_34 | AC | 276 ms
24,376 KB |
testcase_35 | AC | 295 ms
25,908 KB |
testcase_36 | AC | 292 ms
25,292 KB |
testcase_37 | AC | 265 ms
24,708 KB |
testcase_38 | AC | 252 ms
23,096 KB |
testcase_39 | AC | 282 ms
24,376 KB |
testcase_40 | AC | 275 ms
24,380 KB |
testcase_41 | AC | 265 ms
24,384 KB |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | AC | 128 ms
19,360 KB |
testcase_46 | AC | 129 ms
19,380 KB |
testcase_47 | AC | 132 ms
20,988 KB |
testcase_48 | AC | 279 ms
26,524 KB |
testcase_49 | AC | 257 ms
25,208 KB |
testcase_50 | AC | 284 ms
26,572 KB |
testcase_51 | AC | 292 ms
26,352 KB |
testcase_52 | AC | 278 ms
26,552 KB |
ソースコード
#include <limits> #include <initializer_list> #include <utility> #include <bitset> #include <tuple> #include <type_traits> #include <functional> #include <string> #include <array> #include <deque> #include <list> #include <queue> #include <stack> #include <vector> #include <map> #include <set> #include <unordered_map> #include <unordered_set> #include <iterator> #include <algorithm> #include <complex> #include <random> #include <numeric> #include <iostream> #include <iomanip> #include <sstream> #include <regex> #include <cassert> #include <cstddef> #define endl codeforces #define ALL(v) std::begin(v), std::end(v) #define ALLR(v) std::rbegin(v), std::rend(v) using ll = std::int64_t; using ull = std::uint64_t; using pii = std::pair<int, int>; using tii = std::tuple<int, int, int>; using pll = std::pair<ll, ll>; using tll = std::tuple<ll, ll, ll>; template <typename T> using vec = std::vector<T>; template <typename T> using vvec = vec<vec<T>>; template <typename T> const T& var_min(const T &t) { return t; } template <typename T> const T& var_max(const T &t) { return t; } template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); } template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); } template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); } template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); } template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); } template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); } template <typename T> T make_v(T init) { return init; } template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); } template <typename T, std::size_t Head, std::size_t ...Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; }; template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; }; template <typename T, std::size_t ...Args> using mdarray = typename multi_dem_array<T, Args...>::type; namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; } namespace graph { using Node = ll; using Weight = ll; using Edge = std::pair<Node, Weight>; template <bool Directed> struct Graph : public vvec<Edge> { using vvec<Edge>::vvec; void add_edge(Node f, Node t, Weight w = 1) { (*this)[f].emplace_back(t, w); if (!Directed) (*this)[t].emplace_back(f, w); } Graph<Directed> build_inv() const { Graph<Directed> ret(this->size()); for (Node i = 0; i < this->size(); i++) { for (const Edge &e : (*this)[i]) { Node j; Weight w; std::tie(j, w) = e; if (!Directed && j < i) continue; ret.add_edge(j, i, w); } } return ret; } }; template <typename Iterator> class dst_iterator { Iterator ite; public: dst_iterator(Iterator ite) : ite(ite) { } bool operator ==(const dst_iterator<Iterator> &oth) const { return ite == oth.ite; } bool operator !=(const dst_iterator<Iterator> &oth) const { return !(*this == oth); } bool operator <(const dst_iterator<Iterator> &oth) const { return ite < oth.ite; } bool operator >(const dst_iterator<Iterator> &oth) const { return ite > oth.ite; } bool operator <=(const dst_iterator<Iterator> &oth) const { return ite <= oth.ite; } bool operator >=(const dst_iterator<Iterator> &oth) const { return ite >= oth.ite; } const Node& operator *() { return ite->first; } const Node& operator *() const { return ite->first; } dst_iterator operator ++() { ++ite; return ite; } }; class dst_iteration { using ite_type = vec<Edge>::const_iterator; const vec<Edge> &edges; public: dst_iteration(const vec<Edge> &edges) : edges(edges) { } auto begin() const { return dst_iterator<ite_type>(edges.cbegin()); } auto end() const { return dst_iterator<ite_type>(edges.cend()); } }; dst_iteration dst(const vec<Edge> &edges) { return dst_iteration(edges); } } struct Solver { ll n, m; graph::Graph<true> g; vec<ll> label; std::map<pll, ll> st; Solver(ll n, ll m) : n(n), m(m), g(n), label(n) { std::map<pll, ll> st; while (m--) { ll a, b, c; std::cin >> a >> b >> c; a--; b--; g.add_edge(a, b); if (c == 1) g.add_edge(b, a); if (a > b) std::swap(a, b); st[pll(a, b)]++; } } bool dfs(ll cur, ll pre, ll l) { label[cur] = l; for (ll nxt : graph::dst(g[cur])) if (nxt != pre) { if (label[nxt] == l) return true; if (label[nxt]) continue; if (dfs(nxt, cur, l)) return true; } label[cur] = -l; return false; } bool solve() { for (auto &&e : st) if (2 <= e.second) return true; for (ll i = 0; i < n; i++) if (!label[i]) { bool res = dfs(i, -1, i + 1); if (res) return true; } return false; } }; int main() { ll n, m; std::cin >> n >> m; Solver solver(n, m); std::cout << (solver.solve() ? "Yes" : "No") << '\n'; return 0; }