uva 10801（乘电梯dijkstra）

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <climits>
#include <cassert>
#define LL long long

using namespace std;
const int maxn = 100 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = 4 * atan(1.0);
const double ee = exp(1.0);

int n, target;
int Time[maxn], tot;
int g[maxn][maxn], Index[maxn];
int dis[maxn];
bool vis[maxn];

void readGraph(int x)
{
for (int i = 0; i < tot; i++)
{
for (int j = 0; j < tot; j++)
{
if (i != j)
{
int t = abs(Index[i] - Index[j]) * Time[x];
if (t < g[Index[i]][Index[j]])
g[Index[i]][Index[j]] = g[Index[j]][Index[i]] = t;
}
}
}
}

void dijkstra()
{
memset(vis, false, sizeof(vis));
memset(dis, inf, sizeof(dis));
dis[0] = 0;
vis[0] = true;
for(int i = 0; i < 100; i++)
{
int mark = 0, mindis = inf;
for(int j = 0; j < 100; j++)
{
if(!vis[j] && dis[j] < mindis)
{
mindis = dis[j];
mark = j;
}
}
vis[mark] = true;
for(int j = 0; j < 100; j++)
{
if (!vis[j])
{
dis[j] = min(dis[j], dis[mark] + g[mark][j] + 60);
}
}
}
}

int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif // LOCAL
while (~scanf("%d%d", &n, &target))
{
memset(g, inf, sizeof(g));
memset(Time, 0, sizeof(Time));
memset(Index, 0, sizeof(Index));

for (int i = 0; i < n; i++)
{
scanf("%d", &Time[i]);
}
for (int i = 0; i < n; i++)
{
memset(Index, 0, sizeof(Index));
tot = 0;
do
{
scanf("%d", &Index[tot++]);
}
while (getchar() != '\n');
readGraph(i);
}
dijkstra();
if (dis[target] == inf)
printf("IMPOSSIBLE\n");
else
{
if (target == 0)
printf("0\n");
else
printf("%d\n", dis[target] - 60);
}
}
return 0;
}