結果

問題 No.1382 Travel in Mitaru city
ユーザー iiljjiiljj
提出日時 2021-02-07 22:15:25
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 93 ms / 2,000 ms
コード長 9,854 bytes
コンパイル時間 2,656 ms
コンパイル使用メモリ 214,668 KB
実行使用メモリ 16,968 KB
最終ジャッジ日時 2023-09-17 22:11:55
合計ジャッジ時間 8,568 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 34 ms
12,176 KB
testcase_07 AC 27 ms
9,640 KB
testcase_08 AC 15 ms
6,352 KB
testcase_09 AC 35 ms
12,896 KB
testcase_10 AC 35 ms
12,388 KB
testcase_11 AC 51 ms
11,752 KB
testcase_12 AC 53 ms
12,224 KB
testcase_13 AC 57 ms
12,820 KB
testcase_14 AC 48 ms
11,108 KB
testcase_15 AC 49 ms
11,604 KB
testcase_16 AC 83 ms
15,660 KB
testcase_17 AC 81 ms
15,668 KB
testcase_18 AC 81 ms
15,684 KB
testcase_19 AC 83 ms
15,700 KB
testcase_20 AC 83 ms
15,792 KB
testcase_21 AC 93 ms
15,780 KB
testcase_22 AC 81 ms
15,800 KB
testcase_23 AC 82 ms
15,756 KB
testcase_24 AC 82 ms
15,780 KB
testcase_25 AC 89 ms
15,680 KB
testcase_26 AC 88 ms
15,664 KB
testcase_27 AC 90 ms
15,752 KB
testcase_28 AC 88 ms
15,896 KB
testcase_29 AC 86 ms
15,656 KB
testcase_30 AC 91 ms
15,808 KB
testcase_31 AC 53 ms
12,748 KB
testcase_32 AC 69 ms
14,704 KB
testcase_33 AC 61 ms
13,908 KB
testcase_34 AC 40 ms
10,740 KB
testcase_35 AC 27 ms
8,164 KB
testcase_36 AC 42 ms
12,744 KB
testcase_37 AC 8 ms
4,828 KB
testcase_38 AC 47 ms
14,064 KB
testcase_39 AC 13 ms
5,872 KB
testcase_40 AC 35 ms
11,180 KB
testcase_41 AC 39 ms
12,324 KB
testcase_42 AC 48 ms
14,060 KB
testcase_43 AC 42 ms
12,500 KB
testcase_44 AC 17 ms
7,040 KB
testcase_45 AC 37 ms
11,880 KB
testcase_46 AC 20 ms
6,764 KB
testcase_47 AC 74 ms
16,828 KB
testcase_48 AC 48 ms
11,760 KB
testcase_49 AC 78 ms
16,968 KB
testcase_50 AC 34 ms
9,508 KB
testcase_51 AC 56 ms
13,052 KB
testcase_52 AC 67 ms
14,652 KB
testcase_53 AC 14 ms
5,976 KB
testcase_54 AC 27 ms
8,524 KB
testcase_55 AC 60 ms
14,348 KB
testcase_56 AC 20 ms
6,944 KB
testcase_57 AC 38 ms
10,640 KB
testcase_58 AC 7 ms
4,548 KB
testcase_59 AC 19 ms
6,736 KB
testcase_60 AC 60 ms
13,956 KB
testcase_61 AC 3 ms
4,376 KB
testcase_62 AC 2 ms
4,376 KB
testcase_63 AC 8 ms
5,304 KB
testcase_64 AC 4 ms
4,380 KB
testcase_65 AC 2 ms
4,380 KB
testcase_66 AC 3 ms
4,376 KB
testcase_67 AC 3 ms
4,380 KB
testcase_68 AC 5 ms
4,384 KB
testcase_69 AC 3 ms
4,380 KB
testcase_70 AC 5 ms
4,592 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region Graph */

// エッジ（本来エッジは双方向だが，ここでは単方向で管理）
template <class weight_t = int, class flow_t = int> struct Edge {
    ll src;          // エッジ始点となる頂点
    ll dst;          // エッジ終点となる頂点
    weight_t weight; // 重み
    flow_t cap;
    Edge() : src(0), dst(0), weight(0) {}
    Edge(ll src, ll dst, weight_t weight) : src(src), dst(dst), weight(weight) {}
    Edge(ll src, ll dst, weight_t weight, flow_t cap) : src(src), dst(dst), weight(weight), cap(cap) {}
    // Edge 標準出力
    friend ostream &operator<<(ostream &os, Edge &edge) {
        os << "(" << edge.src << " -> " << edge.dst << ", " << edge.weight << ")";
        return os;
    }
};
// 同じ頂点を始点とするエッジ集合
template <class weight_t = int, class flow_t = int> class Node : public vc<Edge<weight_t, flow_t>> {
  public:
    ll idx;
    Node() : vc<Edge<weight_t, flow_t>>() {}
    // void add(int a, int b, weight_t w, flow_t cap) { this->emplace_back(a, b, w, cap); };
};
// graph[i] := 頂点 i を始点とするエッジ集合
template <class weight_t = int, class flow_t = int> class Graph : public vc<Node<weight_t, flow_t>> {
  public:
    Graph() : vc<Node<weight_t, flow_t>>() {}
    Graph(int n) : vc<Node<weight_t, flow_t>>(n) { REP(i, 0, n)(*this)[i].idx = i; }
    // 単方向
    void add_arc(int a, int b, weight_t w = 1, flow_t cap = 1) { (*this)[a].emplace_back(a, b, w, cap); }
    // 双方向
    void add_edge(int a, int b, weight_t w = 1, flow_t cap = 1) { add_arc(a, b, w, cap), add_arc(b, a, w, cap); }
};
// using Array = vc<Weight>;
// using Matrix = vc<Array>;

/* #endregion */

// Problem
void solve() {
    VAR(ll, n, m, s, t); //
    --s, --t;
    vll p(n);
    cin >> p;
    vll a(m), b(m);
    REP(i, 0, m) {
        cin >> a[i] >> b[i];
        --a[i], --b[i];
    }

    Graph<> graph(n);
    REP(i, 0, m) graph.add_edge(a[i], b[i]);

    using Population = ll;
    using state = pair<Population, ll>; // (始点からの最短経路長, ノード番号)
    pq<state> que;                      // 昇順に並べ替え，小さい順に取り出す
    vc<bool> visited(n, false);
    que.emplace(p[s], s);
    visited[s] = true;
    Population cp = p[s];
    ll cnt = 0;
    while (que.size()) {
        // tie(d, v) = que.top();
        state cur = que.top();
        que.pop();
        Population pp = cur.first;
        ll v = cur.second;
        if (chmin(cp, pp)) cnt++;

        // if (visited[v]) continue;
        for (Edge<> edge : graph[v]) {
            if (!visited[edge.dst]) {
                visited[edge.dst] = true;
                que.emplace(p[edge.dst], edge.dst);
            }
        }
    }
    pprint(cnt);
}

// entry point
int main() {
    solve();
    return 0;
}
0