Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int maxn = 100;
- int n, m;
- int graph[maxn][maxn];
- bool bfs(vector<vector<int>> & r_graph, int S, int E, vector<int> & parent) {
- vector<bool> visited(n + 1, false);
- visited[S] = true;
- queue<int> q;
- q.push(S);
- parent[S] = -1;
- while(!q.empty()) {
- int node = q.front();
- q.pop();
- for(int i = 0; i < n; i++) {
- if(!visited[i] and r_graph[node][i] > 0) {
- if(i == E) {
- parent[i] = node;
- return true;
- }
- q.push(i);
- visited[i] = true;
- parent[i] = node;
- }
- }
- }
- return false;
- }
- int max_flow(int S, int E) {
- vector<vector<int>> r_graph(n, vector<int>(n, 0));
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n; j++) {
- r_graph[i][j] = graph[i][j];
- }
- }
- vector<int> parent(n);
- int res = 0;
- while(bfs(r_graph, S, E, parent)) {
- int path_flow = 2e9;
- for(int i = E; i != S; i = parent[i]) {
- path_flow = min(path_flow, r_graph[parent[i]][i]);
- }
- for(int i = E; i != S; i = parent[i]) {
- r_graph[parent[i]][i] -= path_flow;
- r_graph[i][parent[i]] += path_flow;
- }
- res += path_flow;
- }
- return res;
- }
- int main() {
- int m;
- cin >> m;
- n = 26;
- for(int i = 0; i < m; i++) {
- char a, b;
- cin >> a >> b;
- int c;
- cin >> c;
- graph[a - 'A'][b - 'A'] = c;
- }
- cout << "DA" << endl;
- cout << max_flow(('S' - 'A'), ('T' - 'A')) << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement