Internet connection

input/code.cpp: In function 'int main()':
input/code.cpp:57:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0; i < cp.size()-1; ++i) {
                    ~~^~~~~~~~~~~~~

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
typedef long long ll;

const int N = 105;
const ll LINF = 1000000000000000005;

int n, m;
vector<int> g[N];
ll d[N][N];
int v[N];
vector<int> cp;

ll res = 0;

ll dfs(int s, int t, ll thr, int cvis, ll cmin) {
	if (v[s] == cvis) return -1;
	v[s] = cvis;
	cp.push_back(s);
	if (s == t) return cmin;

	for (int a : g[s]) {
		if (d[s][a] < thr) continue;
		ll cres = dfs(a, t, thr, cvis, min(cmin, d[s][a]));
		if (cres != -1) return cres;
	}

	cp.pop_back();
	return -1;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	ll cthr = 0;
	for (int i = 0; i < m; ++i) {
		int a, b;
		ll c;
		cin >> a >> b >> c;
		g[a].push_back(b);
		g[b].push_back(a);
		d[a][b] += c;
		d[b][a] = 0;
		cthr += c;
	}
	int cvis = 0;
	while (true) {
		cvis++;
		cp.clear();
		ll minw = dfs(1, n, cthr, cvis, LINF);
		if (minw != -1) {
			res += minw;
			for (int i = 0; i < cp.size()-1; ++i) {
				d[cp[i]][cp[i+1]] -= minw;
				d[cp[i+1]][cp[i]] += minw;
			}
		}
		else {
			if (cthr == 1) break;
			cthr /= 2;
		}
	}
	cout << res << "\n";
	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: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED