Download Speed

input/code.cpp: In member function 'long long int Dinic::dfs(int, long long int)':
input/code.cpp:22:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<E>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         for(int &i=it[u];i<g[u].size();i++){
      |                          ~^~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;
struct E{int to,rev;long long cap;};
struct Dinic{
    int n,s,t;vector<vector<E>> g;vector<int> l,it;
    Dinic(int n):n(n),g(n),l(n),it(n){}
    void add(int u,int v,long long c){
        g[u].push_back({v,(int)g[v].size(),c});
        g[v].push_back({u,(int)g[u].size()-1,0});
    }
    bool bfs(){
        fill(l.begin(),l.end(),-1);
        queue<int>q;q.push(s);l[s]=0;
        while(!q.empty()){
            int u=q.front();q.pop();
            for(auto &e:g[u])if(e.cap>0&&l[e.to]<0)l[e.to]=l[u]+1,q.push(e.to);
        }
        return l[t]>=0;
    }
    long long dfs(int u,long long f){
        if(u==t)return f;
        for(int &i=it[u];i<g[u].size();i++){
            E &e=g[u][i];
            if(e.cap>0&&l[e.to]==l[u]+1){
                long long ret=dfs(e.to,min(f,e.cap));
                if(ret){e.cap-=ret;g[e.to][e.rev].cap+=ret;return ret;}
            }
        }
        return 0;
    }
    long long flow(int S,int T){
        s=S;t=T;long long F=0,f;
        while(bfs()){fill(it.begin(),it.end(),0);while((f=dfs(s,1e18))>0)F+=f;}
        return F;
    }
};
int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int n,m;cin>>n>>m;Dinic d(n);
    while(m--){int a,b;long long c;cin>>a>>b>>c;d.add(a-1,b-1,c);}
    cout<<d.flow(0,n-1);
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED