LightOJ 1049 One Way Roads

/*	Light OJ 1049

题目大意：给定一张有向图有n个节点，有n条边，任意一个点都有两条邻边，
	每次可以使一条边方向改变，问要使得任意两点都有路径最少花费是多少；
	
题解：就是形成一个环，只有两个方向，顺时针或逆时针 
	对数据的处理就是 边的方向不改变 就令权值为0；方向改变就为 w； 
	先随便找一个方向一直dfs 得到cost 
	然后另一个方向的cost 就是 sum-cost了 
*/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <cmath>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <set>
#define pi acos(-1.0)
#define LL long long
#define ULL unsigned long long
#define inf 0x3f3f3f3f
#define INF 1e18
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define debug(a) printf("---%d---\n", a)
#define mem0(a) memset(a, 0, sizeof(a))
#define memi(a) memset(a, inf, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))
#define input1(a) scanf("%d", &a)
#define input2(a,b) scanf("%d %d", &a, &b)
#define input3(a,b,c) scanf("%d %d %d", &a, &b, &c)
using namespace std;
typedef pair<int, int> P;
const double eps = 1e-10;
const int maxn = 1e6 + 5;
const int N = 1e4 + 5;
const int mod = 1e8;

int n;
struct edge{
	int v, w;
	edge(int v_, int w_):v(v_), w(w_){}
};
int vis[105], cost;
vector<edge>G[105];

void dfs(int u, int cnt)
{
	vis[u] = 1;
	if (cnt == n) vis[1] = 0;
	for (int i = 0; i < G[u].size(); i++){
		edge e = G[u][i];	 
		if (vis[e.v]) continue;
		cost += e.w; 
		if (cnt == n) vis[1] = 1;
		dfs(e.v, cnt+1);
	}
}
int main(void)
{
//	freopen("in.txt","r", stdin);
	int T, cas = 1, sum;
	scanf("%d", &T);
	while (T--){
		scanf("%d", &n);
		for (int i = 1; i <= n; i++) G[i].clear();
		sum = cost = 0;
		for (int i = 1; i <= n; i++){
			int u, v, w;
			scanf("%d %d %d", &u, &v, &w);
			G[u].push_back(edge(v, 0));
			G[v].push_back(edge(u, w));
			sum += w;
		}
		memset(vis, 0, sizeof(vis));
		edge e = G[1][0]; 
		cost += e.w;
		vis[1] = 1;
		dfs(e.v, 2);  
		cost = min(cost, sum-cost);
		printf("Case %d: %d\n", cas++, cost);
	}

	return 0;
}