Internet connection

#include <stdio.h>
#include <iostream>
#include <memory.h>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;

#define sqr(a) ((a) * (a))
#define pi 3.1415926535897932384626433832795

//#define TASK "b"
#define MAXE 1005
#define MAXN 105
const long long cmax = 1e10;

int n, m;
long long fst[MAXN], was[MAXN], nxt[MAXE], en[MAXE], edge[MAXN][MAXN];
long long c[MAXN][MAXN], f[MAXN][MAXN];
int cnt;
int u, t;

void AddEdge(int a, int b, int cap)
{
	nxt[cnt] = fst[a];
	fst[a] = cnt;
	en[cnt] = b;
	edge[a][b] = cnt;
	c[a][b] = cap;
	cnt++;

	nxt[cnt] = fst[b];
	fst[b] = cnt;
	en[cnt] = a;
	edge[a][b] = cnt;
	cnt++;	
}

void Load()
{
	memset(fst, -1, sizeof(fst));
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int a, b, cap;
		cin >> a >> b >> cap;
		AddEdge(a,b,cap);
	}
}

long long dfs(int v, long long cmin)
{
	if (v == t) return cmin;
	was[v] = 1;

	for(int i = fst[v]; i != -1; i = nxt[i])
	{
		if(was[en[i]] == -1 && f[v][en[i]] < c[v][en[i]])
		{
			long long delta = dfs(en[i], min(cmin, c[v][en[i]] - f[v][en[i]]));

			if (delta > 0)
			{
				f[v][en[i]] += delta;
				f[en[i]][v] -= delta;
				return delta;
			}
		}
	}

	return 0;	
}

void Solve()
{
	u = 1, t = n;
	memset(was, -1, sizeof(was));
	
	long long ans = 0;
	long long flow = dfs(u, cmax);
	while( flow > 0)
	{
		memset(was, -1, sizeof(was));
		ans += flow;
		flow = dfs(u, cmax);
	}

	cout << ans;
}

int main()
{
	//freopen(TASK".in", "r", stdin);
	//freopen(TASK".out", "w", stdout);
	
	Load();
	Solve();

	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR