제출 #245182

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
245182		Tc14	Toll (BOI17_toll)	C++17	8 / 100	3074 ms	6532 KiB

toll

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ve vector
typedef long long ll;

const int INF = 1e9;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int k, n, m, o, a, b, t, u, v, d, dNew;
    ve<ve<pair<int, int>>> G;
    ve<int> D;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> PQ;

    cin >> k >> n >> m >> o;
    G = ve<ve<pair<int, int>>>(n);

    for (int i = 0; i < m; i++) {
        cin >> a >> b >> t;
        G[a].push_back({b, t});
    }

    for (int i = 0; i < o; i++) {
        cin >> a >> b;

        D = vector<int>(n, INF);
        D[a] = 0;
        PQ.push({0, a});

        while (!PQ.empty()) {
            tie(d, u) = PQ.top();
            PQ.pop();
            for (pair<int, int> e : G[u]) {
                tie(v, t) = e;
                dNew = d + t;
                if (dNew < D[v]) {
                    D[v] = dNew;
                    PQ.push({dNew, v});
                }
            }
        }

        if (D[b] == INF) cout << -1 << endl;
        else cout << D[b] << endl;
    }

    return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 10
• Subtask 3: 8 / 8
• Subtask 4: 0 / 31
• Subtask 5: 0 / 44