-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinternetBandwidth_UVA820.cpp
109 lines (81 loc) · 2.19 KB
/
internetBandwidth_UVA820.cpp
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
#include <bits/stdc++.h>
using namespace std;
ifstream fin("internetBandwidth_UVA820.in");
ofstream fout("internetBandwidth_UVA820.out");
int solve(int start, int end, vector<bool> & visit, vector<vector<int>> & a, vector<vector<int>> & g)
{
int n = a.size() - 1;
queue<int> q;
vector<int> f(n + 1, -1);
q.push(start);
while (!q.empty())
{
int u = q.front();
q.pop();
if (u == end)
{
int _min = INT_MAX;
int now = end;
while (now != start)
{
_min = min(_min, a[f[now]][now]);
now = f[now];
}
now = end;
while (now != start)
{
a[now][f[now]] += _min;
a[f[now]][now] -= _min;
now = f[now];
}
return _min;
}
int size = g[u].size();
for (int i = 0; i <= size - 1; ++i)
{
int v = g[u][i];
if (a[u][v] <= 0 || visit[v] == true) continue;
visit[v] = true;
f[v] = u;
q.push(v);
}
}
return -1;
}
int main()
{
int t = 0;
while (true)
{
int n = 0;
fin >> n;
if (n == 0) break;
++t;
int start, end, m; fin >> start >> end >> m;
vector<vector<int>> a(n + 1, vector<int>(n + 1, 0)), g(n + 1);
for (int c = 1; c <= m; ++c)
{
int u, v, w; fin >> u >> v >> w;
if (a[u][v] == 0)
{
g[u].push_back(v); g[v].push_back(u);
}
a[u][v] += w; a[v][u] += w;
}
int ans = 0;
vector<bool> visit(n + 1, false);
while (true)
{
int res = solve(start, end, visit, a, g);
if (res == -1) break;
ans += res;
for (int i = 1; i <= n; ++i)
{
visit[i] = false;
}
}
fout << "Network " << t << '\n';
fout << "The bandwidth is " << ans << ".\n\n";
}
return 0;
}