Download Speed

input/code.cpp: In function 'int fordFulkerson(int, std::vector<std::vector<int> >&, std::vector<std::vector<int> >&, int, int)':
input/code.cpp:40:21: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   40 |     while (new_flow = bfs(capacity, adj, parent, source, sink)) {
      |            ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <queue>
#include <climits>
#include <cstring>

using namespace std;

bool bfs(const vector<vector<int>>& capacity, vector<vector<int>>& adj, vector<int>& parent, int source, int sink) {
    fill(parent.begin(), parent.end(), -1);
    parent[source] = source;
    queue<pair<int, int>> q;
    q.push({source, INT_MAX});

    while (!q.empty()) {
        int cur = q.front().first;
        int flow = q.front().second;
        q.pop();

        for (int next : adj[cur]) {
            if (parent[next] == -1 && capacity[cur][next]) {
                parent[next] = cur;
                int new_flow = min(flow, capacity[cur][next]);
                if (next == sink) {
                    return new_flow;
                }
                q.push({next, new_flow});
            }
        }
    }

    return 0;
}

int fordFulkerson(int n, vector<vector<int>>& capacity, vector<vector<int>>& adj, int source, int sink) {
    int max_flow = 0;
    vector<int> parent(n);

    int new_flow;
    while (new_flow = bfs(capacity, adj, parent, source, sink)) {
        max_flow += new_flow;
        int cur = sink;
        while (cur != source) {
            int prev = parent[cur];
            capacity[prev][cur] -= new_flow;
            capacity[cur][prev] += new_flow;
            cur = prev;
        }
    }

    return max_flow;
}

int main() {
    int n, m;
    cin >> n >> m;

    vector<vector<int>> capacity(n, vector<int>(n, 0));
    vector<vector<int>> adj(n);

    for (int i = 0; i < m; ++i) {
        int a, b, c;
        cin >> a >> b >> c;
        --a; --b;
        capacity[a][b] += c;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    int source = 0; 
    int sink = n - 1; 

    cout << fordFulkerson(n, capacity, adj, source, sink) << endl;

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: ACCEPTED