結果

問題 No.1023 Cyclic Tour
ユーザー haruki_Kharuki_K
提出日時 2020-04-10 22:05:17
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 114 ms / 2,000 ms
コード長 6,882 bytes
コンパイル時間 3,914 ms
コンパイル使用メモリ 183,436 KB
実行使用メモリ 29,216 KB
最終ジャッジ日時 2023-10-14 00:38:05
合計ジャッジ時間 11,333 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 2 ms
4,352 KB
testcase_04 AC 29 ms
6,564 KB
testcase_05 AC 29 ms
6,452 KB
testcase_06 AC 32 ms
6,852 KB
testcase_07 AC 30 ms
6,720 KB
testcase_08 AC 52 ms
18,912 KB
testcase_09 AC 60 ms
18,416 KB
testcase_10 AC 57 ms
18,700 KB
testcase_11 AC 65 ms
19,152 KB
testcase_12 AC 69 ms
22,108 KB
testcase_13 AC 67 ms
20,732 KB
testcase_14 AC 66 ms
20,736 KB
testcase_15 AC 70 ms
21,060 KB
testcase_16 AC 112 ms
24,232 KB
testcase_17 AC 112 ms
24,352 KB
testcase_18 AC 114 ms
23,484 KB
testcase_19 AC 113 ms
23,184 KB
testcase_20 AC 64 ms
15,204 KB
testcase_21 AC 65 ms
15,576 KB
testcase_22 AC 78 ms
16,992 KB
testcase_23 AC 84 ms
17,612 KB
testcase_24 AC 100 ms
22,116 KB
testcase_25 AC 63 ms
15,340 KB
testcase_26 AC 64 ms
15,072 KB
testcase_27 AC 61 ms
14,592 KB
testcase_28 AC 96 ms
20,952 KB
testcase_29 AC 101 ms
22,888 KB
testcase_30 AC 96 ms
20,948 KB
testcase_31 AC 87 ms
19,984 KB
testcase_32 AC 92 ms
20,812 KB
testcase_33 AC 91 ms
20,260 KB
testcase_34 AC 49 ms
8,792 KB
testcase_35 AC 53 ms
8,776 KB
testcase_36 AC 70 ms
16,068 KB
testcase_37 AC 83 ms
18,772 KB
testcase_38 AC 94 ms
21,196 KB
testcase_39 AC 82 ms
18,308 KB
testcase_40 AC 84 ms
18,676 KB
testcase_41 AC 84 ms
18,812 KB
testcase_42 AC 64 ms
15,252 KB
testcase_43 AC 76 ms
21,672 KB
testcase_44 AC 36 ms
13,184 KB
testcase_45 AC 78 ms
29,216 KB
testcase_46 AC 79 ms
29,108 KB
testcase_47 AC 35 ms
13,388 KB
testcase_48 AC 64 ms
15,948 KB
testcase_49 AC 64 ms
15,652 KB
testcase_50 AC 63 ms
15,544 KB
testcase_51 AC 60 ms
15,736 KB
testcase_52 AC 62 ms
15,516 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
// >>> union find
struct UnionFind {
    int n, sz; // id : 0...n-1
    vector<int> par;

    UnionFind(int n = 0) : n(n), sz(n), par(n,-1) { }
    int root(int x) {
        assert(0 <= x); assert(x < n);
        return par[x] < 0 ? x : par[x] = root(par[x]);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        sz--;
        if (par[x] < par[y]) swap(x,y);
        par[y] += par[x];
        par[x] = y;
        return true;
    }
    bool same(int x, int y) { return root(x) == root(y); }
    int size(int x) { return -par[root(x)]; }
    int size() const { return sz; }
    struct groups_t {
        vector<vector<int> > grp;
        vector<pair<int,int> > id;
    };
    groups_t groups() {
        vector<vector<int> > g(n);
        rep (i,n) if (par[i] < 0) g[i].reserve(-par[i]);
        rep (i,n) g[root(i)].push_back(i);
        vector<vector<int> > grp; grp.reserve(size());
        rep (i,n) if (g[i].size()) grp.emplace_back(move(g[i]));
        vector<pair<int,int> > id(n);
        rep (i,grp.size()) rep (j,grp[i].size()) {
            id[grp[i][j]] = make_pair(i,j);
        }
        return { grp, id };
    }
};
// <<<
// >>> scc

constexpr int dst(int v) { return v; }
template <class E, class = decltype(E().to)>
constexpr int dst(E const& e) { return e.to; }

template <class E> struct SCC {
    vector<vector<E> > const& g;
    vector<int32_t> ord, low, st;
    int32_t time = 0, pos = 0, sz = 0;
    SCC(vector<vector<E> > const& g) : g(g), ord(g.size()), low(g.size()), st(g.size()) {
        rep (v,g.size()) if (ord[v] == 0) dfs(v);
        for (auto &x : ord) x += sz;
    }
    void dfs(int v) {
        low[v] = ord[v] = ++time; st[pos++] = v;
        for (auto const& e : g[v]) {
            if (ord[dst(e)] == 0) {
                dfs(dst(e));
                chmin(low[v], low[dst(e)]);
            } else if (ord[dst(e)] > 0) {
                chmin(low[v], ord[dst(e)]);
            }
        }
        if (low[v] == ord[v]) {
            sz++; do ord[st[--pos]] = -sz; while (st[pos] != v);
        }
    }
    int size() const { return sz; }
    int id(int v) const { return ord[v]; }
    vector<vector<int> > groups() const {
        vector<vector<int> > grp(sz);
        rep (v,g.size()) grp[ord[v]].push_back(v);
        return grp;
    }
};
template <class E> auto get_scc(vector<vector<E> > const& g) { return SCC<E>(g); }

// <<<

int32_t main() {
    int n,m; cin >> n >> m;
    vector<int> a(m),b(m),c(m);
    rep (i,m) cin >> a[i] >> b[i] >> c[i], --a[i],--b[i];

    UnionFind uf(n);
    rep (i,m) if (c[i] == 1) {
        if (uf.same(a[i],b[i])) quit("Yes");
        uf.unite(a[i],b[i]);
    }

    auto grp = uf.groups();
    vector<vector<int>> g(uf.size());
    rep (i,m) if (c[i] == 2) {
        int x = grp.id[a[i]].fst;
        int y = grp.id[b[i]].fst;
        if (x == y) quit("Yes");
        g[x].eb(y);
    }
    auto scc = get_scc(g);
    cout << (scc.size() < sz(g) ? "Yes" : "No") << endl;
}
0