1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
| #include <bits/stdc++.h>
#define x first
#define y second
#define x1 X1
#define x2 X2
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax (T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline int Chkmin (T &a, T b) { return a > b ? a = b, 1 : 0; }
inline int read ()
{
int sum = 0, fl = 1; char ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') fl = -1;
for (; isdigit(ch); ch = getchar()) sum = (sum << 3) + (sum << 1) + ch - '0';
return sum * fl;
}
const int Maxn = 20, Maxm = 1000 + 10, inf = INT_MAX;
int N, M;
int e, Begin[Maxn], Next[Maxm * 2], To[Maxm * 2], W[Maxm * 2];
inline void add_edge (int x, int y, int z)
{
To[e] = y;
Next[e] = Begin[x];
Begin[x] = e;
W[e++] = z;
}
namespace Dinic
{
int Level[Maxn], Cur[Maxn];
inline void init()
{
e = 0;
memset(Begin, -1, sizeof (Begin));
memset(W, 0, sizeof (W));
}
queue <int> Q;
inline int bfs ()
{
for (int i = 1; i <= N; ++i) Level[i] = -1;
Level[1] = 0;
while (!Q.empty()) Q.pop();
Q.push(1);
while (!Q.empty())
{
int x = Q.front(); Q.pop();
for (int i = Begin[x]; i + 1; i = Next[i])
{
int y = To[i];
if (W[i] > 0 && Level[y] < 0)
{
Level[y] = Level[x] + 1;
Q.push(y);
}
}
}
if (Level[N] < 0) return 0;
return 1;
}
inline int find (int x, int k)
{
if (x == N || !k) return k;
int tot = 0;
for (int &i = Cur[x]; i + 1; i = Next[i])
{
int y = To[i], sum;
if (W[i] > 0 && Level[y] == Level[x] + 1 && (sum = find (y, min(k, W[i]))))
{
W[i] -= sum;
W[i ^ 1] += sum;
tot += sum;
k -= sum;
if (!k) break;
}
}
return tot;
}
inline int work ()
{
int ans = 0;
while (bfs())
{
for (int i = 1; i <= N; ++i) Cur[i] = Begin[i];
ans += find(1, inf);
}
return ans;
}
}
int main()
{
#ifdef hk_cnyali
freopen("B.in", "r", stdin);
freopen("B.out", "w", stdout);
#endif
int T = read();
for (int xz = 1; xz <= T; ++xz)
{
scanf("%d%d", &N, &M);
Dinic :: init();
while (M--)
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
add_edge(x, y, z);
add_edge(y, x, 0);
}
printf("Case %d: %d\n", xz, Dinic :: work());
}
return 0;
}
|