#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll LINF = 1e18; template ostream& operator << (ostream& out,const pair& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template ostream& operator << (ostream& out,const vector V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template ostream& operator << (ostream& out,const vector > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template ostream& operator << (ostream& out,const map mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ typedef long double ld; typedef pll Point; inline ll norm_l1(Point p1,Point p2){ return abs(p1.first-p2.first)+abs(p1.second-p2.second); } ld solve(){ ld res = INF; ll x,y; cin >> x >> y; Point p(x,y); int N; cin >> N; vector ps(N); vector w(N); for(int i = 0; i < N;i++){ cin >> x >> y; ps[i] = Point(x,y); cin >> w[i]; } ld W = accumulate(w.begin(),w.end(),0.f); vector> dp(1<(N,INF)); for(int i = 0; i < N;i++) dp[1<=INF) continue; ll haveW = W; for(int k = 0; k < N;k++) if(i>>k&1) haveW -= w[k]; for(int k = 0; k < N;k++){ if(i>>k&1) continue; dp[i|(1<