10246 - Asterix and Obelix

/*

     枚举每一个城市作为宴会地点 然后构图  图中不能有比这个城市价格更高的点、

*/

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#define INF 1<<30
using namespace std;
int c,r,q;
int val[100],cost[100],dp[100][100];

struct Edge
{
    int from,to,dist;
};
struct Node
{
    int u;
};
vector<Edge> edges,te;
vector<int> G[10100*2];
int add(int u,int v,int w)
{
    edges.push_back((Edge)
    {
        u,v,w
    });
    //int l = edges.size();
    //G[u].push_back(l-1);
}
int add1(int u,int v,int w)
{
    te.push_back((Edge)
    {
        u,v,w
    });
    int l = te.size();
    G[u].push_back(l-1);
}
int build(int s)
{
    for(int i = 1; i <= c; i++)
        G[i].clear();
    te.clear();
    for(int i = 0; i < edges.size(); i++)
    {
        Edge &e = edges[i];
        if(val[e.from]<=val[s]&&val[e.to]<=val[s])
        {
            add1(e.from,e.to,e.dist);
            add1(e.to,e.from,e.dist);
        }
    }
}
int bfs(int s,int *cost)
{
    for(int i = 1; i <= c; i++)
        cost[i] = INF;
    queue<Node> Q;
    while(!Q.empty())
        Q.pop();
    Node t;
    t.u = s;
    cost[s] = 0;
    Q.push(t);
    while(!Q.empty())
    {
        t = Q.front();
        Q.pop();
        for(int i = 0; i < G[t.u].size(); i++)
        {
            Edge &e = te[G[t.u][i]];
            if(cost[e.to] > cost[t.u] + e.dist)
            {
                cost[e.to] = cost[t.u] + e.dist;
                Q.push((Node)
                {
                    e.to
                });
            }
        }
    }
}
int main()
{
    int count=1;
    while(scanf("%d%d%d",&c,&r,&q)==3)
    {
        if(!c&&!r&&!q) return 0;
        if(count>1) puts("");
        printf("Case #%d\n",count++);

        for(int i = 1; i <= c; i++)
            G[i].clear();
        edges.clear();
        for(int i = 1; i <= c; i++)
            scanf("%d",&val[i]);
        int u,v,w;
        for(int i = 0; i < r; i++)
        {
            scanf("%d%d%d",&u,&v,&w);
            add(u,v,w);
            //add(v,u,w);
        }
        for(int j = 1; j <= c; j++)
            for(int k = 1; k <= c; k++)
                if(j == k) dp[j][k] = 0;
                else dp[j][k] = INF;
        for(int i = 1; i <= c; i++)
        {
            build(i);
            bfs(i,cost);
            //printf("%d=------------\n",i);
            for(int j = 1; j <= c; j++)
                for(int k = 1; k <= j; k++)
                {
                    if(j!=k&&cost[j]!=INF&&cost[k]!=INF)
                    {
                        int temp = val[i]+cost[j]+cost[k];
                        //printf("%d ,%d %d\n",j,k,temp);
                        if(dp[j][k]>temp)
                        {
                            dp[k][j] = dp[j][k] = temp;
                        }
                    }
                }
        }
        while(q--)
        {
            scanf("%d%d",&u,&v);
            if(dp[u][v]!=INF)
                printf("%d\n",dp[u][v]);
            else printf("-1\n");
        }
    }
    return 0;
}