結果

問題 No.1413 Dynamic Sushi
ユーザー iiljjiiljj
提出日時 2021-02-28 22:04:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,784 ms / 4,000 ms
コード長 9,857 bytes
コンパイル時間 1,607 ms
コンパイル使用メモリ 145,068 KB
実行使用メモリ 5,888 KB
最終ジャッジ日時 2024-10-02 22:28:45
合計ジャッジ時間 32,570 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1,280 ms
5,760 KB
testcase_02 AC 3 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 1,665 ms
5,760 KB
testcase_05 AC 1,313 ms
5,760 KB
testcase_06 AC 1,342 ms
5,888 KB
testcase_07 AC 1,423 ms
5,888 KB
testcase_08 AC 1,429 ms
5,888 KB
testcase_09 AC 1,470 ms
5,760 KB
testcase_10 AC 1,315 ms
5,888 KB
testcase_11 AC 1,392 ms
5,888 KB
testcase_12 AC 1,628 ms
5,888 KB
testcase_13 AC 1,784 ms
5,632 KB
testcase_14 AC 1,492 ms
5,888 KB
testcase_15 AC 1,517 ms
5,632 KB
testcase_16 AC 1,437 ms
5,888 KB
testcase_17 AC 1,458 ms
5,888 KB
testcase_18 AC 1,581 ms
5,760 KB
testcase_19 AC 1,420 ms
5,888 KB
testcase_20 AC 604 ms
5,248 KB
testcase_21 AC 7 ms
5,248 KB
testcase_22 AC 1,431 ms
5,760 KB
testcase_23 AC 1,663 ms
5,888 KB
testcase_24 AC 1,505 ms
5,888 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

void tsp(ll n, function<ld(ld, ll, ll)> dist) {
    ld LDINF = INF;
    vvld dp(1 << n, vld(n, LDINF)); // [state, last] -> (min of max, min of sum, ...)
    dp[1 << (n - 1)][n - 1] = 0;    // 出発地点がノード n 限定の場合
    REP(state, 1, 1 << n) REP(from, 0, n) {
        if (~state & (1 << from)) continue;     // 未訪問
        if (dp[state][from] == LDINF) continue; // from が最後になるような巡回で state に至ることが不能
        REP(to, 0, n) {
            if (state & (1 << to)) continue; // 訪問済み
            chmin(dp[state | (1 << to)][to], dist(dp[state][from], from, to));
        }
    }

    pprint(*min_element(ALL(dp[(1 << n) - 1])));
}

template <class tProposition, typename T = ld> T binarySearchDoubleMax(T left, T right, tProposition p) {
    if (right < left) return -1;
    if (!p(left)) return -1;
    if (p(right)) return right;
    T mid = left;
    ll cnt = 0;
    ld cntmax = log2l((right - left) / EPS);
    while (abs(right - left) > EPS) { // 誤差がしきい値を超える限り
        mid = (left + right) / 2;
        if (p(mid))
            left = mid;
        else
            right = mid;
        if (++cnt >= cntmax) break;
    }
    return mid;
}

// Problem
void solve() {
    VAR(ll, n, w); //
    vld x(n + 1), y(n + 1), r(n + 1), v(n + 1), a(n + 1);
    REP(i, 0, n) cin >> x[i] >> y[i] >> r[i] >> v[i] >> a[i];
    x[n] = y[n] = r[n] = v[n] = a[n] = 0;

    auto dist = [&](ld prev, ll from, ll to) -> ld {
        ld theta = (v[from] * prev + a[from]) * PI / 180;
        ld sx = x[from] + r[from] * cosl(theta);
        ld sy = y[from] + r[from] * sinl(theta);

        ld dx = x[to] - sx;
        ld dy = y[to] - sy;
        ld d = sqrtl(dx * dx + dy * dy);
        ld tl = max(0.0l, (d - r[to]) / w);
        ld tu = (d + r[to]) / w;

        ld t = binarySearchDoubleMax(tl - EPS, tu + EPS, [&](ld mid) {
            ld rad = (v[to] * (prev + mid) + a[to]) * PI / 180;
            ld xt = x[to] + r[to] * cosl(rad);
            ld yt = y[to] + r[to] * sinl(rad);

            ld dxt = xt - sx;
            ld dyt = yt - sy;
            ld dt = sqrtl(dxt * dxt + dyt * dyt);
            return mid * w <= dt;
        });
        return prev + t;
    };

    tsp(n + 1, dist);
}

// entry point
int main() {
    solve();
    return 0;
}
0