Codeforces Round #286 (Div. 2)B. Mr. Kitayuta's Colorful Graph

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 51 2 11 2 22 3 12 3 32 4 331 23 41 4

output

210

input

5 71 5 12 5 13 5 14 5 11 2 22 3 23 4 251 55 12 51 51 4

output

11112

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张图，对于询问的两点看看有多少张图可通。

#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <algorithm>#include <cctype>#include <queue>#include <vector>#define INF 0x7fffffff#define eps (1e-9)#define lenq 2<<16#define maxn 199999999#define clearto(s,x) memset(s,x,sizeof(s))using namespace std;int n, m, tot=0;int edge[110][110][110]={0};int vis[110];int dfs(int a,int b,int t){    if(edge[a][b][t]==1)     return 1;    int i;    for(i=1;i<=n;i++){       if(edge[a][i][t]==0)  continue;       if(vis[i]==1)         continue;          vis[i]=1;       if(dfs(i,b,t)==1)     return 1;    }    return 0;}int main(){    //freopen("E:\DATA.txt","r",stdin);    //int TT=1,tt=1;     scanf("%d",&TT);    int i=0,j=0,k=0,t=0;    scanf("%d %d",&n,&m);    int a,b,c;    for(i=1;i<=m;i++){        scanf("%d %d %d",&a,&b,&c);        edge[a][b][c]=edge[b][a][c]=1;    }    scanf("%d",&tot);    while(tot--){        scanf("%d %d",&a,&b);        int ans=0;        for(t=1;t<=m;t++){            clearto(vis,0);            vis[a]=1;            if(dfs(a,b,t)==1) { ans++; edge[a][b][t]=edge[b][a][t]=1; }        }        printf("%d\n",ans);    }    return 0;}