Download Speed

input/code.cpp: In function 'int main()':
input/code.cpp:51:19: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   51 |     for(int i=0; i<m; i++){
      |                  ~^~
input/code.cpp:72:19: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   72 |     for(int i=1; i<=n; i++){
      |                  ~^~~

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

ll adj[501][501];
ll ff[501][501];
ll bf[501][501];
ll path[501];
bool visited[501];
ll pidx;

ll& fff(ll a, ll b){
    if(a > b) swap(a, b);
    return ff[a][b];
}

ll& bff(ll a, ll b){
    if(a > b) swap(a, b);
    return bf[a][b];
}

bool dfs(ll s, ll e, ll n){
    path[pidx++] = s;
    visited[s] = true;
    if(s == e){
        // path[pidx++] = e;
        return true;
    }
    for(ll i=1; i<=n; i++){
        if(ff[s][i] && !visited[i]){
            if(dfs(i, e, n)){
                return true;
            }
        }
    }
    pidx--;
    return false;
}

bool findpath(ll s, ll e, ll n){
    pidx=0;
    memset(visited, 0, n+1);
    return dfs(s, e, n);
}

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

    for(int i=0; i<m; i++){
        ll a, b, c;
        cin >> a >> b >> c;
        adj[a][b] = c;
        fff(a,b) = c;
        bff(a,b) = 0;
    }

    while(findpath(1, n, n)){
        ll m = LLONG_MAX;
        for(int i=1; i<pidx; i++){
            m = min(m, fff(path[i],path[i-1]));
        }
        for(int i=1; i<pidx; i++){
            fff(path[i],path[i-1]) -= m;
            bff(path[i],path[i-1]) += m;
        }
        // cout << m << endl;
    }

    ll s = 0;
    for(int i=1; i<=n; i++){
        if(adj[i][n]){
            s += bff(i,n);
        }
    }
    cout << s << endl;

    // for(int i=1; i<=n; i++){
    //     for(int j=1; j<=n; j++){
    //         if(i == j) d[i][j] = LLONG_MAX;
    //         else if(adj[i][j]) d[i][j] = adj[i][j];
    //         else d[i][j] = 0;
    //     }
    // }

    // cout << d[1][n] << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER