B. Mr. Kitayuta‘s Colorful Graph

传送门

• 题意：输入一个n个顶点，m条边的无向图，两个顶点之间有多个边权。有q个询问，问从u到v有几种边权的路（路径上所有的边权都等于c）。
• 思路：
  ①弗洛伊德算法
  用一个mp三维数组表示边权为c时，能否从i到达j。（mp[i][j][c])
  ②并查集算法
  用f[i][j]表示边权为j根节点为i的集合。
• 收获：对于第一种方法。阶段k应该位于第二层循环，表示经过编号不超过k的结点能否从i到达j。若k位于第四层，则表示经过编号k能否从i到达j。意义不同，需要斟酌考虑。
  方法1：

#include<cstdio>
#include<queue>
#include<set>
#include<cstdlib>
#include<string.h>
#include<string>
#include<iostream>
#include<cmath>
#include<map>
#include<algorithm>
#define endl "\n"
#define IOS ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define ft first
#define sd second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ll long long int
#define mt(a,b) memset(a, b, sizeof a)
//#define int long long
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
using namespace std;
const int N = 2e5 + 7, M = 1e6;
int mp[200][200][200];

int main()
{
	IOS;
	int n, m; cin >> n >> m;
	for (int i = 1; i <= m; i++)
	{
		int x, y, c;
		cin >> x >> y >> c;
		mp[x][y][c] = mp[y][x][c] = 1;
	}

	for (int c = 1; c <= m; c++)//颜色（阶段）
		for (int k = 1; k <= n; k++)//阶段
			for (int i = 1; i <= n; i++)//状态
				for (int j = 1; j <= n; j++)//状态
					mp[i][j][c] |= mp[i][k][c] & mp[k][j][c];//决策

	int q; cin >> q;
	while (q--)
	{
		int u, v; cin >> u >> v;
		int cnt = 0;
		for (int i = 1; i <= m; i++)
			if (mp[u][v][i] || mp[v][u][i]) cnt++;

		cout << cnt << endl;
	}


	return 0;
}

方法2：

#include<cstdio>
#include<queue>
#include<set>
#include<cstdlib>
#include<string.h>
#include<string>
#include<iostream>
#include<cmath>
#include<map>
#include<algorithm>
#define endl "\n"
#define IOS ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define ft first
#define sd second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ll long long int
#define mt(a,b) memset(a, b, sizeof a)
//#define int long long
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
using namespace std;
const int N = 2e5 + 7, M = 1e6;
int f[200][200];

int fd(int x, int c)
{
	return f[x][c] == x ? x : f[x][c] = fd(f[x][c], c);
}

int main()
{
	IOS;
	int n, m; cin >> n >> m;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			f[i][j] = i;

	for (int i = 1; i <= m; i++)
	{
		int x, y, c; cin >> x >> y >> c;
		int fx = fd(x, c), fy = fd(y, c);
		if (fx != fy)
			f[fx][c] = fy;
	}

	int q; cin >> q;
	while (q--)
	{
		int cnt = 0;
		int u, v; cin >> u >> v;
		for (int i = 1; i <= m; i++)
			if (fd(u, i) == fd(v, i)) cnt++;

		cout << cnt << endl;
	}


	return 0;
}

参考链接