Description
Mr. Kitayuta has just bought an undirected graph consisting of n vertices and m edges. The vertices of the graph are numbered from 1 ton. 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 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
2 1 0
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
1 1 1 1 2
Hint
Let's consider 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,分别代表n个点和m条边。
然后m行,分别有三个数,a[i],b[i],c[i], 代表的是从a[i]到b[i]这条边有c[i]这种颜色的双向边。
然后还有q个询问,u[i],v[i], 要你求从u[i]这个点到v[i]这个点直接或间接相连的有几种颜色。
这道题可以用两种方法:
1.用dfs加上三维数组然后每次对一种颜色搜一遍。也就是相当于以颜色为并查集,从当前点搜到结束点,然后对每个点都进行标记,若最后那个要寻找的点被标记过的话,那么就计数加1.(这里注意,每次都要对book这个标记数组清零)
2.直接用并查集,把每个点的祖先都合并,最后在判断的时候,如果发现起点和终点的祖先是一样的话,那么就说明两个点是可以到达的,那么计数加1。
#include<stdio.h>
#include<string.h>
int n,m;
int map[111][111][111]={0},book[111]={0};
void dfs(int u,int w){
int i,j;
book[u]=1;
//w代表颜色;
for(i=1;i<=n;i++){
if(map[u][i][w]&&book[i]==0){
dfs(i,w);
}
}
}
int main(){
int i,j,k;
int a,b,c;
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++){
scanf("%d%d%d",&a,&b,&c);
map[a][b][c]=map[b][a][c]=1;
}
scanf("%d",&k);
int u,v;
//对每种颜色搜一遍;
while(k--){
int ans=0;
scanf("%d%d",&u,&v);
//因为颜色种类是小于等于m的,所以可以这样for一遍来做;
//这里的i代表的是颜色的种数,因为我们这里并不知道会有几种颜色。
for(i=1;i<=m;i++){
memset(book,0,sizeof(book));
dfs(u,i);
if(book[v]) ans++;
}
printf("%d\n",ans);
}
}
第二种方法的代码:
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 111
int par[maxn][maxn];
void init(){
//i代表的是颜色,j是点数;
for(int i=0;i<maxn;i++){
for(int j=0;j<maxn;j++)
par[j][i]=j;
}
}
int find(int x,int c){
if(x!=par[x][c]) par[x][c]=find(par[x][c],c);
return par[x][c];
}
void merge(int x,int y,int c){
int tx,ty;
tx=find(x,c);
ty=find(y,c);
if(tx==ty) return ;
if(tx!=ty){
par[tx][c]=ty;
return ;
}
}
bool same(int x,int y,int c){
return find(x,c)==find(y,c);
}
int n,m;
int main(){
//这道题目的意思是:以点和颜色做并查集!
init();
scanf("%d%d",&n,&m);
int a,b,col;
int temp=m;
while(temp--){
scanf("%d%d%d",&a,&b,&col);
merge(a,b,col);
}
int q;
scanf("%d",&q);
int num=0;
while(q--){
int u,v;
num=0;
scanf("%d%d",&u,&v);
for(int i=1;i<=m;i++){
if(same(u,v,i)) num++;
}
printf("%d\n",num);
}
}
/*
4 5
1 2 1
1 2 2
2 3 1
2 3 3
2 4 3
3
1 2
3 4
1 4
*/
其实都大同小异,但是我想对于并查集的应用还是得多做题吧。