Lennot

input/code.cpp: In function 'int main()':
input/code.cpp:29:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < prices.size(); i++) {
                    ^
input/code.cpp: In function 'void recursive(int, std::vector<int>, std::vector<int>)':
input/code.cpp:41:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < costlist.size(); i++) {
                     ^
input/code.cpp:54:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < flist[curcity].size(); i++) {
                     ^
input/code.cpp:61:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < cango.size(); i++) {
                     ^

#include <iostream>
#include <map>
#include <vector>

using namespace std;

int city, flights;
vector<int> prices;
map<int, vector<vector<int>>> flist;

int main() {

	cin.sync_with_stdio(false);
	cin >> city >> flights;

	for (int i = 0; i < flights; i++) {
		int a, b, c;
		cin >> a >> b >> c;

		flist[a].push_back({b,c});
	}

	void recursive(int curcity, vector<int> visited, vector<int> costlist);

	vector<int> visited(city, 0);
	recursive(1, visited, {});

	int cheap = prices[0];
	for (int i = 0; i < prices.size(); i++) {
		if (prices[i] < cheap) {
			cheap = prices[i];
		}
	}
	cout << cheap;
}

void recursive(int curcity, vector<int> visited, vector<int> costlist) {
	if (curcity == city) {
		bool free = false;
		int total = 0;
		for (int i = 0; i < costlist.size(); i++) {
			if (free) {
				free = false;
			}
			else {
				total += costlist[i];
				free = true;
			}
		}
		prices.push_back(total);
	}
	else {
		vector<int> cango;
		for (int i = 0; i < flist[curcity].size(); i++) {
			if (visited[flist[curcity][i][0]-1] == 0) {
				cango.push_back(i);
			}
		}
		visited[curcity-1] = 1;
		
		for (int i = 0; i < cango.size(); i++) {
			costlist.push_back(flist[curcity][cango[i]][1]);
			recursive(flist[curcity][cango[i]][0], visited, costlist);
		}
	}
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: RUNTIME ERROR

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: RUNTIME ERROR