# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
442913 | Soumya1 | Zapina (COCI20_zapina) | C++14 | 141 ms | 1728 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int dp[351][351][2];
int c[351][351];
const int mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
c[0][0] = 1;
for (int i = 1; i <= n; i++) {
c[i][0] = c[i][i] = 1;
for (int j = 1; j < i; j++) {
c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
if (c[i][j] >= mod) c[i][j] -= mod;
}
}
dp[0][0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= n; j++) {
for (int k = 0; k <= j; k++) {
if (i == k) {
dp[i][j][1] += (1LL * c[j][k] * (dp[i - 1][j - k][0] + dp[i - 1][j - k][1])) % mod;
if (dp[i][j][1] >= mod) dp[i][j][1] -= mod;
continue;
}
dp[i][j][1] += (1LL * c[j][k] * dp[i - 1][j - k][1]) % mod;
dp[i][j][0] += (1LL * c[j][k] * dp[i - 1][j - k][0]) % mod;
if (dp[i][j][1] >= mod) dp[i][j][1] -= mod;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |