結果

問題 No.1023 Cyclic Tour
ユーザー PachicobuePachicobue
提出日時 2020-05-23 19:30:41
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 148 ms / 2,000 ms
コード長 10,394 bytes
コンパイル時間 2,540 ms
コンパイル使用メモリ 217,440 KB
実行使用メモリ 26,220 KB
最終ジャッジ日時 2024-10-08 20:21:25
合計ジャッジ時間 9,623 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 33 ms
5,888 KB
testcase_05 AC 32 ms
5,888 KB
testcase_06 AC 34 ms
6,016 KB
testcase_07 AC 34 ms
5,888 KB
testcase_08 AC 64 ms
15,616 KB
testcase_09 AC 64 ms
15,488 KB
testcase_10 AC 62 ms
15,104 KB
testcase_11 AC 78 ms
17,668 KB
testcase_12 AC 84 ms
18,944 KB
testcase_13 AC 77 ms
17,944 KB
testcase_14 AC 69 ms
16,640 KB
testcase_15 AC 84 ms
18,524 KB
testcase_16 AC 143 ms
24,872 KB
testcase_17 AC 146 ms
25,088 KB
testcase_18 AC 148 ms
25,344 KB
testcase_19 AC 141 ms
24,448 KB
testcase_20 AC 83 ms
20,592 KB
testcase_21 AC 82 ms
21,348 KB
testcase_22 AC 116 ms
22,456 KB
testcase_23 AC 125 ms
23,428 KB
testcase_24 AC 147 ms
26,220 KB
testcase_25 AC 78 ms
19,328 KB
testcase_26 AC 76 ms
19,200 KB
testcase_27 AC 72 ms
17,220 KB
testcase_28 AC 139 ms
24,704 KB
testcase_29 AC 137 ms
24,576 KB
testcase_30 AC 141 ms
24,064 KB
testcase_31 AC 132 ms
22,272 KB
testcase_32 AC 137 ms
23,808 KB
testcase_33 AC 142 ms
23,680 KB
testcase_34 AC 26 ms
6,784 KB
testcase_35 AC 55 ms
7,040 KB
testcase_36 AC 96 ms
21,696 KB
testcase_37 AC 110 ms
21,888 KB
testcase_38 AC 122 ms
23,296 KB
testcase_39 AC 125 ms
23,176 KB
testcase_40 AC 117 ms
21,888 KB
testcase_41 AC 119 ms
22,144 KB
testcase_42 AC 79 ms
19,072 KB
testcase_43 AC 135 ms
24,180 KB
testcase_44 AC 39 ms
11,136 KB
testcase_45 AC 91 ms
23,640 KB
testcase_46 AC 89 ms
21,888 KB
testcase_47 AC 41 ms
13,056 KB
testcase_48 AC 83 ms
19,128 KB
testcase_49 AC 81 ms
19,112 KB
testcase_50 AC 77 ms
19,080 KB
testcase_51 AC 78 ms
18,144 KB
testcase_52 AC 76 ms
18,096 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// created [2020/05/23] 19:14:32
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T>
using max_heap = std::priority_queue<T>;
template<typename T>
using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T>
T in(const T offset) { return in<T>() - offset; }
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T offset) { return in<T>(offset); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs, const T offset)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs, offset); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs, const T offset) { return in_v<T, Uint, n, 0>(szs, offset); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
template<typename... Types>
auto in_t(Types... offsets) { return std::tuple<std::decay_t<Types>...>{in<Types>(offsets)...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
    void clear()
    {
        std::cin.tie(), std::ios::sync_with_stdio(true);
    }
} io_setting;

int out() { return 0; }
template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    return 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
int outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }


template<typename Cost = usize>
struct edge
{
    using cost_type = Cost;
    usize u, v;
    Cost c;
    edge(const usize u, const usize v) : u{u}, v{v}, c{1} {}
    edge(const usize u, const usize v, const Cost& c) : u{u}, v{v}, c{c} {}
    operator usize() const { return v; }
    usize from() const { return u; }
    usize to() const { return v; }
    Cost cost() const { return c; }
    friend std::ostream& operator<<(std::ostream& os, const edge& e) { return os << e.u << "->" << e.v << ":" << e.c; }
};
template<typename Edge>
class base_graph
{
public:
    base_graph(const usize n) : v{n}, es(n), res(n) {}
    void add_edge(const usize u, const usize v, const bool bi = false)
    {
        es[u].emplace_back(u, v), res[v].emplace_back(v, u);
        if (bi) { es[v].emplace_back(v, u), res[u].emplace_back(u, v); }
    }
    template<typename Cost>
    void add_edge(const usize u, const usize v, const Cost& c, const bool bi = false)
    {
        es[u].emplace_back(u, v, c), res[v].emplace_back(v, u, c);
        if (bi) { es[v].emplace_back(v, u, c), res[u].emplace_back(u, v, c); }
    }
    std::vector<Edge>& operator[](const usize u) { return es[u]; }
    const std::vector<Edge>& operator[](const usize u) const { return es[u]; }
    std::vector<Edge>& from(const usize u) { return es[u]; }
    const std::vector<Edge>& from(const usize u) const { return es[u]; }
    std::vector<Edge>& to(const usize v) { return res[v]; }
    const std::vector<Edge>& to(const usize v) const { return res[v]; }
    usize size() const { return v; }
    friend std::ostream& operator<<(std::ostream& os, const base_graph& g)
    {
        for (usize i = 0; i < g.v; i++) {
            for (const auto& e : g.es[i]) { os << e << '\n'; }
        }
        return os;
    }

private:
    usize v;
    std::vector<std::vector<Edge>> es, res;
};
template<typename Edge>
using base_tree = base_graph<Edge>;
using graph     = base_graph<edge<>>;
using tree      = base_graph<edge<>>;
template<typename Cost>
using cost_graph = base_graph<edge<Cost>>;
template<typename Cost>
using cost_tree = base_graph<edge<Cost>>;
template<typename Edge>
std::pair<bool, std::vector<usize>> top_sort(const base_graph<Edge>& g)
{
    const usize v = g.size();
    std::vector<usize> srt, used(v, 0);
    auto dfs = [&](auto&& self, const usize s) -> bool {
        if (used[s] == 1) {
            return false;
        } else if (used[s] == 0) {
            used[s] = 1;
            for (const auto& e : g[s]) {
                const usize to = e.to();
                if (not self(self, to)) { return false; }
            }
            used[s] = 2, srt.push_back(s);
        }
        return true;
    };
    for (usize i = 0; i < v; i++) {
        if (not dfs(dfs, i)) { return {false, srt}; }
    }
    std::reverse(srt.begin(), srt.end());
    return {true, srt};
}

class unionfind
{
public:
    unionfind(const usize sz) : sz{sz}, rt(sz), comp_sz(sz, 1) { std::iota(rt.begin(), rt.end(), 0); }
    usize root_of(const usize a) { return assert(a < sz), rt[a] == a ? a : rt[a] = root_of(rt[a]); }
    bool unite(usize a, usize b)
    {
        assert(a < sz), assert(b < sz), a = root_of(a), b = root_of(b);
        if (a == b) { return false; }
        if (comp_sz[a] < comp_sz[b]) { std::swap(a, b); }
        return comp_sz[a] += comp_sz[b], rt[b] = a, true;
    }
    usize size_of(const usize a) { return assert(a < sz), comp_sz[root_of(a)]; }
    friend std::ostream& operator<<(std::ostream& os, const unionfind& uf)
    {
        os << "[";
        for (usize i = 0; i < uf.sz; i++) { os << uf.rt[i] << (i + 1 == uf.sz ? "" : ","); }
        return (os << "]\n");
    }

private:
    const usize sz;
    std::vector<usize> rt, comp_sz;
};
int main()
{
    const auto [N, M] = in_t<int, int>();
    std::vector<int> as(M), bs(M), cs(M);
    unionfind uf(N);
    for (int i = 0; i < M; i++) {
        as[i] = in<int>() - 1, bs[i] = in<int>() - 1, cs[i] = in<int>();
        if (cs[i] == 1) {
            if (not uf.unite(as[i], bs[i])) { return outln("Yes"); }
        }
    }
    graph g(N);
    for (int i = 0; i < M; i++) {
        if (cs[i] == 2) { g.add_edge(uf.root_of(as[i]), uf.root_of(bs[i])); }
    }
    outln(top_sort(g).first ? "No" : "Yes");
}
0