oj.uz

답안 #649212

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
649212 2022-10-09T15:34:46 Z boris_mihov NoM (RMI21_nom) C++17
34 / 100
 23 ms 37588 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <set>

typedef long long llong;
const int MAXN = 300 + 10;
const int MOD  = 1e9 + 7;
const int INF  = 1e9;

int n, m;
int fact[MAXN];
int var[MAXN][MAXN];
int comb[MAXN][MAXN];
int dp[MAXN][MAXN][MAXN];
bool bl[MAXN][MAXN][MAXN];
int f(int idx, int zeros, int ones)
{
    if (idx == 0)
    {
        return (zeros == 0 && ones == 0);
    }

    if (bl[idx][zeros][ones])
    {
        return dp[idx][zeros][ones];
    }

    bl[idx][zeros][ones] = true;
    int len = (2*n - idx + 1) / m + (idx != 1);
    for (int addOnes = std::max(0, len - ones) ; addOnes <= std::min(len, zeros) ; ++addOnes)
    {
        dp[idx][zeros][ones] += (((((1LL * f(idx-1, zeros - addOnes, ones + 2*addOnes - len) * comb[len][addOnes]) % MOD) * var[zeros][addOnes]) % MOD) * var[ones][len - addOnes]) % MOD;
        if (dp[idx][zeros][ones] >= MOD) dp[idx][zeros][ones] -= MOD;
    }

    return dp[idx][zeros][ones];
}
void solve()
{
    for (int i = 0 ; i <= n ; ++i)
    {
        comb[i][0] = 1;
    }

    fact[0] = 1;
    for (int i = 1 ; i <= n ; ++i)
    {
        fact[i] = (1LL * fact[i-1] * i) % MOD;
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = 1 ; j <= i ; ++j)
        {
            comb[i][j] = comb[i-1][j] + comb[i-1][j-1];
            if (comb[i][j] >= MOD) comb[i][j] -= MOD;
        }
    }

    for (int i = 0 ; i <= n ; ++i)
    {
        for (int j = 0 ; j <= i ; ++j)
        {
            var[i][j] = (1LL * comb[i][j] * fact[j]) % MOD; 
        }
    }

    int ans = f(m, n, 0);
    for (int i = 1 ; i <= n ; ++i)
    {
        ans *= 2;
        ans %= MOD;
    }

    std::cout << ans << '\n';
}

void read() 
{
    std::cin >> n >> m;
}

void fastIO()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIO();
    read();
    solve();

    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 2900 KB Output is correct
12 Correct 2 ms 2132 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 2132 KB Output is correct
19 Correct 1 ms 468 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 2900 KB Output is correct
12 Correct 2 ms 2132 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 2132 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 2004 KB Output is correct
21 Correct 4 ms 5844 KB Output is correct
22 Correct 18 ms 29524 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 13 ms 18388 KB Output is correct
25 Correct 19 ms 27484 KB Output is correct
26 Correct 2 ms 2504 KB Output is correct
27 Correct 23 ms 37588 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 2900 KB Output is correct
12 Correct 2 ms 2132 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 2132 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 2004 KB Output is correct
21 Correct 4 ms 5844 KB Output is correct
22 Correct 18 ms 29524 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 13 ms 18388 KB Output is correct
25 Correct 19 ms 27484 KB Output is correct
26 Correct 2 ms 2504 KB Output is correct
27 Correct 23 ms 37588 KB Output is correct
28 Runtime error 6 ms 1992 KB Execution killed with signal 11
29 Halted 0 ms 0 KB -

Subtask #5
0 / 48.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 2900 KB Output is correct
12 Correct 2 ms 2132 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 2132 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 2004 KB Output is correct
21 Correct 4 ms 5844 KB Output is correct
22 Correct 18 ms 29524 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 13 ms 18388 KB Output is correct
25 Correct 19 ms 27484 KB Output is correct
26 Correct 2 ms 2504 KB Output is correct
27 Correct 23 ms 37588 KB Output is correct
28 Runtime error 6 ms 1992 KB Execution killed with signal 11
29 Halted 0 ms 0 KB -