#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define endl '\n' #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end()) typedef long long ll; typedef long double ld; typedef pair P; typedef complex comp; typedef vector< vector > matrix; struct pairhash { public: template size_t operator()(const pair &x) const { size_t seed = hash()(x.first); return hash()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2); } }; const int inf = 1e9 + 9; const ll mod = 1e9 + 7; const double eps = 1e-8; const double pi = acos(-1); int n; int x[15], y[15]; double w[15]; double wsum = 0; double s[1<<15]; int d[15][15]; double solve() { n++; for (int i = 1; i < n; i++) wsum += w[i]; for (int i = 0; i < 1<>j)&1) t -= w[j]; } s[i] = t; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { d[i][j] = abs(x[i]-x[j]) + abs(y[i]-y[j]); } } double dp[1<>j)&1) { for (int k = 0; k < n; k++) { if (k != j && (i>>k)&1) { dp[i][j] = min(dp[i][j], dp[i^(1<> x[0] >> y[0]; cin >> n; for (int i = 1; i <= n; i++) cin >> x[i] >> y[i] >> w[i]; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); input(); cout << solve() << endl; }