結果
問題 | No.2955 Pizza Delivery Plan |
ユーザー |
|
提出日時 | 2024-11-08 22:52:11 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 377 ms / 2,000 ms |
コード長 | 6,136 bytes |
コンパイル時間 | 3,463 ms |
コンパイル使用メモリ | 286,388 KB |
実行使用メモリ | 81,280 KB |
最終ジャッジ日時 | 2024-11-08 22:52:31 |
合計ジャッジ時間 | 9,391 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 28 |
ソースコード
#line 2 "template.hpp"// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;// https://xn--kst.jp/blog/2019/08/29/cpp-comp/// debug methods// usage: debug(x,y);// vector 出力できるように修正template <typename T>ostream& debug_print(ostream& os, const vector<T>& v) {os << "[";for (size_t i = 0; i < v.size(); ++i) {os << v[i];if (i < v.size() - 1) os << ", ";}os << "]";return os;}template <typename T>ostream& debug_print(ostream& os, const T& var) {os << var;return os;}#define CHOOSE(a) CHOOSE2 a#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x#define debug_1(x1) { cout << #x1 << ": "; debug_print(cout, x1) << endl; }#define debug_2(x1, x2) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << endl; }#define debug_3(x1, x2, x3) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": ";debug_print(cout, x3) << endl; }#define debug_4(x1, x2, x3, x4) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": ";debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << endl; }#define debug_5(x1, x2, x3, x4, x5) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << ", " << #x5 << ": "; debug_print(cout, x5) << endl; }#ifdef LOCAL#define debug(...) CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~))(__VA_ARGS__)#else#define debug(...)#endifusing ll = long long;using vl = vector<ll>;using Graph = vector<vector<ll>>;using P = pair<ll, ll>;#define all(v) v.begin(), v.end()template <typename T> inline bool chmax(T &a, T b) {return ((a < b) ? (a = b, true) : (false));}template <typename T> inline bool chmin(T &a, T b) {return ((a > b) ? (a = b, true) : (false));}#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)// https://trap.jp/post/1224/template <class... T> constexpr auto min(T... a) {return min(initializer_list<common_type_t<T...>>{a...});}template <class... T> constexpr auto max(T... a) {return max(initializer_list<common_type_t<T...>>{a...});}template <class... T> void input(T &...a) { (cin >> ... >> a); }template <class T> void input(vector<T> &a) {for(T &x : a)cin >> x;}void print() { cout << '\n'; }template <class T, class... Ts> void print(const T &a, const Ts &...b) {cout << a;(cout << ... << (cout << ' ', b));cout << '\n';}template <class Container, typename = void>struct is_container : std::false_type {};template <class Container>struct is_container<Container, std::void_t<decltype(std::declval<Container>().begin()), decltype(std::declval<Container>().end())>> : std::true_type{};template <class Container>typename enable_if<is_container<Container>::value>::type print(const Container& x) {if (!x.empty()) {auto it = x.begin();for (; it != prev(x.end()); ++it) {cout << *it << " ";}cout << *it << "\n"; // 最後の要素を出力して改行}}#define INT(...) \int __VA_ARGS__; \input(__VA_ARGS__)#define LL(...) \long long __VA_ARGS__; \input(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \input(__VA_ARGS__)#define REP1(a) for(ll i = 0; i < a; i++)#define REP2(i, a) for(ll i = 0; i < a; i++)#define REP3(i, a, b) for(ll i = a; i < b; i++)#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)#define overload4(a, b, c, d, e, ...) e#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)ll inf = 3e18;vl dx = {1, -1, 0, 0};vl dy = {0, 0, 1, -1};#line 2 "/home/y_midori/cp/yukicoder/452/c.cpp"// #include <atcoder/all>// using namespace atcoder;// using mint = modint998244353;void solve() {LL(n, k);vector<pair<double, double>> xy(n + 1, pair<double, double>(0, 0));rep1(i, n) {cin >> xy[i].first >> xy[i].second;}auto dist = [](pair<double, double> x, pair<double, double> y) {auto [i, j] = x;auto [k, l] = y;return sqrt(pow(i - k, 2) + pow(j - l, 2));};vector dp(n + 1, vector(1LL << n + 1, vector(k + 1, double(inf))));dp[0][1][k] = 0;rep(j, 1LL << (n + 1)) {rep(i, n + 1) {// chmin(dp[i][1LL << i][k-1],dist(xy[0],xy[i]));if((j >> i) & 1 == 0) {continue;}rep(l, k + 1) {chmin(dp[0][j | 1][k], dp[i][j][l] + dist(xy[i], xy[0]));}rep(z, n + 1) {if((j >> z) & 1) {continue;}rep1(l, k) {chmin(dp[z][j | (1LL << z)][l - 1],dp[i][j][l] + dist(xy[i], xy[z]));chmin(dp[0][j | (1LL << z)][k],dp[z][j | (1LL << z)][l - 1] + dist(xy[0], xy[z]));if(dp[i][j][l] != inf) {debug(i, j, z, l);debug(dp[i][j][l], (j | (1LL << z)),dp[z][j | (1LL << z)][l - 1]);}}}rep(l, k + 1) {chmin(dp[0][j | 1][k], dp[i][j][l] + dist(xy[i], xy[0]));}}}// double ans = inf;print(dp[0][(1LL << (n + 1)) - 1][k]);}int main() {ios::sync_with_stdio(false);std::cin.tie(nullptr);cout << std::setprecision(16);int t = 1;rep(_, t) {solve();}}