Codeforces Round #286 (Div. 2) B. Mr. Kitayuta's Colorful Graph(BFS || DFS || Floyd || 并查集)

B. Mr. Kitayuta's Colorful Graph

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Mr. Kitayuta has just bought an undirected graph consisting of n vertices and m edges. The vertices of the graph are numbered from 1 to n. Each edge, namely edge i, has a color ci, connecting vertex ai and bi.

Mr. Kitayuta wants you to process the following q queries.

In the i-th query, he gives you two integers — ui and vi.

Find the number of the colors that satisfy the following condition: the edges of that color connect vertex ui and vertex vi directly or indirectly.

Input

The first line of the input contains space-separated two integers — n and m (2 ≤ n ≤ 100, 1 ≤ m ≤ 100), denoting the number of the vertices and the number of the edges, respectively.

The next m lines contain space-separated three integers — ai, bi (1 ≤ ai < bi ≤ n) and ci (1 ≤ ci ≤ m). Note that there can be multiple edges between two vertices. However, there are no multiple edges of the same color between two vertices, that is, if i ≠ j, (ai, bi, ci) ≠ (aj, bj, cj).

The next line contains a integer — q (1 ≤ q ≤ 100), denoting the number of the queries.

Then follows q lines, containing space-separated two integers — ui and vi (1 ≤ ui, vi ≤ n). It is guaranteed that ui ≠ vi.

Output

For each query, print the answer in a separate line.

Sample test(s)

input

4 5
1 2 1
1 2 2
2 3 1
2 3 3
2 4 3
3
1 2
3 4
1 4

output

2
1
0

input

5 7
1 5 1
2 5 1
3 5 1
4 5 1
1 2 2
2 3 2
3 4 2
5
1 5
5 1
2 5
1 5
1 4

output

1
1
1
1
2

Note

Let's consider the first sample.

The figure above shows the first sample.

• Vertex 1 and vertex 2 are connected by color 1 and 2.
• Vertex 3 and vertex 4 are connected by color 3.
• Vertex 1 and vertex 4 are not connected by any single color.

无向图n个点，m条边，输入(x,y,z),指x,y之间的边的颜色为z（可能不止一种颜色），n1查询，(x,y)指由x到y有几条路径(从x走相同的颜色到y算一次)

可以用BFS || DFS，从起点出发，每次选一种颜色开始遍历(1<=颜色<=m)，看多少次可到达终点

 用Floyd来判连通，连通为1，也可以过，但耗时多

 以上三种方法建图时都是三维即（起点，终点，颜色）

效率最高的应该是并查集了，把相同颜色的连在一起，直接判断就可以

BFS

#include <iostream>  //30MS
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#define MAX 0x3f3f3f3f
#define N 102
using namespace std;
int a[N][N][N];
bool b[N];
int n,m;
void bfs(int x,int color)
{
    b[x]=1;
    queue<int >q;
    q.push(x);
    while(!q.empty())
    {
        int t=q.front();
        q.pop();
        for(int i=1; i<=n; i++)
        {
            if(!b[i] && a[t][i][color])
            {
                b[i]=true;
                q.push(i);
            }
        }
    }
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(a,0,sizeof(a));
        for(int i=0; i<m; i++)
        {
            int x,y,z;
            scanf("%d%d%d",&x,&y,&z);
            a[x][y][z]=a[y][x][z]=1;
        }
        int n1;
        scanf("%d",&n1);
        for(int i=0; i<n1; i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            int sum=0;
            for(int i=1; i<=m; i++)
            {
                memset(b,false,sizeof(b));
                bfs(x,i);
                if(b[y]) 
                    sum++;
            }
            printf("%d\n",sum);
        }
    }
    return 0;
}

DFS

#include <iostream>  //31MS
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#define MAX 0x3f3f3f3f
#define N 102
using namespace std;
int a[N][N][N];
bool b[N];
int n,m;
void dfs(int x,int color)
{
    for(int i=1;i<=n;i++)
    {
        if(!b[i] && a[x][i][color])
        {
            b[i]=true;
            dfs(i,color);
        }
    }
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(a,0,sizeof(a));
        for(int i=0; i<m; i++)
        {
            int x,y,z;
            scanf("%d%d%d",&x,&y,&z);
            a[x][y][z]=a[y][x][z]=1;
        }
        int n1;
        scanf("%d",&n1);
        for(int i=0; i<n1; i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            int sum=0;
            for(int i=1; i<=m; i++)
            {
                memset(b,false,sizeof(b));
                dfs(x,i);
                if(b[y]) 
                    sum++;
            }
            printf("%d\n",sum);
        }
    }
    return 0;
}

Floyd

#include <iostream> //93MS
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#define MAX 0x3f3f3f3f
#define N 102
using namespace std;
int a[N][N][N];
int n,m;
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(a,0,sizeof(a));
        for(int i=0; i<m; i++)
        {
            int x,y,z;
            scanf("%d%d%d",&x,&y,&z);
            a[x][y][z]=a[y][x][z]=1;
        }
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
               for(int k=1;k<=n;k++)
                  for(int c=1;c<=m;c++)
                       if(a[j][i][c]&&a[i][k][c])
                         a[j][k][c]=max(a[j][k][c],a[j][i][c]+a[i][k][c]);
        int n1;
        scanf("%d",&n1);
        for(int i=0; i<n1; i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            int sum=0;
            for(int i=1; i<=m; i++)
            {
                 if(a[x][y][i])
                    sum++;
            }
            printf("%d\n",sum);
        }
    }
    return 0;
}

并查集

#include <iostream>  //15MS
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#define MAX 0x3f3f3f3f
#define N 102
using namespace std;
int bin[N][N];
int n,m;
int findx(int x,int c)
{
    int r=x;
    while(r!=bin[c][r])
        r=bin[c][r];
    return r;
}
void merge(int x,int y,int c)
{
    int dx=findx(x,c);
    int dy=findx(y,c);
    if(dx!=dy)
      bin[c][dx]=dy;
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1;i<=m;i++)
            for(int j=1;j<=n;j++)
              bin[i][j]=j;
        for(int i=0; i<m; i++)
        {
            int x,y,z;
            scanf("%d%d%d",&x,&y,&z);
            merge(x,y,z);
        }
        int n1;
        scanf("%d",&n1);
        for(int i=0; i<n1; i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            int sum=0;
            for(int i=1; i<=m; i++)
            {
                 if(findx(x,i)==findx(y,i))
                    sum++;
            }
            printf("%d\n",sum);
        }
    }
    return 0;
}