結果

問題 No.398 ハーフパイプ(2)
ユーザー haruki_Kharuki_K
提出日時 2020-02-11 04:07:50
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 17 ms / 2,000 ms
コード長 4,508 bytes
コンパイル時間 1,676 ms
コンパイル使用メモリ 173,392 KB
実行使用メモリ 6,560 KB
最終ジャッジ日時 2023-07-24 11:53:35
合計ジャッジ時間 3,166 ms
ジャッジサーバーID
(参考情報)
judge11 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 15 ms
6,464 KB
testcase_01 AC 15 ms
6,412 KB
testcase_02 AC 17 ms
6,396 KB
testcase_03 AC 17 ms
6,520 KB
testcase_04 AC 16 ms
6,420 KB
testcase_05 AC 16 ms
6,392 KB
testcase_06 AC 16 ms
6,444 KB
testcase_07 AC 16 ms
6,560 KB
testcase_08 AC 16 ms
6,392 KB
testcase_09 AC 16 ms
6,444 KB
testcase_10 AC 16 ms
6,444 KB
testcase_11 AC 16 ms
6,444 KB
testcase_12 AC 16 ms
6,556 KB
testcase_13 AC 16 ms
6,444 KB
testcase_14 AC 16 ms
6,452 KB
testcase_15 AC 16 ms
6,392 KB
testcase_16 AC 16 ms
6,392 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#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) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max()/2-1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
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> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T 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(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
// <<<

int32_t main() {
    const int NN = 101, MM = 401;
    auto dp = make_v<int,3>(NN,MM,5);
    rep (x,NN) {
        dp[x][0][0] = 1;
        rep (i,MM) rep (j,4) rep (k,x+1) {
            if (i+k < MM) dp[x][i+k][j+1] += dp[x][i][j];
        }
    }
    auto combi = [](int n, int a, int b) -> int {
        int ret = 1;
        rep1 (i,n) ret *= i;
        rep1 (i,a) ret /= i;
        rep1 (i,b) ret /= i;
        rep1 (i,n-a-b) ret /= i;
        return ret;
    };

    double x; cin >> x;
    int y = round(4*x);

    int ans = 0;
    rep (mi,101) rep (ma,101) loop (a,1,<=6) loop (b,1,<=6) {
        if (!(mi < ma && a+b <= 6)) continue;
        int sum = y + mi + ma - mi*a - ma*b;
        int c = 6-a-b;
        if (!(c*(mi+1) <= sum && sum <= c*(ma-1))) continue;
        int rest = sum-c*(mi+1);
        int w = (ma-1)-(mi+1);
        ans += combi(6,a,b) * (c == 0 ? 1 : dp[w][rest][c]);
    }

    if (y%4 == 0) ans++;
    cout << ans << endl;
}
0