Mr. Kitayuta's Colorful Graph
来源:互联网 发布:以太网是什么网络 编辑:程序博客网 时间:2024/06/05 22:37
数据量很小用搜索或并查集应该都能过
题目要求:
从一个点到另一个点可以经过多少条不同的边
思路:
为每一条不同编号的边建一个并查集,查看有多少条边可以使这两个点有共同的父节点
B. Mr. Kitayuta's Colorful Graph
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 vidirectly 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.
Examples
4 51 2 11 2 22 3 12 3 32 4 331 23 41 4
210
5 71 5 12 5 13 5 14 5 11 2 22 3 23 4 251 55 12 51 51 4
11112
#include<stdio.h>#include<string.h>#define maxn 105int pre[maxn][maxn];void Union(int x,int y,int z);int find(int a,int b);int main() {int n,m,q;memset(pre,0,sizeof(pre));scanf("%d%d",&n,&m);for(int i=1;i<=m;i++){for(int j=1;j<=n;j++){pre[i][j]=j;}}for(int i=0;i<m;i++){int a,b,c;scanf("%d%d%d",&a,&b,&c);Union(a,b,c);}scanf("%d",&q);for(int i=0;i<q;i++){int a,b,ans=0;scanf("%d%d",&a,&b);for(int j=1;j<=m;j++){int fa,fb;fa=find(a,j);fb=find(b,j);if(fa==fb)ans++;}printf("%d\n",ans);}return 0;}void Union(int x,int y,int z){int fx,fy;fx=find(x,z);fy=find(y,z);if(fx!=fy)pre[z][fx]=fy;}int find(int a,int b){int r=a;while(r!=pre[b][r])r=pre[b][r];while(a!=pre[b][a]){int s=a;a=pre[b][a];pre[b][s]=r;}return r;}
- Mr. Kitayuta's Colorful Graph
- Mr. Kitayuta's Colorful Graph
- B. Mr. Kitayuta's Colorful Graph
- 506D Mr. Kitayuta's Colorful Graph
- B - Mr. Kitayuta's Colorful Graph
- CF-Mr. Kitayuta's Colorful Graph
- Mr. Kitayuta's Colorful Graph CodeForces
- CF 505B Mr. Kitayuta's Colorful Graph(最短路)
- Codeforces 505B - Mr. Kitayuta's Colorful Graph (DFS)
- CF div.2B. Mr. Kitayuta's Colorful Graph
- codeforces 505B B. Mr. Kitayuta's Colorful Graph(bfs)
- cf#286-B - Mr. Kitayuta's Colorful Graph-dfs
- CodeForces-505B-Mr. Kitayuta's Colorful Graph(弗洛伊德)
- codeforces 505B Mr. Kitayuta's Colorful Graph
- codeforces 505B Mr. Kitayuta's Colorful Graph
- [Codeforces Round #286 DIV1D (CF506D)] Mr. Kitayuta's Colorful Graph
- B. Mr. Kitayuta's Colorful Graph(并查集)
- Mr. Kitayuta's Colorful Graph(巧用并查集)
- python socket编程:时间戳服务端与客户端
- Letters Gym
- 一些大佬的博客地址
- 打印目标字符串前面的内容
- python多线程模块threading
- Mr. Kitayuta's Colorful Graph
- c#窗口操作-句柄操控全解
- Maven常用命令以及Nexus私服配置
- 获取系统传感器
- POJ2155 Matrix <树套树/二维树状数组>
- CentOS6 单节点安装Redis Sentinel
- [Usaco2005 nov]Asteroids 穿越小行星群
- 【SSLGZ 2673】2017年8月9日提高组T1 水题
- Oracle 数据库的连接方式实现方法