結果

問題 No.1382 Travel in Mitaru city
ユーザー haruki_Kharuki_K
提出日時 2021-02-10 04:55:10
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 140 ms / 2,000 ms
コード長 6,596 bytes
コンパイル時間 2,858 ms
コンパイル使用メモリ 218,784 KB
実行使用メモリ 21,076 KB
最終ジャッジ日時 2023-09-21 20:16:04
合計ジャッジ時間 9,866 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 31 ms
6,964 KB
testcase_07 AC 25 ms
6,284 KB
testcase_08 AC 16 ms
5,484 KB
testcase_09 AC 32 ms
6,988 KB
testcase_10 AC 31 ms
6,816 KB
testcase_11 AC 69 ms
14,188 KB
testcase_12 AC 70 ms
14,212 KB
testcase_13 AC 72 ms
14,460 KB
testcase_14 AC 66 ms
13,932 KB
testcase_15 AC 73 ms
13,844 KB
testcase_16 AC 137 ms
20,988 KB
testcase_17 AC 125 ms
21,012 KB
testcase_18 AC 132 ms
21,060 KB
testcase_19 AC 125 ms
21,004 KB
testcase_20 AC 128 ms
21,068 KB
testcase_21 AC 131 ms
21,016 KB
testcase_22 AC 128 ms
21,076 KB
testcase_23 AC 129 ms
21,016 KB
testcase_24 AC 124 ms
21,060 KB
testcase_25 AC 126 ms
21,016 KB
testcase_26 AC 59 ms
11,156 KB
testcase_27 AC 58 ms
11,088 KB
testcase_28 AC 56 ms
11,060 KB
testcase_29 AC 57 ms
11,076 KB
testcase_30 AC 54 ms
11,008 KB
testcase_31 AC 48 ms
9,672 KB
testcase_32 AC 59 ms
10,768 KB
testcase_33 AC 54 ms
10,252 KB
testcase_34 AC 39 ms
8,352 KB
testcase_35 AC 26 ms
6,552 KB
testcase_36 AC 39 ms
9,336 KB
testcase_37 AC 7 ms
4,376 KB
testcase_38 AC 42 ms
10,216 KB
testcase_39 AC 12 ms
5,100 KB
testcase_40 AC 33 ms
8,660 KB
testcase_41 AC 36 ms
9,140 KB
testcase_42 AC 43 ms
10,164 KB
testcase_43 AC 37 ms
9,384 KB
testcase_44 AC 16 ms
5,788 KB
testcase_45 AC 34 ms
8,932 KB
testcase_46 AC 14 ms
5,720 KB
testcase_47 AC 47 ms
10,736 KB
testcase_48 AC 33 ms
8,500 KB
testcase_49 AC 50 ms
11,120 KB
testcase_50 AC 24 ms
6,984 KB
testcase_51 AC 97 ms
18,120 KB
testcase_52 AC 121 ms
20,904 KB
testcase_53 AC 23 ms
7,480 KB
testcase_54 AC 47 ms
11,252 KB
testcase_55 AC 108 ms
19,940 KB
testcase_56 AC 33 ms
8,928 KB
testcase_57 AC 70 ms
14,404 KB
testcase_58 AC 12 ms
5,204 KB
testcase_59 AC 32 ms
8,876 KB
testcase_60 AC 140 ms
19,420 KB
testcase_61 AC 3 ms
4,384 KB
testcase_62 AC 1 ms
4,380 KB
testcase_63 AC 7 ms
4,376 KB
testcase_64 AC 3 ms
4,376 KB
testcase_65 AC 2 ms
4,380 KB
testcase_66 AC 2 ms
4,376 KB
testcase_67 AC 3 ms
4,380 KB
testcase_68 AC 4 ms
4,380 KB
testcase_69 AC 2 ms
4,380 KB
testcase_70 AC 5 ms
4,376 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> 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";


}
0