結果

問題 No.824 Many Shifts Hard
ユーザー hitonanodehitonanode
提出日時 2019-04-26 22:39:59
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 296 ms / 2,000 ms
コード長 5,071 bytes
コンパイル時間 1,938 ms
コンパイル使用メモリ 180,052 KB
実行使用メモリ 7,808 KB
最終ジャッジ日時 2024-11-25 05:16:28
合計ジャッジ時間 4,813 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 5 ms
6,816 KB
testcase_03 AC 56 ms
6,820 KB
testcase_04 AC 57 ms
6,816 KB
testcase_05 AC 197 ms
6,816 KB
testcase_06 AC 8 ms
6,820 KB
testcase_07 AC 52 ms
6,816 KB
testcase_08 AC 139 ms
6,816 KB
testcase_09 AC 154 ms
6,816 KB
testcase_10 AC 17 ms
6,820 KB
testcase_11 AC 40 ms
6,816 KB
testcase_12 AC 74 ms
6,820 KB
testcase_13 AC 87 ms
6,816 KB
testcase_14 AC 155 ms
6,820 KB
testcase_15 AC 136 ms
6,820 KB
testcase_16 AC 5 ms
6,816 KB
testcase_17 AC 154 ms
6,820 KB
testcase_18 AC 2 ms
6,820 KB
testcase_19 AC 156 ms
6,820 KB
testcase_20 AC 296 ms
7,808 KB
testcase_21 AC 7 ms
6,816 KB
testcase_22 AC 296 ms
7,680 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#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> 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> 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> ostream &operator<<(ostream &os, const unordered_set<T> &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> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
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); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))

constexpr lint MOD = 1000000007;
vector<lint> fac, facInv, inv;
void facInit(int nmax)
{
    fac = facInv = inv = vector<lint>(nmax + 1, 1);
    for (int i = 2; i <= nmax; i++)
    {
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        facInv[i] = facInv[i-1] * inv[i] % MOD;
    }
}
lint nCr(int n, int r)
{
    if (n<r || r<0) return 0;
    if (n >= (int)fac.size()) facInit(n);
    return (fac[n] * facInv[r] % MOD) * facInv[n-r] % MOD;
}
lint nPr(int n, int r)
{
    if (n<r || r<0) return 0;
    if (n >= (int)fac.size()) facInit(n);
    return fac[n] * facInv[n-r] % MOD;
}
lint power(lint x, lint n, lint mod=MOD)
{
    lint ans = 1;
    while (n>0)
    {
        if (n & 1) (ans *= x) %= mod;
        (x *= x) %= mod;
       n >>= 1;
    }
   return ans;
}
lint doublefac(lint n)
{
    if (n < 0) return 0;
    lint k = (n + 1) / 2;
    if (n & 1) return fac[k * 2] * power(facInv[2], k) % MOD * power(fac[k], MOD - 2) % MOD;
    else return fac[k] * power(facInv[2], k) % MOD;
}

lint Catalan(int n)
{
    return (nCr(2 * n, n) - nCr(2 * n, n - 1) + MOD) % MOD;
}

int main()
{
    lint N, K;
    cin >> N >> K;
    facInit(N);

    vector<vector<vector<lint>>> dp;
    ndarray(dp, 2, K + 3, K + 3);
    dp[0][0][0] = 1;
    dp[1][0][0] = 1;
    REP(t, K)
    {
        IREP(i, t + 1) IREP(j, i + 1)
        {
            if (j < i) (dp[1][i][j + 1] += dp[1][i][j]) %= MOD;
            (dp[1][i][j] *= N - 1) %= MOD;
        }
        vector<vector<lint>> dp_nxt;
        ndarray(dp_nxt, K + 3, K + 3);
        IREP(i, t + 1) IREP(j, i + 1) // 下がi回，着目中がj回落ちた
        {
            (dp[1][i + 1][j] += dp[0][i][j]) %= MOD;
            (dp[0][i + 1][j] += dp[0][i][j]) %= MOD;
            if (j < i) (dp[0][i][j + 1] += dp[0][i][j]) %= MOD;
            (dp[0][i][j] *= (N > 1 ? N - 2 : 0LL)) %= MOD;
        }
    }
    lint ret = 0;
    FOR(i, 1, N + 1)
    {
        FOR(j, 0, K) if (i + j <= N) (ret += i * dp[1][j][j]) %= MOD;
    }
    cout << ret << endl;
}
0