結果

問題 No.1413 Dynamic Sushi
コンテスト
ユーザー heno239
提出日時 2021-02-28 21:33:46
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,451 bytes
コンパイル時間 2,586 ms
コンパイル使用メモリ 145,804 KB
最終ジャッジ日時 2025-01-19 08:28:18
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 14 WA * 11
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
//#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#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++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ld dp[1 << 12][12];
void solve() {
	int n;ld w; cin >> n >> w;
	vector<ld> x(n), y(n), r(n), v(n), a(n);
	rep(i, n) {
		cin >> x[i] >> y[i] >> r[i] >> v[i] >> a[i];
	}
	auto calc = [&](ld cx, ld cy, ld t,int id)->ld {
		ld dx = abs(cx - x[id]);
		ld dy = abs(cy - y[id]);
		ld dist = sqrtl(dx * dx + dy * dy);
		ld le = (dist - r[id]) / w; if (le < 0)le = 0;
		ld ri = (dist + r[id]) / w;
		rep(aa, 50) {
			ld mid = (le + ri) / 2;
			ld nx = x[id] + r[id] * cosl((v[id] * (t + mid) + a[id]) * pi / 180.0);
			ld ny = y[id] + r[id] * sinl((v[id] * (t + mid) + a[id]) * pi / 180.0);
			ld dx = abs(nx - cx);
			ld dy = abs(ny - cy);
			ld dist = sqrtl(dx * dx + dy * dy);
			if (dist <= w * mid) {
				ri = mid;
			}
			else {
				le = mid;
			}
		}
		return le;
	};
	rep(i, (1 << n))rep(j, n)dp[i][j] = INF;
	rep(i, n)dp[(1 << i)][i] = calc(0, 0, 0, i);
	for (int i = 1; i < (1 << n); i++) {
		rep(j, n) {
			if (i & (1 << j)) {
				ld t = dp[i][j];
				ld cx = x[j] + r[j] * cosl((v[j] * t + a[j]) * pi / 180.0);
				ld cy = y[j] + r[j] * sinl((v[j] * t + a[j]) * pi / 180.0);
				rep(k, n) {
					if (k & (1 << i))continue;
					ld cost = calc(cx, cy, t, k);
					int ni = i ^ (1 << k);
					dp[ni][k] = min(dp[ni][k], t + cost);
				}
			}
		}
	}
	ld ans = INF;
	rep(i, n)ans = min(ans, dp[(1 << n) - 1][i]);
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i,t)
	solve();
	return 0;
}
0