結果

問題 No.1382 Travel in Mitaru city
ユーザー rniyarniya
提出日時 2021-02-07 20:51:52
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 73 ms / 2,000 ms
コード長 4,776 bytes
コンパイル時間 2,906 ms
コンパイル使用メモリ 208,516 KB
実行使用メモリ 10,296 KB
最終ジャッジ日時 2023-09-17 19:39:43
合計ジャッジ時間 7,748 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,500 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 25 ms
4,864 KB
testcase_07 AC 20 ms
4,664 KB
testcase_08 AC 12 ms
4,380 KB
testcase_09 AC 26 ms
5,220 KB
testcase_10 AC 27 ms
5,076 KB
testcase_11 AC 42 ms
6,720 KB
testcase_12 AC 45 ms
6,764 KB
testcase_13 AC 47 ms
6,984 KB
testcase_14 AC 39 ms
6,772 KB
testcase_15 AC 42 ms
6,692 KB
testcase_16 AC 68 ms
8,920 KB
testcase_17 AC 68 ms
8,872 KB
testcase_18 AC 68 ms
8,876 KB
testcase_19 AC 69 ms
8,920 KB
testcase_20 AC 72 ms
8,876 KB
testcase_21 AC 66 ms
8,992 KB
testcase_22 AC 69 ms
9,116 KB
testcase_23 AC 66 ms
8,820 KB
testcase_24 AC 70 ms
8,888 KB
testcase_25 AC 73 ms
8,912 KB
testcase_26 AC 72 ms
8,856 KB
testcase_27 AC 69 ms
8,812 KB
testcase_28 AC 72 ms
8,824 KB
testcase_29 AC 69 ms
8,824 KB
testcase_30 AC 69 ms
8,820 KB
testcase_31 AC 46 ms
7,700 KB
testcase_32 AC 57 ms
8,756 KB
testcase_33 AC 54 ms
8,608 KB
testcase_34 AC 36 ms
6,648 KB
testcase_35 AC 23 ms
5,664 KB
testcase_36 AC 35 ms
7,976 KB
testcase_37 AC 7 ms
4,380 KB
testcase_38 AC 39 ms
8,556 KB
testcase_39 AC 11 ms
4,380 KB
testcase_40 AC 30 ms
7,284 KB
testcase_41 AC 33 ms
7,484 KB
testcase_42 AC 40 ms
8,756 KB
testcase_43 AC 34 ms
7,808 KB
testcase_44 AC 15 ms
4,844 KB
testcase_45 AC 32 ms
7,504 KB
testcase_46 AC 17 ms
5,180 KB
testcase_47 AC 63 ms
9,684 KB
testcase_48 AC 40 ms
7,660 KB
testcase_49 AC 70 ms
10,296 KB
testcase_50 AC 29 ms
6,436 KB
testcase_51 AC 43 ms
8,024 KB
testcase_52 AC 55 ms
8,824 KB
testcase_53 AC 12 ms
4,380 KB
testcase_54 AC 23 ms
5,652 KB
testcase_55 AC 52 ms
8,540 KB
testcase_56 AC 16 ms
5,176 KB
testcase_57 AC 34 ms
6,708 KB
testcase_58 AC 6 ms
4,380 KB
testcase_59 AC 17 ms
4,948 KB
testcase_60 AC 50 ms
8,556 KB
testcase_61 AC 3 ms
4,376 KB
testcase_62 AC 2 ms
4,376 KB
testcase_63 AC 6 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,376 KB
testcase_68 AC 3 ms
4,376 KB
testcase_69 AC 2 ms
4,376 KB
testcase_70 AC 5 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M, S, T;
    cin >> N >> M >> S >> T;
    S--, T--;
    vector<int> p(N);
    cin >> p;
    vector<vector<int>> G(N);
    for (; M--;) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        G[a].emplace_back(b);
        G[b].emplace_back(a);
    }

    priority_queue<pair<int, int>> pq;
    pq.emplace(p[S], S);
    int ans = 0, cur = p[S];
    vector<bool> seen(N, false);
    seen[S] = true;
    while (!pq.empty()) {
        auto q = pq.top();
        pq.pop();
        if (chmin(cur, q.first)) ans++;
        int v = q.second;
        for (int u : G[v]) {
            if (seen[u]) continue;
            pq.emplace(p[u], u);
            seen[u] = true;
        }
    }

    cout << ans << '\n';
    return 0;
}
0