제출 #628811

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
628811		a_aguilo	Toll (BOI17_toll)	C++14	0 / 100	886 ms	524288 KiB

toll

#include<bits/stdc++.h>

using namespace std;

void apsp(vector<vector<int>> & matrizAdyacencia) {
    int N = (int) matrizAdyacencia.size();
    for (int k = 0; k < N; k++){
        for (int i = 0; i < N; i++){
            for (int j = 0; j < N; j++)
                matrizAdyacencia[i][j] = min(matrizAdyacencia[i][j], matrizAdyacencia[i][k] + matrizAdyacencia[k][j]);
        }
    }
}


int main(){
    int K, N, M, O, t, a, b;
    cin >> K >> N >> M >> O;
    vector<vector<int>> G(N, vector<int>(N, 1e9+7));
    for(int i = 0; i < N; ++i)G[i][i] = 0;
    for(int i = 0; i < M; ++i){
        cin >> a >> b >> t;
        G[a][b] = t;
    }
    apsp(G);
    while(O--){
        cin >> a >> b;
        if(G[a][b] == 1e9+7) cout << -1 << endl;
        else cout << G[a][b]<< endl;
    }
    return 0;
}

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