2010 SD - ICPC D - Emergency

D - Emergency

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu

use MathJax to parse formulas

Description

Kudo’s real name is not Kudo. Her name is Kudryavka Anatolyevna Strugatskia, and Kudo is only her nickname.

Now, she is facing an emergency in her hometown:

Her mother is developing a new kind of spacecraft. This plan costs enormous energy but finally failed. What’s more, because of the failed project, the government doesn’t have enough resource take measure to the rising sea levels caused by global warming, lead to an island flooded by the sea.

Dissatisfied with her mother’s spacecraft and the government, civil war has broken out. The foe wants to arrest the spacecraft project’s participants and the “Chief criminal” – Kudo’s mother – Doctor T’s family.

At the beginning of the war, all the cities are occupied by the foe. But as time goes by, the cities recaptured one by one.

To prevent from the foe’s arrest and boost morale, Kudo and some other people have to distract from a city to another. Although they can use some other means to transport, the most convenient way is using the inter-city roads. Assuming the city as a node and an inter-city road as an edge, you can treat the map as a weighted directed multigraph. An inter-city road is available if both its endpoint is recaptured.

Here comes the problem.

Given the traffic map, and the recaptured situation, can you tell Kudo what’s the shortest path from one city to another only passing the recaptured cities?

Input

The input consists of several test cases.

The first line of input in each test case contains three integers N (0<N≤300), M (0<M≤100000) and Q (0<Q≤100000), which represents the number of cities, the numbers of inter-city roads and the number of operations.

Each of the next M lines contains three integer x, y and z, represents there is an inter-city road starts from x, end up with y and the length is z. You can assume that 0<z≤10000.

Each of the next Q lines contains the operations with the following format:

a) 0 x – means city x has just been recaptured.

b) 1 x y – means asking the shortest path from x to y only passing the recaptured cities.

The last case is followed by a line containing three zeros.

Output

For each case, print the case number (1, 2 …) first.

For each operation 0, if city x is already recaptured (that is,the same 0 x operation appears again), print “City x is already recaptured.”

For each operation 1, if city x or y is not recaptured yet, print “City x or y is not available.” otherwise if Kudo can go from city x to city y only passing the recaptured cities, print the shortest path’s length; otherwise print “No such path.”

Your output format should imitate the sample output. Print a blank line after each test case.

Sample Input

Sample Output

Case 1:

City 0 or 2 is not available.

3

No such path.

City 2 is already recaptured.

Hint

明显就是一个floyd变形

#include <iostream>

#include <cstdio>

#include <sstream>

#include <cstring>

#include <map>

#include <cctype>

#include <set>

#include <vector>

#include <stack>

#include <queue>

#include <algorithm>

#include <cmath>

#include <bitset>

#define rap(i, a, n) for(int i=a; i<=n; i++)

#define rep(i, a, n) for(int i=a; i<n; i++)

#define lap(i, a, n) for(int i=n; i>=a; i--)

#define lep(i, a, n) for(int i=n; i>a; i--)

#define rd(a) scanf("%d", &a)

#define rlld(a) scanf("%lld", &a)

#define rc(a) scanf("%c", &a)

#define rs(a) scanf("%s", a)

#define rb(a) scanf("%lf", &a)

#define rf(a) scanf("%f", &a)

#define pd(a) printf("%d\n", a)

#define plld(a) printf("%lld\n", a)

#define pc(a) printf("%c\n", a)

#define ps(a) printf("%s\n", a)

#define MOD 2018

#define LL long long

#define ULL unsigned long long

#define Pair pair<int, int>

#define mem(a, b) memset(a, b, sizeof(a))

#define _  ios_base::sync_with_stdio(0),cin.tie(0)

//freopen("1.txt", "r", stdin);

using namespace std;

const int maxn = , INF = 0xfffffff;

int n, m, q;

bool vis2[maxn], G[][];

int d[][];

void floyd(int k)  //更新与点k相关联的所有的距离

{

    for(int i = ; i < n; i++)

        for(int j = ; j < n; j++)

                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);

}

int main()

{

    int kase = ;

    while(scanf("%d%d%d", &n, &m, &q))

    {

        for(int i = ; i < n; i++)

            for(int j = i + ; j < n; j++)

                d[i][i] = , d[i][j] = d[j][i] = INF;

        if(n ==  && m ==  && q == ) break;

        mem(vis2, );

        int u, v, w;

        for(int i = ; i < m; i++)

        {

            rd(u), rd(v), rd(w);

            d[u][v] = min(d[u][v], w);

        }

        printf("Case %d:\n", ++kase);

        int o, x;

        for(int i = ; i < q; i++)

        {

            rd(o);

            if(o == )

            {

                rd(x);

                if(!vis2[x]) floyd(x);

                if(vis2[x]) printf("City %d is already recaptured.\n", x);

                vis2[x] = ;

            }

            else if(o == )

            {

                rd(u), rd(v);

                if(vis2[u] ==  || vis2[v] == )

                    printf("City %d or %d is not available.\n", u, v);

                else if(d[u][v] == INF) printf("No such path.\n");

                else

                {

                    printf("%d\n", d[u][v]);

                }

            }

        }

        printf("\n");

    }

    return ;

}