結果

問題 No.1023 Cyclic Tour
ユーザー kcvlexkcvlex
提出日時 2020-04-10 23:33:56
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 635 ms / 2,000 ms
コード長 7,820 bytes
コンパイル時間 1,773 ms
コンパイル使用メモリ 153,876 KB
実行使用メモリ 41,200 KB
最終ジャッジ日時 2023-10-14 07:38:22
合計ジャッジ時間 23,498 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 1 ms
4,348 KB
testcase_03 AC 2 ms
4,348 KB
testcase_04 AC 170 ms
18,440 KB
testcase_05 AC 176 ms
18,708 KB
testcase_06 AC 199 ms
20,256 KB
testcase_07 AC 162 ms
19,112 KB
testcase_08 AC 241 ms
26,024 KB
testcase_09 AC 228 ms
25,448 KB
testcase_10 AC 227 ms
25,272 KB
testcase_11 AC 275 ms
26,852 KB
testcase_12 AC 311 ms
28,980 KB
testcase_13 AC 281 ms
27,496 KB
testcase_14 AC 252 ms
27,252 KB
testcase_15 AC 297 ms
28,144 KB
testcase_16 AC 558 ms
40,020 KB
testcase_17 AC 569 ms
40,600 KB
testcase_18 AC 635 ms
41,200 KB
testcase_19 AC 550 ms
39,344 KB
testcase_20 AC 388 ms
31,160 KB
testcase_21 AC 388 ms
31,724 KB
testcase_22 AC 450 ms
33,292 KB
testcase_23 AC 476 ms
35,476 KB
testcase_24 AC 603 ms
39,252 KB
testcase_25 AC 387 ms
31,448 KB
testcase_26 AC 377 ms
31,364 KB
testcase_27 AC 361 ms
29,800 KB
testcase_28 AC 539 ms
39,572 KB
testcase_29 AC 609 ms
39,156 KB
testcase_30 AC 560 ms
39,552 KB
testcase_31 AC 492 ms
35,472 KB
testcase_32 AC 543 ms
36,844 KB
testcase_33 AC 555 ms
37,896 KB
testcase_34 AC 381 ms
31,756 KB
testcase_35 AC 373 ms
31,820 KB
testcase_36 AC 420 ms
31,912 KB
testcase_37 AC 471 ms
34,652 KB
testcase_38 AC 521 ms
37,436 KB
testcase_39 AC 502 ms
36,052 KB
testcase_40 AC 499 ms
35,724 KB
testcase_41 AC 497 ms
35,108 KB
testcase_42 AC 395 ms
31,712 KB
testcase_43 AC 545 ms
37,832 KB
testcase_44 AC 184 ms
18,844 KB
testcase_45 AC 279 ms
36,676 KB
testcase_46 AC 274 ms
36,716 KB
testcase_47 AC 129 ms
18,820 KB
testcase_48 AC 309 ms
32,716 KB
testcase_49 AC 342 ms
31,516 KB
testcase_50 AC 318 ms
33,084 KB
testcase_51 AC 322 ms
32,624 KB
testcase_52 AC 315 ms
32,824 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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);
}

}

namespace tree {

struct UnionFind {
    vec<ll> rank, par;
    vec<ssize_t> sz;

    UnionFind(ll n) : rank(n), par(n), sz(n) {
        init();
    }

    void init() {
        std::fill(ALL(rank), 1);
        std::iota(ALL(par), 0);
        std::fill(ALL(sz), 1);
    }

    ll find(ll n) {
        return (n == par[n] ? n : par[n] = find(par[n]));
    }

    bool unit(ll x, ll y) {
        ll px = find(x), py = find(y);
        if (px == py) return false;
        if (rank[px] < rank[py]) std::swap(px, py);
        par[py] = px;
        rank[px] += (rank[px] == rank[py]);
        sz[px] += sz[py];
        return true;
    }

    bool same(ll x, ll y) {
        return find(x) == find(y);
    }

    ssize_t size(ll n) {
        return sz[find(n)];
    }
};

}

namespace graph {

template <typename Graph>
struct topological_sort {
    const Graph &g;
    ssize_t n;
    vec<Node> ret;
    vec<bool> pass, used;

    topological_sort(const Graph &g) : g(g), n(g.size()), pass(n), used(n)
    {
    }

    bool dfs(ll cur) {
        used[cur] = true;
        pass[cur] = true;
        for (auto &&nxt : dst(g[cur])) {
            if (pass[nxt]) return false;
            if (used[nxt]) continue;
            if (!dfs(nxt)) return false;
        }
        ret.push_back(cur);
        pass[cur] = false;
        return true;
    }

    vec<Node> solve() {
        for (Node i = 0; i < n; i++) {
            if (used[i]) continue;
            if (!dfs(i)) {
                ret.clear();
                break;
            }
        }
        std::reverse(ALL(ret));
        return ret;
    }
};

template <typename Graph>
vec<Node> topsort(const Graph &g) {
    return topological_sort<Graph>(g).solve();
}

}

struct Solver {
    ll n, m;
    graph::Graph<true> g, gg;
    std::map<pll, ll> st;
    vec<bool> used, pass;
    tree::UnionFind uf;
    bool ans = false;

    Solver(ll n, ll m) : n(n), m(m), gg(n), used(n), pass(n), uf(n) {
        vec<pll> edges;
        while (m--) {
            ll a, b, c;
            std::cin >> a >> b >> c;
            a--; b--;
            gg.add_edge(a, b);
            if (c == 1) {
                gg.add_edge(b, a);
                if (!uf.unit(a, b)) ans = true;
            } else {
                edges.emplace_back(a, b);
            }
            if (a > b) std::swap(a, b);
            st[pll(a, b)]++;
        }
        std::map<ll, ll> id;
        for (ll i = 0; i < n; i++) {
            ll p = uf.find(i);
            if (i == p) {
                ll tmp = id.size();
                id[p] = tmp;
            }
        }
        g.resize(id.size());
        for (auto &&e : edges) {
            ll f, t;
            std::tie(f, t) = e;
            f = id[uf.find(f)];
            t = id[uf.find(t)];
            g.add_edge(f, t);
        }
    }

    bool solve() {
        if (ans) return true;
        for (auto &&e : st) if (2 <= e.second) return true;
        auto tp = graph::topsort(g);
        return tp.empty();
    }
};

int main() {
    ll n, m;
    std::cin >> n >> m;
    Solver solver(n, m);
    std::cout << (solver.solve() ? "Yes" : "No") << '\n';
    return 0;
}
0