#584139 (C++17) No.155 生放送とBGM

提出ソース

結果

問題	No.155 生放送とBGM
ユーザー	haruki_K
提出日時	2020-11-25 22:13:56
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	373 ms / 6,000 ms
コード長	5,461 bytes
コンパイル時間	2,373 ms
コンパイル使用メモリ	212,848 KB
実行使用メモリ	11,008 KB
最終ジャッジ日時	2024-07-23 19:27:54
合計ジャッジ時間	5,376 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	360 ms 11,008 KB
testcase_01	AC	364 ms 11,008 KB
testcase_02	AC	373 ms 11,008 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	14 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	359 ms 11,008 KB
testcase_07	AC	3 ms 6,944 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	5 ms 6,940 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	6 ms 6,944 KB
testcase_12	AC	7 ms 6,944 KB
testcase_13	AC	3 ms 6,940 KB
testcase_14	AC	270 ms 9,600 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x,l,r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> {
    vector<T> &data() { return this->c; }
    void clear() { this->c.clear(); }
};
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
const int dx[] = { 1,0,-1,0,1,-1,-1,1 };
const int dy[] = { 0,1,0,-1,1,1,-1,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
// [a,b]
template <class Int> Int rand(Int a, Int b) { static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); }
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }
// <<<

int32_t main() {
    int n, L; scanf("%lld %lld\n", &n, &L); L *= 60;
    vector<int> a(n);
    rep (i,n) {
        int m, s; scanf("%lld:%lld", &m, &s);
        a[i] = m*60+s;
    }

    if (n == 1 or sumof(all(a)) <= L) quit(n);

    auto dp = make_v<int, 2>(n + 1, L);
    dp[0][0] = 1;
    rep (i,n) repR (j,n) repR (k,L) {
        if (k+a[i] < L) dp[j+1][k+a[i]] += dp[j][k];
    }

    vector<ld> fact(n + 1);
    fact[0] = 1;
    rep (i,n) fact[i+1] = fact[i] * (i+1);
    auto C = [&](int n, int k) {
        assert(0 <= k && k <= n);
        return fact[n] / (fact[k] * fact[n-k]);
    };

    ld ans = 0;
    rep (i,n) {
        rep (j,n) rep (k,L) {
            if (k+a[i] < L) dp[j+1][k+a[i]] -= dp[j][k];
        }

        ld E = 0;
        rep (j,n) rep (k,L) {
            E += dp[j][k] / C(n-1, j) / n;
        }
        ans += E;

        repR (j,n) repR (k,L) {
            if (k+a[i] < L) dp[j+1][k+a[i]] += dp[j][k];
        }
    }

    cout << ans << endl;

}

yukicoder

結果

テストケース

ソースコード