#623857 (C++17) No.1413 Dynamic Sushi

提出ソース

結果

問題	No.1413 Dynamic Sushi
ユーザー	👑 hitonanode
提出日時	2021-02-28 21:51:02
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	518 ms / 4,000 ms
コード長	7,232 bytes
コンパイル時間	2,319 ms
コンパイル使用メモリ	207,812 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-04-12 10:44:30
合計ジャッジ時間	13,429 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	429 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	469 ms 6,940 KB
testcase_05	AC	472 ms 6,944 KB
testcase_06	AC	487 ms 6,940 KB
testcase_07	AC	496 ms 6,944 KB
testcase_08	AC	486 ms 6,940 KB
testcase_09	AC	504 ms 6,944 KB
testcase_10	AC	472 ms 6,944 KB
testcase_11	AC	497 ms 6,944 KB
testcase_12	AC	509 ms 6,940 KB
testcase_13	AC	506 ms 6,940 KB
testcase_14	AC	515 ms 6,944 KB
testcase_15	AC	510 ms 6,940 KB
testcase_16	AC	494 ms 6,944 KB
testcase_17	AC	512 ms 6,944 KB
testcase_18	AC	518 ms 6,944 KB
testcase_19	AC	500 ms 6,940 KB
testcase_20	AC	209 ms 6,944 KB
testcase_21	AC	4 ms 6,944 KB
testcase_22	AC	468 ms 6,944 KB
testcase_23	AC	502 ms 6,940 KB
testcase_24	AC	503 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
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) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#else
#define dbg(x) (x)
#endif

template <typename T_P> struct P {
    static T_P EPS;
    static void set_eps(T_P e) { EPS = e; }
    T_P x, y;
    P() : x(0), y(0) {}
    P(T_P x, T_P y) : x(x), y(y) {}
    P(std::pair<T_P, T_P> p) : x(p.first), y(p.second) {}
    P operator+(const P &p) const noexcept { return P(x + p.x, y + p.y); }
    P operator-(const P &p) const noexcept { return P(x - p.x, y - p.y); }
    P operator*(const P &p) const noexcept { return P(x * p.x - y * p.y, x * p.y + y * p.x); }
    P operator*(T_P d) const noexcept { return P(x * d, y * d); }
    P operator/(T_P d) const noexcept { return P(x / d, y / d); }
    P inv() const { return conj() / norm2(); }
    P operator/(const P &p) const { return (*this) * p.inv(); }
    bool operator<(const P &r) const noexcept { return x != r.x ? x < r.x : y < r.y; }
    bool operator==(const P &r) const noexcept { return x == r.x and y == r.y; }
    bool operator!=(const P &r) const noexcept { return !((*this) == r); }
    T_P dot(P p) const noexcept { return x * p.x + y * p.y; }
    T_P det(P p) const noexcept { return x * p.y - y * p.x; }
    T_P norm() const noexcept { return std::sqrt(x * x + y * y); }
    T_P norm2() const noexcept { return x * x + y * y; }
    T_P arg() const noexcept { return std::atan2(y, x); }
    // rotate point/vector by rad
    P rotate(T_P rad) noexcept { return P(x * std::cos(rad) - y * std::sin(rad), x * std::sin(rad) + y * std::cos(rad)); }
    P normalized() const { return (*this) / this->norm(); }
    P conj() const noexcept { return P(x, -y); }
    friend std::istream &operator>>(std::istream &is, P &p) {
        T_P x, y;
        is >> x >> y;
        p = P(x, y);
        return is;
    }
    friend std::ostream &operator<<(std::ostream &os, const P &p) {
        os << '(' << p.x << ',' << p.y << ')';
        return os;
    }
};
template <> double P<double>::EPS = 1e-9;

using Float = double;
using Pt = P<Float>;

int N;
Float W;
vector<Pt> X;
vector<Float> R, V, A;

Float ret;
vector<int> eaten;

Pt where(int i, Float sec) {
    return X[i] + Pt(1, 0).rotate((V[i] * sec + A[i]) / 180. * acos(-1)) * R[i];
}

Float sec(Pt pos, Float now, int i) {
    Float lo = now, hi = now + 1000;
    REP(_, 50) {
        Float ss = (lo + hi) / 2;
        if (lo * hi >= 1) ss = sqrt(lo * hi);
        Pt tmp = where(i, ss);
        if ((pos - tmp).norm2() <= W * W * (ss - now) * (ss - now)) hi = ss;
        else lo = ss;
    }
    return hi;
}


int main() {
    cin >> N >> W;
    ret = 1e18;
    eaten.resize(N);
    X.resize(N);
    R.resize(N);
    V.resize(N);
    A.resize(N);
    REP(i, N) cin >> X[i] >> R[i] >> V[i] >> A[i];

    vector<vector<double>> dp(N, vector<double>(1 << N, 1e30));
    REP(i, N) dp[i][1 << i] = sec({0, 0}, 0, i);

    REP(S, 1 << N) {
        REP(j, N) if ((S >> j) & 1) {
            REP(i, N) if (((S >> i) & 1) == 0) {
                chmin(dp[i][S + (1 << i)], sec(where(j, dp[j][S]), dp[j][S], i));
            }
        }
    }
    if (N <= 3) dbg(dp);
    for (auto v : dp) chmin(ret, v.back());
    cout << ret << '\n';
}

yukicoder

結果

テストケース

ソースコード