Submission #1306914

#	Time	Username	Problem	Language	Result	Execution time	Memory
1306914		Double_Slash	Asceticism (JOI18_asceticism)	C++20	49 / 100	171 ms	327680 KiB

asceticism

#pragma GCC optimize("O3,unroll-loops,inline")
#include <bits/stdc++.h>
#pragma GCC target("avx2")

using namespace std;
using ll = long long;

const int M = 1e9 + 7;

int main() {
    int N, K;
    cin >> N >> K;
    ll dp[N + 1][N]{};
    for (int n = 1; n <= N; ++n) {
        dp[n][0] = 1;
        for (int k = n; --k;) {
            dp[n][k] = dp[n - 1][k] * (k + 1) % M + dp[n - 1][k - 1] * (n - k) % M;
        }
    }
    cout << dp[N][K - 1] % M;
}

• Subtask 1: 4 / 4
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 0 / 51