結果
問題 | No.134 走れ!サブロー君 |
ユーザー | Ryuichiro Chiba |
提出日時 | 2021-02-27 00:16:43 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 26 ms / 5,000 ms |
コード長 | 4,622 bytes |
コンパイル時間 | 1,099 ms |
コンパイル使用メモリ | 105,492 KB |
実行使用メモリ | 5,504 KB |
最終ジャッジ日時 | 2024-10-02 16:36:26 |
合計ジャッジ時間 | 1,896 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 3 ms
5,248 KB |
testcase_05 | AC | 4 ms
5,248 KB |
testcase_06 | AC | 6 ms
5,248 KB |
testcase_07 | AC | 13 ms
5,248 KB |
testcase_08 | AC | 26 ms
5,504 KB |
testcase_09 | AC | 26 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 1 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
ソースコード
// {{{ #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <climits> #include <iostream> #include <iomanip> #include <algorithm> #include <vector> #include <list> #include <set> #include <unordered_set> #include <map> #include <unordered_map> #include <queue> #include <stack> #include <string> #include <numeric> #include <complex> #include <utility> #include <type_traits> #include <functional> using namespace std; #define fi first #define se second #define pb push_back #define mp make_pair #define FOR(i, a, b) for(ll i = static_cast<ll>(a); i < static_cast<ll>(b); ++i) #define FORR(i, a, b) for(ll i = static_cast<ll>(a); i >= static_cast<ll>(b); --i) #define REP(i, n) FOR(i, 0, n) #define REPR(i, n) FORR(i, n, 0) #define ALL(x) (x).begin(), (x).end() #define DBG(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl; using ll = long long; using ull = unsigned long long; using P = pair<int, int>; using LP = pair<ll, ll>; using IP = pair<int, P>; using LLP = pair<ll, LP>; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, 1, -1}; constexpr int INF = 100000000; constexpr ll LINF = 10000000000000000ll; constexpr int MOD = static_cast<int>(1e9 + 7); constexpr double EPS = 1e-9; // {{{ popcount static int popcount(int x) { return __builtin_popcount(static_cast<unsigned int>(x)); } static int popcount(unsigned int x) { return __builtin_popcount(x); } static int popcount(long x) { return __builtin_popcountl(static_cast<unsigned long>(x)); } static int popcount(unsigned long x) { return __builtin_popcountl(x); } static int popcount(long long x) { return __builtin_popcountll(static_cast<unsigned long long>(x)); } static int popcount(unsigned long long x) { return __builtin_popcountll(x); } // }}} // template specialization of std::hash for std::pair namespace std { template<typename T, typename U> struct hash<pair<T, U> > { size_t operator()(const pair<T, U> &key) const noexcept { size_t h1 = hash<T>()(key.first); size_t h2 = hash<U>()(key.second); return h1 ^ (h2 << 1); } }; } // namespace std // print vector template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { size_t sz = v.size(); os << "["; for (size_t i = 0; i < sz-1; i++) { os << v[i] << ", "; } os << v[sz-1] << "]"; return os; } // print array (except char literal) template< typename T, int N, typename std::enable_if<!std::is_same<T, char>::value, std::nullptr_t>::type = nullptr> ostream &operator<<(ostream &os, const T (&v)[N]) { os << "["; for (size_t i = 0; i < N-1; i++) { os << v[i] << ", "; } os << v[N-1] << "]"; return os; } // print array template<typename T> void printArray(T *arr, size_t sz) { cerr << "["; for (size_t i = 0; i < sz-1; i++) { cerr << arr[i] << ","; } if (sz > 0) cerr << arr[sz-1]; cerr << "]" << endl; } // print pair template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << "(" << p.first << ", " << p.se << ")"; return os; } static inline ll mod(ll x, ll m) { ll y = x % m; return (y >= 0 ? y : y+m); } struct Compare { //vector<ll> &x_, &y_; //Compare(vector<ll> &x, vector<ll> &y): x_(x), y_(y) {} //bool operator()(const P &lhs, const P &rhs) { // return x_[lhs.fi]+y_[lhs.se] < x_[rhs.fi]+y_[rhs.se]; //} bool operator()(const int x, const int y) { return x < y; } }; // print floating-point number // cout << fixed << setprecision(12) << // }}} int N; P p[14]; double w[14]; double dp[1<<14][14]; void solve() { REP (i, 1<<(N+1)) REP (j, N+1) dp[i][j] = LINF; dp[0][0] = 0; double W = 0; REP (i, N) W += w[i+1]; REP (S, 1<<(N+1)) { REP (i, N+1) { if (S & (1<<i)) continue; REP (j, N+1) { if (!(S == 0 && j == 0) && !(S & (1<<j))) continue; double WW = W; REP (k, N+1) { if (S & (1<<k)) WW -= w[k]; } double v = (WW + 100) / 120; double d = abs(p[i].fi-p[j].fi) + abs(p[i].se-p[j].se); dp[S|(1<<i)][i] = min(dp[S|(1<<i)][i], dp[S][j] + v*d + w[i]); } } } cout << fixed << setprecision(12) << dp[(1<<(N+1))-1][0] << endl; } int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> p[0].fi >> p[0].se; cin >> N; REP (i, N) cin >> p[i+1].fi >> p[i+1].se >> w[i+1]; solve(); return 0; } // vim:set foldmethod=marker: