ZOJ Problem Set - 3946 Highway Project

Highway Project

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

Edward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from the capital as fast as possible. Thus, he proposed the highway project.

The Marjar Empire has N cities (including the capital), indexed from 0 to N - 1 (the capital is 0) and there are M highways can be built. Building the i-th highway costs C_i dollars. It takes D_i minutes to travel between city X_i and Y_i on the i-th highway.

Edward wants to find a construction plan with minimal total time needed to reach other cities from the capital, i.e. the sum of minimal time needed to travel from the capital to city i (1 ≤ i ≤ N). Among all feasible plans, Edward wants to select the plan with minimal cost. Please help him to finish this task.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first contains two integers N, M (1 ≤ N, M ≤ 10⁵).

Then followed by M lines, each line contains four integers X_i, Y_i, D_i, C_i (0 ≤ X_i, Y_i < N, 0 < D_i, C_i < 10⁵).

Output

For each test case, output two integers indicating the minimal total time and the minimal cost for the highway project when the total time is minimized.

Sample Input

2
4 5
0 3 1 1
0 1 1 1
0 2 10 10
2 1 1 1
2 3 1 2
4 5
0 3 1 1
0 1 1 1
0 2 10 10
2 1 2 1
2 3 1 2

Sample Output

4 3
4 4

一道裸的spfa。做题的时候没有将cost和i赋值为足够大，一直wa，烦死了

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long LL;
const int N = 50005 * 5;
const LL INF = 100000000000;
struct Node
{
	LL v, c, d;
	int next;
}node[N];
int head[N];
int pos = 0;
LL cost[N], T[N];
bool inq[N];
void init()
{
	pos = 0;
	fill(cost, cost + N, INF);
	fill(T, T + N, INF);
	memset(inq, 0, sizeof(inq));
	memset(head, -1, sizeof(head));
}
void addEdge(int u, int v, int t, int c)
{//前向星
	node[pos].v = v;
	node[pos].c = c;
	node[pos].d = t;
	node[pos].next = head[u];
	head[u] = pos++;
}
void SPFA()
{
	queue<int> q;
	q.push(0);
	inq[0] = 1;
	cost[0] = 0;
	T[0] = 0;
	while (!q.empty())
	{
		int v = q.front();//循环到节点v
		q.pop();
		inq[v] = 0;
		for (int i = head[v]; i + 1; i = node[i].next)
		{
			int pos = node[i].v;//城市v能到达的城市
			if (T[v] + node[i].d <= T[pos])
			{
				if (T[v] + node[i].d < T[pos])
				{
					T[pos] = T[v] + node[i].d;
					cost[pos] = node[i].c;
					if (!inq[pos])
					{//城市pos是否在队列中
						inq[pos] = 1;
						q.push(pos);
					}
				}
				else if (cost[pos]>node[i].c)
				{
					cost[pos] = node[i].c;
					if (!inq[pos])
					{
						inq[pos] = 1;
						q.push(pos);
					}
				}
			}
		}
	}
}
int main()
{
	int t;
#ifdef glx
	freopen("in.txt", "r", stdin);
#endif
	scanf("%d", &t);
	while (t--)
	{
		int n, m;
		scanf("%d%d", &n, &m);
		int u, v, c, d;
		init();
		for (int i = 0; i < m; i++)
		{
			scanf("%d%d%d%d", &u, &v, &d, &c);
			addEdge(u, v, d, c);
			addEdge(v, u, d, c);
		}
		SPFA();
		LL dd = 0, cc = 0;
		for (int i = 0; i < n; i++)
		{
			dd += T[i];
			cc += cost[i];
		}
		printf("%lld %lld\n", dd, cc);
	}
	return 0;
}