Created
May 6, 2015 20:12
-
-
Save luccasiau/2c498f09693e5332844d to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// | |
// viagem_de_succa_floyd.cpp | |
// | |
// Created by Lucca Siaudzionis on 06/05/15. | |
// | |
// Viagem de Succa - Noic | |
#include <cstdio> | |
#include <algorithm> | |
using namespace std; | |
//------------------------- | |
#define MAXN 105 | |
#define INFINITO 999999999 | |
int n, m, q; | |
int mapa[MAXN][MAXN]; | |
int distancia[MAXN][MAXN]; | |
//------------------------- | |
int main(){ | |
scanf("%d %d %d", &n, &m, &q); | |
// inicializaremos a matriz para infinito em todas as casas | |
for(int i = 1;i <= n;i++) | |
for(int j = 1;j <= n;j++) | |
mapa[i][j] = INFINITO; | |
for(int i = 1;i <= m;i++){ | |
int x, y, tempo; | |
scanf("%d %d %d", &x, &y, &tempo); | |
// colocamos como recebendo esse valor mínimo para o caso | |
// dois voos entre as mesmas cidades | |
mapa[x][y] = min(mapa[x][y], tempo); | |
mapa[y][x] = min(mapa[y][x], tempo); | |
} | |
// inicializamos as distâncias | |
for(int i = 1;i <= n;i++) | |
for(int j = 1;j <= n;j++) | |
distancia[i][j] = mapa[i][j]; | |
// Algoritmo de Floyd-Warshall | |
for(int k = 1;k <= n;k++) | |
for(int i = 1;i <= n;i++) | |
for(int j = 1;j <= n;j++) | |
distancia[i][j] = min(distancia[i][j], distancia[i][k] + distancia[k][j]); | |
for(int i = 1;i <= q;i++){ | |
int S, E; | |
scanf("%d %d", &S, &E); // lemos a pergunta | |
printf("%d\n", distancia[S][E]); // imprimimos a resposta | |
} | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment