結果

問題 No.134 走れ！サブロー君
コンテスト
ユーザー fumiphys
提出日時 2019-09-15 02:05:19
言語 C++14
(gcc 15.2.0 + boost 1.89.0)
結果
AC  
実行時間 9 ms / 5,000 ms
コード長 3,868 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 1,546 ms
コンパイル使用メモリ 168,656 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-06 22:36:35
合計ジャッジ時間 2,112 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

double x[15], y[15];
double w[15];

double dp[1<<14][15];

int main(int argc, char const* argv[])
{
  cin >> x[0] >> y[0];
  int n;
  cin >> n;
  rep(i, n){
    cin >> x[i+1] >> y[i+1] >> w[i+1];
  }
  double res = 1e18;
  double wsum = 0;
  rep(i, n)wsum += w[i+1];
  rep(i, n){
    double W = wsum;
    dp[bit(i)][i] = (abs(x[i+1]-x[0])+abs(y[i+1]-y[0])) * (W + 100.) / 120.;
  }
  rep(i, bit(n)){
    if(__builtin_popcount(i) <= 1)continue;
    rep(j, n){
      if(!((i >> j) & 1))continue;
      int st = i & (~bit(j));
      dp[i][j] = 1e18;
      double W = 0.;
      rep(k, n){
        if(!((st >> k) & 1))W += w[k+1];
      }
      rep(k, n){
        if((st >> k) & 1){
          double tmp = dp[st][k] + (abs(x[j+1]-x[k+1])+abs(y[j+1]-y[k+1])) * (W + 100.) / 120.;
          dp[i][j] = min(dp[i][j], tmp);
        }
      }
    }
  }
  rep(i, n){
    res = min(res, dp[bit(n)-1][i] + (abs(x[i+1]-x[0]) + abs(y[i+1]-y[0])) / 1.2);
  }
  res += wsum;
  cout << res << endl;
  return 0;
}
0