Download Speed

input/code.cpp: In function 'int findPath(std::vector<std::vector<std::pair<int, int> > >&, std::vector<std::vector<int> >&, std::vector<bool>&, int, int, int)':
input/code.cpp:14:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for (int i=0;i<g[node].size();i++){
      |                  ~^~~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <climits>

using namespace std;

int findPath(vector<vector<pair<int,int>>>& g, vector<vector<int>> & rev, vector<bool>& visited, int node, int sink, int flow){
    if (node==sink){
        return flow;
    }

    visited[node]=true;

    for (int i=0;i<g[node].size();i++){
        int next=g[node][i].first;
        int cap=g[node][i].second;

        if (!visited[next] && cap>0){
            int pushed = findPath(g, rev, visited, next, sink, min(flow, cap));

            if (pushed>0){
                g[node][i].second-=pushed;
                g[next][rev[node][i]].second+=pushed;
                return pushed;
            }
        }
    }
    return 0;
}

int maxFlow(vector<vector<pair<int,int>>> & g, vector<vector<int>>& rev, int source, int sink){
    int totalFlow=0;

    while (true){
        vector<bool> visited(g.size(), false);
        int pushed = findPath(g, rev, visited, source, sink, INT_MAX);
        if (pushed==0){
            break;
        }
        totalFlow+=pushed;
    }
    return totalFlow;
}

int main(){
    int n, m;
    cin >> n >> m;
    //node, capacity
    vector<vector<pair<int,int>>> g(n+1, vector<pair<int,int>>(0));
    vector<vector<int>> rev(n+1, vector<int>(0));
    for (int i=0;i<m;i++){
        int from, to, cap;
        cin >> from >> to >> cap;


        rev[from].push_back(g[from].size());
        rev[to].push_back(g[to].size());

        g[from].push_back({to,cap});
        g[to].push_back({from,0});

    }

    cout << maxFlow(g, rev, 1, n) << '\n';


}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: RUNTIME ERROR

double free or corruption (out)

Test 7

Verdict: RUNTIME ERROR

double free or corruption (out)

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: RUNTIME ERROR

double free or corruption (out)

Test 12

Verdict: RUNTIME ERROR

double free or corruption (out)