제출 #737685

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
737685		Ariadna	Autobus (COCI22_autobus)	C++14	0 / 70	16 ms	340 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int INF = 1e9;

int n, m;
vector < vector < pair < int, int > > > adj;

int dijkstra(int s, int f, int k) {
    vector < int > dist(n, INF);
    priority_queue < pair < int, pair < int, int > > > pq;
    dist[s] = 0;
    pq.push(make_pair(0, make_pair(s, 0)));
    
    while (!pq.empty()) {
        int d = -pq.top().first;
        int u = pq.top().second.first;
        int l = pq.top().second.second;
        pq.pop();
        if (l == k) continue;
        if (dist[u] != d) 
            continue;
        for (pair < int, int > vecino : adj[u]) {
            int v = vecino.first;
            int w = vecino.second;
            if (dist[v] > dist[u] + w) {
                dist[v] = dist[u] + w;
                pq.push(make_pair(-dist[v], make_pair(v, l + 1)));
            }
        }
    }
    if (dist[f] == INF) return -1;
    return dist[f];
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin >> n >> m;
    adj = vector < vector < pair < int, int > > >(n);
    while (m--) {
        int a, b, t;
        cin >> a >> b >> t;
        --a; --b;
        adj[a].push_back(make_pair(b, t));
    }
    int k, q;
    cin >> k >> q;
    while (q--) {
        int a, b;
        cin >> a >> b;
        cout << dijkstra(a - 1, b - 1, k) << '\n';
    }
    
    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 25
• Subtask 4: 0 / 15