Internet connection

#include <iostream>
#include <deque>
#include <algorithm>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef std::string str;

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    int edges[n][n];
    for(int i=0; i<n; i++) {
      for(int j=0; j<n; j++) {
        edges[i][j] = 0;
      }
    }
    for(int i=0; i<m; i++) {
      int from, to, weight;
      cin >> from >> to >> weight;
      edges[from-1][to-1] = weight;
    }
    bool finished = false;
    ll res = 0;
    while(!finished) {
      /*
      cout << "new res: " << res << endl;
      for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
          cout << edges[i][j] << " ";
        }
        cout << endl;
      }*/
      int activation[n];
      int goesBefore[n];
      for(int i=0; i<n; i++) {
        activation[i] = 0;
        goesBefore[i] = 0;
      }
      deque<int> queue;
      int curExplore = 0;
      goesBefore[0] = -1;
      activation[0] = 1000000001;
      bool reachEnd = false;
      //cout << "Hey" << endl;
      while(!reachEnd) {
        for(int i=0; i<n; i++) {
          //cout << "Why" << edges[curExplore][i] << endl;
          if(edges[curExplore][i] > 0 && activation[i] == 0) {
            //cout << i+1 << " " << min(edges[curExplore][i], activation[curExplore]) << endl;
            queue.push_back(i);
            goesBefore[i] = curExplore;
            activation[i] = min(edges[curExplore][i], activation[curExplore]);
            if(i == n-1) {
              reachEnd = true;
              break;
            }
          }
        }
        if(queue.size() == 0 && !reachEnd) {
          finished = true;
          break;
        }
        else if(!reachEnd) {
          curExplore = queue[0];
          queue.pop_front();
        }
      }
      if (reachEnd && !finished) {
        int curBackTrack = n-1;
        int curSubtract = activation[n-1];
        res += curSubtract;
        while (curBackTrack != -1) {
          int cur = goesBefore[curBackTrack];
          edges[cur][curBackTrack] -= curSubtract;
          edges[curBackTrack][cur] += curSubtract;
          curBackTrack = cur;
        }
      }
    }
    cout << res << endl;
}

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