蓝桥杯试题——灾后重建

蓝桥杯试题——灾后重建

#include<iostream>
#include<cstring>


int N, M, Q;
int x;
int C;
int visited[5002];
int p[5002];
using namespace std;

struct Map {
	int arc[5002][5002];
	int vexnum;
	int arcnum;
};
Map map;

void Init()
{
	for (int i = 0; i < 5002; i++) {
		for (int j = 0; j < 5002; j++) {
			map.arc[i][j] = 0;
		}
	}
	return;
}

void set(int l, int r, int k, int c)
{
	int i;
	C = 0;
	for (int i = l; i <= r; i++) {
		if (i % k == c) {
			p[C] = i;//符合条件的点存进P数组
			C++;
		}
	}
	return;
}


void dfs(int temp, int s, int e) //深度优先遍历
{
	if (s == e) {
		if (temp < x) x = temp;//x默认1000000，如果有路可以到达，则将x赋值为temp
		return;
	}
	if (visited[s] == 1) return;  //防止出现自环走不出去
	visited[s] = 1;
	for (int i = 1; i < N+1; i++) {
		if (map.arc[s][i] != 0) {//判断是否有边
			if (temp < map.arc[s][i])
				dfs(map.arc[s][i], i, e);//取最长修复时间
			else
				dfs(temp, i, e);
		}
	}
	visited[s] = 0;
	return;
}

void fun()
{
	int min = 0;
	for (int i = 1; i < C; i++) {
		for(int j = i+1 ; j<C ; j++){
			x = 1000000;//修复时间最长为1000000
			dfs(0, p[i], p[j]);
			if (min < x) min = x;//修复时间取决于最长的修复时间
		}
	}
	cout << min << endl;
	return;
}

int main() {
	int x, y, p, c1, c2;
	cin >> N >> M >> Q;
	map.arcnum = M;
	map.vexnum = N;
	Init();
	for (int i = 0; i < M; i++) {
		cin >> c1 >> c2;
		if (c1 == c2)
			cin >> c1;
		else
		{
			cin >> map.arc[c1][c2];
			map.arc[c2][c1] = map.arc[c1][c2];
		}
	}
	int L, R, K, C;
	for (int i = 0; i < Q; i++)
	{
		memset(visited, 0, sizeof(int) * 5002);
		cin >> L >> R >> K >> C;
		set(L, R, K, C);//存储要访问的点
		fun();
	}
	return 0;
}