oj.uz

Submission #850935

# Submission time Handle Problem Language Result Execution time Memory
850935 2023-09-17T23:34:01 Z Itamar NoM (RMI21_nom) C++14
9 / 100
 12 ms 33624 KB 
#include <iostream>
using namespace std;
#include <vector>
#define ll long long
#define pll pair<ll,ll>
#define vll vector<ll>

const int siz = 2001;
ll dp[siz][siz];
ll fac[siz];
ll c[siz][siz];
const int mod = 1e9 + 7;
int main()
{
    int n, m;
    cin >> n >> m;
    dp[0][0] = 1;
    fac[0] = 1;
    for (int i = 1; i < siz; i++) {
        fac[i] = (i * fac[i - 1]) % mod;
    }
    for (int i = 0; i < siz; i++) {
        for (int j = 0; j < siz; j++) {
            if (j == 0)c[i][j] = 1;
            else if (i == 0)c[i][j] = 0;
            else c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
        }
    }
    for (int i = 1; i <= m; i++) {
        int pile = ((2 * n) / m) + (i <= (2 * n) % m);
        for (int j = 0; j <= 2 * n; j++) {
            for (int k = 0; k<=j && j+pile>=2*k&& k<=pile; k++) {
                dp[i][j] += (((dp[i - 1][j +pile-2*k] * ((c[j+pile-2*k][j-k]*fac[pile-k])%mod)) % mod) * c[pile][k]) % mod;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        dp[m][0]=(2*dp[m][0])%mod;
    }
    dp[m][0] = (dp[m][0] * fac[n]) % mod;
    cout << dp[m][0];

}

// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu

// Tips for Getting Started: 
//   1. Use the Solution Explorer window to add/manage files
//   2. Use the Team Explorer window to connect to source control
//   3. Use the Output window to see build output and other messages
//   4. Use the Error List window to view errors
//   5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
//   6. In the future, to open this project again, go to File > Open > Project and select the .sln file

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 33368 KB Output is correct
2 Correct 9 ms 33624 KB Output is correct
3 Correct 10 ms 33368 KB Output is correct
4 Correct 9 ms 33368 KB Output is correct
5 Correct 9 ms 33368 KB Output is correct
6 Correct 10 ms 33372 KB Output is correct
7 Correct 9 ms 33368 KB Output is correct
8 Correct 10 ms 33368 KB Output is correct
9 Correct 9 ms 33452 KB Output is correct
10 Correct 9 ms 33372 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 33368 KB Output is correct
2 Correct 9 ms 33624 KB Output is correct
3 Correct 10 ms 33368 KB Output is correct
4 Correct 9 ms 33368 KB Output is correct
5 Correct 9 ms 33368 KB Output is correct
6 Correct 10 ms 33372 KB Output is correct
7 Correct 9 ms 33368 KB Output is correct
8 Correct 10 ms 33368 KB Output is correct
9 Correct 9 ms 33452 KB Output is correct
10 Correct 9 ms 33372 KB Output is correct
11 Correct 10 ms 33368 KB Output is correct
12 Correct 10 ms 33368 KB Output is correct
13 Incorrect 10 ms 33360 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 33368 KB Output is correct
2 Correct 9 ms 33624 KB Output is correct
3 Correct 10 ms 33368 KB Output is correct
4 Correct 9 ms 33368 KB Output is correct
5 Correct 9 ms 33368 KB Output is correct
6 Correct 10 ms 33372 KB Output is correct
7 Correct 9 ms 33368 KB Output is correct
8 Correct 10 ms 33368 KB Output is correct
9 Correct 9 ms 33452 KB Output is correct
10 Correct 9 ms 33372 KB Output is correct
11 Correct 10 ms 33368 KB Output is correct
12 Correct 10 ms 33368 KB Output is correct
13 Incorrect 10 ms 33360 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 33368 KB Output is correct
2 Correct 9 ms 33624 KB Output is correct
3 Correct 10 ms 33368 KB Output is correct
4 Correct 9 ms 33368 KB Output is correct
5 Correct 9 ms 33368 KB Output is correct
6 Correct 10 ms 33372 KB Output is correct
7 Correct 9 ms 33368 KB Output is correct
8 Correct 10 ms 33368 KB Output is correct
9 Correct 9 ms 33452 KB Output is correct
10 Correct 9 ms 33372 KB Output is correct
11 Correct 10 ms 33368 KB Output is correct
12 Correct 10 ms 33368 KB Output is correct
13 Incorrect 10 ms 33360 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 33368 KB Output is correct
2 Correct 9 ms 33624 KB Output is correct
3 Correct 10 ms 33368 KB Output is correct
4 Correct 9 ms 33368 KB Output is correct
5 Correct 9 ms 33368 KB Output is correct
6 Correct 10 ms 33372 KB Output is correct
7 Correct 9 ms 33368 KB Output is correct
8 Correct 10 ms 33368 KB Output is correct
9 Correct 9 ms 33452 KB Output is correct
10 Correct 9 ms 33372 KB Output is correct
11 Correct 10 ms 33368 KB Output is correct
12 Correct 10 ms 33368 KB Output is correct
13 Incorrect 10 ms 33360 KB Output isn't correct
14 Halted 0 ms 0 KB -