#615733 (C++17) No.1382 Travel in Mitaru city

提出ソース

結果

問題	No.1382 Travel in Mitaru city
ユーザー	haruki_K
提出日時	2021-02-10 04:55:10
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	117 ms / 2,000 ms
コード長	6,596 bytes
コンパイル時間	2,213 ms
コンパイル使用メモリ	221,920 KB
実行使用メモリ	21,248 KB
最終ジャッジ日時	2024-07-07 13:48:10
合計ジャッジ時間	7,824 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	1 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	1 ms 5,376 KB
testcase_06	AC	28 ms 6,912 KB
testcase_07	AC	22 ms 6,272 KB
testcase_08	AC	15 ms 5,532 KB
testcase_09	AC	30 ms 7,128 KB
testcase_10	AC	26 ms 7,000 KB
testcase_11	AC	64 ms 14,208 KB
testcase_12	AC	64 ms 14,336 KB
testcase_13	AC	68 ms 14,464 KB
testcase_14	AC	63 ms 13,952 KB
testcase_15	AC	65 ms 14,080 KB
testcase_16	AC	114 ms 21,120 KB
testcase_17	AC	110 ms 21,120 KB
testcase_18	AC	117 ms 21,248 KB
testcase_19	AC	111 ms 21,120 KB
testcase_20	AC	113 ms 21,120 KB
testcase_21	AC	114 ms 21,120 KB
testcase_22	AC	112 ms 21,068 KB
testcase_23	AC	110 ms 20,992 KB
testcase_24	AC	111 ms 21,120 KB
testcase_25	AC	115 ms 21,120 KB
testcase_26	AC	51 ms 11,108 KB
testcase_27	AC	52 ms 11,316 KB
testcase_28	AC	50 ms 11,220 KB
testcase_29	AC	49 ms 11,100 KB
testcase_30	AC	48 ms 11,100 KB
testcase_31	AC	42 ms 9,600 KB
testcase_32	AC	51 ms 11,008 KB
testcase_33	AC	45 ms 10,368 KB
testcase_34	AC	32 ms 8,448 KB
testcase_35	AC	22 ms 6,784 KB
testcase_36	AC	36 ms 9,600 KB
testcase_37	AC	7 ms 5,376 KB
testcase_38	AC	39 ms 10,112 KB
testcase_39	AC	11 ms 5,376 KB
testcase_40	AC	29 ms 8,576 KB
testcase_41	AC	31 ms 9,216 KB
testcase_42	AC	36 ms 10,240 KB
testcase_43	AC	33 ms 9,344 KB
testcase_44	AC	15 ms 5,888 KB
testcase_45	AC	29 ms 8,960 KB
testcase_46	AC	12 ms 5,760 KB
testcase_47	AC	43 ms 10,840 KB
testcase_48	AC	31 ms 8,852 KB
testcase_49	AC	45 ms 11,172 KB
testcase_50	AC	22 ms 6,988 KB
testcase_51	AC	88 ms 18,176 KB
testcase_52	AC	106 ms 20,864 KB
testcase_53	AC	22 ms 7,296 KB
testcase_54	AC	44 ms 11,392 KB
testcase_55	AC	105 ms 20,096 KB
testcase_56	AC	29 ms 9,088 KB
testcase_57	AC	60 ms 14,464 KB
testcase_58	AC	11 ms 5,448 KB
testcase_59	AC	28 ms 8,832 KB
testcase_60	AC	102 ms 19,584 KB
testcase_61	AC	3 ms 5,376 KB
testcase_62	AC	2 ms 5,376 KB
testcase_63	AC	7 ms 5,376 KB
testcase_64	AC	3 ms 5,376 KB
testcase_65	AC	2 ms 5,376 KB
testcase_66	AC	2 ms 5,376 KB
testcase_67	AC	2 ms 5,376 KB
testcase_68	AC	3 ms 5,376 KB
testcase_69	AC	3 ms 5,376 KB
testcase_70	AC	4 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> 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> auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> 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 > 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(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); }
int64_t mod(int64_t x, int64_t m) { assert(m != 0); return (x %= m) < 0 ? x+m : x; }
const int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
const 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_); }
// <<<
// >>> union find

struct UnionFind {
    int n, sz; // id : 0...n-1
    vector<int32_t> par;

    UnionFind(int n = 0) : n(n), sz(n), par(n, -1) { }
    void clear() {
        rep (i, n) par[i] = -1;
        sz = n;
    }
    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; }
    vector<vector<int>> 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]));
        return grp;
    }
};

// <<<

int32_t main() {
    int n, m, s, t; cin >> n >> m >> s >> t; --s, --t;
    vector<int> p(n); cin >> p;
    vector<vector<int>> g(n);
    rep (i, m) {
        int a, b; cin >> a >> b; --a, --b;
        g[a].eb(b);
        g[b].eb(a);
    }

    map<int, vector<int>> pi;
    rep (i, n) pi[-p[i]].eb(i);

    UnionFind uf(n);
    vector<bool> alive(n);
    int ans = 0;
    for (auto const& [_, v] : pi) {
        for (int i : v) {
            alive[i] = true;
            for (int j : g[i]) {
                if (alive[j]) uf.unite(i, j);
            }
        }
        for (int i : v) {
            if (p[i] < p[s] and uf.same(s, i)) {
                ans++;
                break;
            }
        }
    }

    cout << ans << "\n";


}

yukicoder

結果

テストケース

ソースコード