結果

問題 No.1413 Dynamic Sushi
ユーザー oteraotera
提出日時 2021-03-04 06:01:56
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,757 bytes
コンパイル時間 2,288 ms
コンパイル使用メモリ 206,368 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-04 07:29:26
合計ジャッジ時間 49,654 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 3 ms
6,816 KB
testcase_04 AC 2,112 ms
6,816 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 2,295 ms
6,820 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

/**
 *    author:  otera
**/
#include<bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
const int inf=1e9+7;
const ll INF=1LL<<60;
#define rep(i, n) for(int i = 0; i < n; ++ i)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define pb push_back
#define eb emplace_back
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
#define si(c) (int)(c).size()
inline ll popcnt(ull a){ return __builtin_popcountll(a); }
#define tpow(n) (1LL<<(n))
#define unless(A) if(!(A))
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type>name(__VA_ARGS__)
#define VEC(type,name,size) vector<type>name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template<class T> void scan(T& a){ cin >> a; }
template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }
void print(){ cout << ' '; }
template<class T> void print(const T& a){ cout << a; }
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }
int out(){ cout << '\n'; return 0; }
template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }
#else
#define debug(...)
#define dump(...)
#endif

#define int long long

const ld pi = acos(-1.0);

ld dp[(1<<13)][13];
void solve() {
    INT(n, w); ++ n;
    vc<int> x(n), y(n), r(n), v(n), a(n);
    rep(i, n - 1) {
        in(x[i], y[i], r[i], v[i], a[i]);
    }
    x[n - 1] = y[n - 1] = r[n - 1] = v[n - 1] = a[n - 1] = 0; 
    auto xi = [&](int i, ld t) -> ld {
        ld s = (ld)v[i] * t + (ld)a[i];
        s *= pi / 180.0;
        return (ld)x[i] + (ld)r[i] * cos(s);
    };
    auto yi = [&](int i, ld t) -> ld {
        ld s = (ld)v[i] * t + (ld)a[i];
        s *= pi / 180.0;
        return (ld)y[i] + (ld)r[i] * sin(s);
    };
    auto dist = [&](int i, int j, ld t1, ld t2) -> ld {
        return sqrt(pow(xi(i, t1) - xi(j, t2), 2.0) + pow(yi(i, t1) - yi(j, t2), 2.0));
    };
    rep(i, (1<<13)) rep(j, 13) dp[i][j] = inf;
    dp[tpow(n - 1)][n - 1] = 0.0;
    rep(bit, (1<<n)) {
        rep(i, n) {
            rep(j, n) {
                if(bit & tpow(i) and !(bit & tpow(j))) {
                    ld ti = dp[bit][i];
                    // ld s = (ld)v[j] * ti + (ld)a[j] - ((ld)v[i] * ti + (ld)a[i]);
                    // s *= pi / 180.0;
                    ld ok = 100000.0, ng = 0.0;
                    rep(_, 30) {
                        ld mid = (ok + ng) / 2.0;
                        // ld ss = s + (ld)v[j] * mid * pi / 180.0;
                        // ld di = pow((ld)r[i], 2.0) + pow((ld)r[j], 2.0) - 2.0 * (ld)r[i] * (ld)r[j] * cos(ss);
                        if((ld)w * mid >= dist(i, j, ti, ti + mid)) ok = mid;
                        else ng = mid;
                    }
                    chmin(dp[bit | tpow(j)][j], dp[bit][i] + ok);
                }
            }
        }
    }
    ld ans = inf;
    rep(i, n) chmin(ans, dp[(1<<n) - 1][i]);
    out(ans);
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(20);
    // INT(t); rep(i, t)solve();
    solve();
    return 0;
}
0