Download Speed

// ~/.vim/cpp_template.cpp
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <limits>
 
#define REP(i,a,b) for (int i = a; i < b; i++)
 
// Type Aliases for 1D and 2D vectors with initialization
#define vi(n, val) vector<int>(n, val) // 1D vector of ints with size n, initialized to val
#define vll(n, val) vector<long long>(n, val) // 1D vector of long longs with size n, initialized to val
#define ll long long
#define vvi(n, m, val) vector<vector<int>>(n, vector<int>(m, val)) // 2D vector of ints (n x m), initialized to val
#define vvll(n, m, val) vector<vector<long long>>(n, vector<long long>(m, val)) // 2D vector of long longs (n x m), initialized to val
 
#define LL_INF std::numeric_limits<long long int>::max()
#define INF std::numeric_limits<int>::max()
 
 
using namespace std;
 
 
template <typename T>
void pV(const std::vector<T>& vec, const std::string& label = "Vector") {
    std::cout << label << ": [ ";
    for (const auto& elem : vec) {
        std::cout << elem << " ";
    }
    std::cout << "]" << std::endl;
}
 
 
void dfs(int s, vector<bool> *visited, vector<int> (*adj)[]) {
    if ((*visited)[s]) return;
    (*visited)[s] = true;
    // process node s
 
 
    for (auto u: (*adj)[s]) {
        dfs(u, visited, adj);
    }
}
/*
// DEPTH-FRIRST-SEARCH
vector<int> adj[N];                                                          
vector<bool> visited(N, false);
int u, v;
for(int i = 0; i < M;i++){
    cin >> u >> v;
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
}
*/
 
vector<long long> dijkstra(int N, int x, vector<vector<pair<int,int>>> *adj){
    vector<bool> processed(N, false);
    vector<long long> distance(N, LL_INF);
    priority_queue<pair<long long,int>> q;
    //for (int i = 1; i <= n; i++) distance[i] = INF;
    distance[x] = 0;
    q.push({0,x});
    while (!q.empty()) {
        int a = q.top().second; q.pop();
        if (processed[a]) continue;
        processed[a] = true;
        for (auto u : (*adj)[a]) {
            int b = u.first, w = u.second;
            if (distance[a]+w < distance[b]) {
                distance[b] = distance[a]+w;
                q.push({-distance[b],b});
            }
        }
    }
    return distance;
 
 
}
 
 
/*
DIJKSTRA
//vector<vector<pair<int,int>>> adj(N, vector<pair<int, int>>(N));
*/
 
const int MAX_N = 500;
 
bool bfs(int s, int t, vector<vector<int>>& capacity, vector<int>& parent, vector<vector<int>>& adj) {
    int n = capacity.size();
    vector<bool> visited(n, false);
    queue<int> q;
    q.push(s);
    visited[s] = true;
    parent[s] = -1;
 
    while(!q.empty()) {
        int u = q.front();
        q.pop();
        for(int v : adj[u]) {
            if(!visited[v] && capacity[u][v] > 0) {
                parent[v] = u;
                if(v == t) {
                    return true;
                }
                visited[v] = true;
                q.push(v);
            }
        }
    }
    return false;
}
 
long long edmondsKarp(int s, int t, vector<vector<int>>& capacity, vector<vector<int>>& adj) {
    int u, v;
    int n = capacity.size();
    vector<int> parent(n);
    long long maxFlow = 0;
 
    while(bfs(s, t, capacity, parent, adj)) {
        int pathFlow = INT_MAX;
        for(v = t; v != s; v = parent[v]) {
            u = parent[v];
            pathFlow = min(pathFlow, capacity[u][v]);
        }
 
        for(v = t; v != s; v = parent[v]) {
            u = parent[v];
            capacity[u][v] -= pathFlow;
            capacity[v][u] += pathFlow;
        }
        maxFlow += pathFlow;
    }
    return maxFlow;
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    // Your code starts here
    int n, m;
    cin >> n >> m;
 
    vector<vector<int>> capacity(n + 1, vector<int>(n + 1, 0));
    vector<vector<int>> adj(n + 1);
 
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        capacity[a][b] += c;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
 
    cout << edmondsKarp(1, n, capacity, adj) << endl;
 
 
    return 0;
}
 
 

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: ACCEPTED