結果
| 問題 | No.2955 Pizza Delivery Plan |
| ユーザー |
 sibasyun
|
| 提出日時 | 2025-01-20 21:48:57 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 83 ms / 2,000 ms |
| コード長 | 5,952 bytes |
| コンパイル時間 | 5,650 ms |
| コンパイル使用メモリ | 283,192 KB |
| 実行使用メモリ | 33,280 KB |
| 最終ジャッジ日時 | 2025-01-20 21:49:06 |
| 合計ジャッジ時間 | 8,327 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 28 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>#include <algorithm>#include <iostream>#include <iomanip>#include <math.h>#include <random>#include <chrono>#include <cstdint>#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace std;using namespace atcoder;using namespace __gnu_pbds;using mint = modint998244353;// using mint = modint1000000007;using str = string;using vi = vector<int>;using vvi = vector<vector<int>>;using vvvi = vector<vector<vector<int>>>;using vl = vector<long long>;using vvl = vector<vector<long long>>;using vvvl = vector<vector<vector<long long>>>;using vm = vector<mint>;using vvm = vector<vector<mint>>;using vvvm = vector<vector<vector<mint>>>;using vs = vector<string>;using vvs = vector<vector<string>>;using ll = long long;using pd_ds_set_int = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;using pd_ds_set_ll = tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update>;template <class T> using max_heap = priority_queue<T>;template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rep2(i, f, n) for (int i = (int) f; i < (int)(n); i++)#define repd(i, n, l) for (int i = (int) n; i >= (int) l; i--)#define all(p) p.begin(),p.end()vector<pair<int, int>> dydx{ {-1, 0}, {1, 0}, {0, -1 }, {0, 1} };const ll inf = 1LL << 60;void print() { putchar(' '); }void print(bool a) { printf("%d", a); }void print(int a) { printf("%d", a); }void print(unsigned a) { printf("%u", a); }void print(long a) { printf("%ld", a); }void print(long long a) { printf("%lld", a); }void print(unsigned long long a) { printf("%llu", a); }void print(char a) { printf("%c", a); }void print(char a[]) { printf("%s", a); }void print(const char a[]) { printf("%s", a); }void print(float a) { printf("%.15f", a); }void print(double a) { printf("%.15f", a); }void print(long double a) { printf("%.15Lf", a); }void print(const string& a) { for (auto&& i : a) print(i); }template<class T> void print(const complex<T>& a) { if (a.real() >= 0) print('+'); print(a.real()); if (a.imag() >= 0) print('+'); print(a.imag());print('i'); }template<class T> void print(const vector<T>&);template<class T, size_t size> void print(const array<T, size>&);template<class T, class L> void print(const pair<T, L>& p);template<class T, size_t size> void print(const T(&)[size]);template<class T> void print(const vector<T>& a) { if (a.empty()) return; print(a[0]); for (auto i = a.begin(); ++i != a.end(); ) { putchar(' ');print(*i); } }template<class T> void print(const deque<T>& a) { if (a.empty()) return; print(a[0]); for (auto i = a.begin(); ++i != a.end(); ) { putchar(' ');print(*i); } }template<class T, size_t size> void print(const array<T, size>& a) { print(a[0]); for (auto i = a.begin(); ++i != a.end(); ) { putchar(' '); print(*i); } }template<class T, class L> void print(const pair<T, L>& p) { print(p.first); putchar(' '); print(p.second); }template<class T, size_t size> void print(const T(&a)[size]) { print(a[0]); for (auto i = a; ++i != end(a); ) { putchar(' '); print(*i); } }template<class T> void print(const T& a) { cout << a; }constexpr ll ten(int n) {return n == 0 ? 1 : ten(n - 1) * 10;}bool MASKI(int mask, int i) {return (mask >> i) & 1;}bool MASKL(ll mask, int i) {return (mask >> (ll)i) & 1;}template <typename T>vector<T> compress_coordinate(vector<T>& A) {int n = A.size();vector<T> B(n);rep(i, n) B[i] = A[i];sort(B.begin(), B.end());B.erase(unique(B.begin(), B.end()), B.end());return B;}vector<vector<int>> unweighted_graph(int n, int m) {vector<vector<int>> ret(n);while (m--) {int a, b;cin >> a >> b;a--; b--;ret[a].push_back(b);ret[b].push_back(a);}return ret;}vector<vector<pair<int, long long>>> weighted_graph(int n, int m) {vector<vector<pair<int, long long>>> ret(n);while (m--) {int a, b;long long c;cin >> a >> b >> c;a--, b--;ret[a].push_back({ b, c });ret[b].push_back({ a, c });}return ret;}template<typename T>int argmin(vector<T>& a) {T mi = *min_element(all(a));for (int i = 0; i < a.size(); i++) {if (a[i] == mi) return i;}}template<typename T>int argmax(vector<T>& a) {T ma = *max_element(all(a));for (int i = 0; i < a.size(); i++) {if (a[i] == ma) return i;}}int main() {using vd = vector<double>;using vvd = vector<vd>;using vvvd = vector<vvd>;int N, K;cin >> N >> K;const double infd = 1e18;vector<double> X(N + 1), Y(N + 1);rep2(i, 1, N + 1) cin >> X[i] >> Y[i];vector<vector<double>> D(N + 1, vector<double>(N + 1));rep(i, N + 1) rep(j, N + 1) {if (i == j) {D[i][j] = 0.0;}else {D[i][j] = hypot(X[i] - X[j], Y[i] - Y[j]);}}vvvd dp(N, vvd(K + 1, vd(1 << (N), infd))); //rep(i, N){dp[i][K-1][(1<<i)] = D[0][i+1];}rep(mask, 1 << N) {rep(v, N) {if (!MASKI(mask, v)) continue;rep(k, K + 1) {if (dp[v][k][mask] == infd) continue;rep(u, N) {if (MASKI(mask, u)) continue;int nmask = mask | (1 << u);if (k >= 1) dp[u][k - 1][nmask] = min(dp[u][k - 1][nmask], dp[v][k][mask] + D[u + 1][v + 1]);dp[u][K - 1][nmask] = min(dp[u][K - 1][nmask], dp[v][k][mask] + D[0][v + 1] + D[0][u + 1]);}}}}double ans = infd;rep(k, K + 1) rep(v, N) {ans = min(ans, dp[v][k][(1 << N) - 1] + D[v + 1][0]);}cout << fixed << setprecision(10) << ans << endl;}