Internet connection

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

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

using namespace std;
#define SIZE 1001

long long g[SIZE][SIZE] = {0};
long long c[SIZE][SIZE] = { 0 };
bool visited[SIZE] = { false };
int end_point = 0;
long long result = 0;
bool solution_found = false;
vector<int> nodes;
long long minimum = 9000000000;




void traverse(int current) {
	if (current == end_point) {

		solution_found = true;
		return;
	}
	vector<pair<int, int>> order;
	for (int i = 1; i <= end_point; i++) {
		if(g[current][i] > 0 && current != i && !visited[i])
			order.push_back(make_pair(g[current][i], i));
	}

	sort(order.rbegin(), order.rend());

	for(auto &i: order){
	//for (int i = 1; i <= end_point; i++) {
		if (g[current][i.second] > 0 && current != i.second && !visited[i.second] && !solution_found && (c[current][i.second] < (g[i.second][current] + g[current][i.second]))) {
			nodes.push_back(i.second);
			if (g[current][i.second] < minimum)
				minimum = g[current][i.second];
			//c[current][i] += 1;
			//g[current][i] -= 1;
			//g[i][current] += 1;
			visited[i.second] = true;
			traverse(i.second);
			visited[i.second] = false;
			if (!solution_found)
				nodes.pop_back();
		}
	}
}

int main() {
	//freopen("cases.txt", "r", stdin);
	int num;
	cin >> end_point >> num;

	for (int i = 0; i < num; i++) {
		int a, b, c;
		cin >> a >> b >> c;
		g[a][b] = c;
	}
	visited[1] = true;

	do {
		solution_found = false;
		nodes.push_back(1);
		traverse(1);
		if (solution_found) {
			for (int i = 0; i < nodes.size() - 1; i++) {
				g[nodes[i]][nodes[i + 1]] -= minimum;
				g[nodes[i + 1]][nodes[i]] += minimum;
				c[nodes[i]][nodes[i + 1]] += minimum;
			}
			result += minimum;
		}
		minimum = 999999999;
		nodes.clear();
	} while (solution_found);

	cout << result << endl;

	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: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED