Lemonade Trade

#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
/*struct MaxFlow{
	vector<vector<ll>> f;
	vector<vector<int>>g;
	vector<int> used;
	int cc;
	ll flow(int x,int t,ll fl,ll miv){
		if(x==t)return fl;
		üsed[c]=cc;
		for(int nx:g[x]){
			if(used[nx]!=cc&&d[x][nx]>=miv){
				ll r=flow(nx,t,min(fl,f[x][nx]),miv);
				if(r>0){
					f[x][nx]-=r;f[nx][x]+=r;
					return r;
				}
			}
		}
		return 0;
	}
	ll getMaxFlow(int source,int sink,ll maxv){
		cc=1;
		ll r=0;
		ll k=1;
		while(k*2<=maxv)k*=2;
		for(;k>0;k/=2){
			while(ll t=dlow(source,sink,maxv,k)){
				r+=t;cc++;
			}
			cc++
		}
		return r;
	}
	void addEdge(int a,int b,ll c){
		if(f[a][b]==0 && f[b][a]==0){
			g[a].push_back(b);
			g[b].push_back(a);
		}
		f[a][b]+=c;
	}
	MaxFlow(int n) :f(n+1),g(n+1),used(n+1){
		for(int i=1;i<=n;i++){
			f[i]=vector<ll>(n+1);
		}
	}
};*/
#define double long double
map<string, double> c;

int main() {
	int n;
	cin >> n;
	c["pink"] = 0;
	for(int i=0;i<n;i++) {
		string a,b;double l;
		cin>>b>>a>>l;
		l = log(l);
		if(!c.count(a))continue;
		if(c.count(b))c[b]=max(c[b],c[a]+l);
		else c[b]=c[a]+l;
	}
	if (c.count("blue"))
		cout<<setprecision(15)<<fixed<<min(max(exp(c["blue"]), (double)(0)), (double)(10.0))<<endl;
	else
		cout << "0.00000000000000000000" << 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: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED