Amsterdam Distance

input/code.cpp: In function 'int main()':
input/code.cpp:30:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < offers.size(); ++i) {
                                  ^
input/code.cpp:69:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < revised.size(); ++i) {
                                   ^

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <math.h>
#include <iomanip>

const long double inf = 1e9;

int main() {
	int n;
	std::cin >> n;
	std::vector<std::pair<std::pair<std::string, std::string>, long double>> offers;
	std::vector<std::pair<std::pair<int, int>, long double>> revised;
	std::vector<std::string> strings;
	strings.push_back("blue");
	strings.push_back("pink");
	for (int i = 0; i < n; ++i) {
		std::string a, b;
		long double ratio;
		std::cin >> a >> b >> ratio;
		strings.push_back(a);
		strings.push_back(b);
		offers.push_back({{a, b}, ratio});
	}
	std::sort(strings.begin(), strings.end());
	strings.erase(std::unique(strings.begin(), strings.end()), strings.end());
	int m = strings.size();
	for (int i = 0; i < offers.size(); ++i) {
		int low = 0;
		int high = m - 1;
		while(low != high) {
			int mid = (low + high) / 2;
			if (strings[mid] < offers[i].first.first) {
				low = mid + 1;
			} else {
				high = mid;
			}
		}
		int first = low;
		low = 0;
		high = m - 1;
		while(low != high) {
			int mid = (low + high) / 2;
			if (strings[mid] < offers[i].first.second) {
				low = mid + 1;
			} else {
				high = mid;
			}
		}
		int second = low;
		revised.push_back({{first, second}, offers[i].second});
	}
	int pink = -1;
	int blue = -1;
	for (int i = 0; i < m; ++i) {
		if (strings[i] == "pink") {
			pink = i;
		} else if (strings[i] == "blue") {
			blue = i;
		}
	}
	std::vector<long double> amounts (m);
	for (int i = 0; i < m; ++i) {
		amounts[i] = -inf;
	}
	amounts[pink] = 0;
	for (int i = 0; i < revised.size(); ++i) {
		int o = revised[i].first.first;
		int w = revised[i].first.second;
		// std::cout << o << ' ' << w << ' ' << amounts[o] << ' ' << amounts[w] << ' ' << log(revised[i].second) << '\n';
		amounts[o] = std::max(amounts[o], amounts[w] + log(revised[i].second));
	}
	/*
	std::cout << pink << ' ' << blue << '\n';
	for (int i = 0; i < m; ++i) {
		std::cout << amounts[i] << ' ';
	}
	std::cout << '\n';
	*/
	if (amounts[blue] > log(10)) {
		std::cout << 10 << '\n';
	} else {
		std::cout << std::fixed << std::setprecision(20) << exp(amounts[blue]) << '\n';
	}
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER