結果

問題 No.1813 Magical Stones
ユーザー haruki_Kharuki_K
提出日時 2022-01-14 22:46:19
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 89 ms / 2,000 ms
コード長 7,720 bytes
コンパイル時間 2,630 ms
コンパイル使用メモリ 209,660 KB
実行使用メモリ 15,420 KB
最終ジャッジ日時 2023-08-12 21:20:46
合計ジャッジ時間 5,803 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 8 ms
10,352 KB
testcase_04 AC 2 ms
4,384 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 3 ms
4,384 KB
testcase_07 AC 1 ms
4,384 KB
testcase_08 AC 2 ms
4,384 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 15 ms
6,516 KB
testcase_12 AC 1 ms
4,380 KB
testcase_13 AC 1 ms
4,384 KB
testcase_14 AC 8 ms
10,348 KB
testcase_15 AC 85 ms
14,824 KB
testcase_16 AC 89 ms
14,780 KB
testcase_17 AC 82 ms
15,420 KB
testcase_18 AC 81 ms
14,828 KB
testcase_19 AC 84 ms
14,812 KB
testcase_20 AC 85 ms
14,816 KB
testcase_21 AC 81 ms
14,764 KB
testcase_22 AC 78 ms
14,916 KB
testcase_23 AC 76 ms
15,040 KB
testcase_24 AC 2 ms
4,380 KB
testcase_25 AC 9 ms
5,236 KB
testcase_26 AC 4 ms
4,384 KB
testcase_27 AC 51 ms
11,712 KB
testcase_28 AC 65 ms
11,640 KB
testcase_29 AC 62 ms
12,360 KB
testcase_30 AC 59 ms
11,764 KB
testcase_31 AC 72 ms
14,052 KB
testcase_32 AC 1 ms
4,384 KB
testcase_33 AC 2 ms
4,380 KB
testcase_34 AC 4 ms
4,384 KB
testcase_35 AC 10 ms
4,380 KB
testcase_36 AC 2 ms
4,384 KB
testcase_37 AC 19 ms
5,300 KB
testcase_38 AC 10 ms
8,144 KB
testcase_39 AC 49 ms
11,708 KB
testcase_40 AC 3 ms
4,388 KB
testcase_41 AC 3 ms
4,380 KB
testcase_42 AC 10 ms
4,384 KB
testcase_43 AC 6 ms
4,380 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;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#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) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
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 > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)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(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr ll mod(ll x, ll m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr ll div_floor(ll x, ll y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr ll div_ceil(ll x, ll y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
// <<<
// >>> scc
#ifndef EDGE_INFO
#define EDGE_INFO
constexpr int dest(int v) { return v; }
template <class E, class = decltype(declval<E>().to)>
constexpr int dest(E const& e) { return e.to; }
constexpr int cost(int) { return 1; }
template <class E, class = decltype(declval<E>().cost)>
constexpr auto cost(E const& e) { return e.cost; }
template <class E> using cost_t = decltype(cost(declval<E>()));
#endif
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(int32_t v) {
        low[v] = ord[v] = ++time; st[pos++] = v;
        for (auto const& e : g[v]) {
            if (ord[dest(e)] == 0) {
                dfs(dest(e));
                chmin(low[v], low[dest(e)]);
            } else if (ord[dest(e)] > 0) {
                chmin(low[v], ord[dest(e)]);
            }
        }
        if (low[v] == ord[v]) {
            sz++; do ord[st[--pos]] = -sz; while (st[pos] != v);
        }
    }

    // t-sorted id
    int id(int v) const { return ord[v]; }
    int size() const { return sz; }
    vector<vector<int>> groups() const {
        vector<vector<int>> grp(sz);
        rep (v, g.size()) grp[ord[v]].push_back(v);
        return grp;
    }

    // no multiple edges, no self-loops
    // no edge information
    vector<vector<int>> graph() const {
        vector<vector<int>> ret(size());
        vector<int32_t> last(g.size(), -1);
        rep (v, g.size()) {
            for (auto const& e : g[v]) {
                const int32_t x = id(v), y = id(dest(e));
                if (x == y or last[y] == x) continue;
                last[y] = x;
                ret[x].push_back(y);
            }
        }
        return ret;
    }
};
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<vector<int>> g(n);
    rep (i, m) {
        int x, y; cin >> x >> y; --x, --y;
        g[x].eb(y);
    }

    auto scc = get_scc(g);
    auto h = scc.graph();

    vector<int> indeg(h.size()), outdeg(h.size());
    rep (x, h.size()) {
        for (int y : h[x]) {
            indeg[y]++;
            outdeg[x]++;
        }
    }

    if (h.size() == 1) {
        cout << 0 << '\n';
    } else {
        cout << max(count(all(indeg), 0), count(all(outdeg), 0)) << '\n';
    }
}
0