poj 2570

Fiber Network

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3114		Accepted: 1430

Description

Several startup companies have decided to build a better Internet, called the "FiberNet". They have already installed many nodes that act as routers all around the world. Unfortunately, they started to quarrel about the connecting lines, and ended up with every company laying its own set of cables between some of the nodes. 
Now, service providers, who want to send data from node A to node B are curious, which company is able to provide the necessary connections. Help the providers by answering their queries.

Input

The input contains several test cases. Each test case starts with the number of nodes of the network n. Input is terminated by n=0. Otherwise, 1<=n<=200. Nodes have the numbers 1, ..., n. Then follows a list of connections. Every connection starts with two numbers A, B. The list of connections is terminated by A=B=0. Otherwise, 1<=A,B<=n, and they denote the start and the endpoint of the unidirectional connection, respectively. For every connection, the two nodes are followed by the companies that have a connection from node A to node B. A company is identified by a lower-case letter. The set of companies having a connection is just a word composed of lower-case letters. 
After the list of connections, each test case is completed by a list of queries. Each query consists of two numbers A, B. The list (and with it the test case) is terminated by A=B=0. Otherwise, 1<=A,B<=n, and they denote the start and the endpoint of the query. You may assume that no connection and no query contains identical start and end nodes.

Output

For each query in every test case generate a line containing the identifiers of all the companies, that can route data packages on their own connections from the start node to the end node of the query. If there are no companies, output "-" instead. Output a blank line after each test case.

Sample Input

3
1 2 abc
2 3 ad
1 3 b
3 1 de
0 0
1 3
2 1
3 2
0 0
2
1 2 z
0 0
1 2
2 1
0 0
0

Sample Output

ab
d
-

z
-

floyd变型，对公司进行位压缩。floyd算法里更改式子adj[i][j]|=adj[i][k]&adj[k][j],这个也很好理解，每次插入一个点，如果某公司掌管[i,k]和[k,j]两段，那么该公司符合要求，于是加入集合[i,j]，当然实际操作是位运算。

这里注意一下，floyd空间优化为O（n^2）是有原因的，因为这里蕴含了一些更新关系。实际我们也知道adj(k)

是由adj(k-1)更新过来的，所以最保险的是开滚动数组。当然如果你知道这个优化背后的原理，那么就不用怕了。而这道题根据该原理adj[i][j]，i==j时，必须初始化为空集，也就是位压缩为0，否则更新会出错的。

代码：

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;

int adj[210][210];
char s[30];
int main()
{
    int n,a,b;
    while(scanf("%d",&n),n){
        memset(adj,0,sizeof adj);
        while(scanf("%d%d",&a,&b),a){
            scanf("%s",s);
            for(int i=0;s[i];i++)
                adj[a][b]|=1<<s[i]-'a';
        }
        for(int k=1;k<=n;k++)
            for(int i=1;i<=n;i++)
                for(int j=1;j<=n;j++)
                    adj[i][j]|=adj[i][k]&adj[k][j];
        while(scanf("%d%d",&a,&b),a){
            for(int i=0;i<26;i++)
                if(adj[a][b]&1<<i) putchar(i+'a');
            if(!adj[a][b]) putchar('-');
            puts("");
        }
        puts("");
    }
	return 0;
}