oj.uz

답안 #498653

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498653 2021-12-26T04:44:09 Z model_code NoM (RMI21_nom) C++17
34 / 100
 500 ms 108536 KB 
// nom_naive_slow_popovici.cpp
#include <iostream>
#include <fstream>
#include <algorithm>
 
/*
     Time       O(M * N ^ 3)
     Memory     O(M * N ^ 2)
*/
 
 
constexpr int MOD = (int)1e9 + 7;
constexpr int MAXN = 300;
constexpr int MAXM = 300;
 
int dp[MAXM + 1][MAXN + 1][2 * MAXN + 1];
 
int comb[2 * MAXN + 1][2 * MAXN + 1];
int pow2[2 * MAXN + 1], fact[2 * MAXN + 1];
int counter[MAXM];
 
inline void add(int& x, int y) {
    x += y;
    if (x >= MOD)
        x -= MOD;
}
 
void prec(int N, int M) {
    for (int i = 0; i <= 2 * N; i++) {
        comb[i][0] = 1;
        for (int j = 1; j <= i; j++) {
            add(comb[i][j], comb[i - 1][j]);
            add(comb[i][j], comb[i - 1][j - 1]);
        }
    }
 
    for (int i = 0; i < 2 * N; i++) {
        counter[i % M]++;
    }
 
    pow2[0] = fact[0] = 1;
    for (int i = 1; i <= 2 * N; i++) {
        pow2[i] = (2LL * pow2[i - 1]) % MOD;
        fact[i] = (1LL * i * fact[i - 1]) % MOD;
    }
}
 
 
 
int main() {
    std::istream& fin = std::cin;
    std::ostream& fout = std::cout;
 
    int N, M;
    fin >> N >> M;
 
    prec(N, M);
    
    dp[M][N][0] = 1;
    int used = 0;
 
    for (int rem = M; rem > 0; rem--) {
        used += counter[rem];
        for (int pairs = 0; pairs <= N; pairs++) {
            for (int others = 0; others + 2 * pairs <= 2 * N - used; others++) {
                int need = counter[rem - 1];
                for (int p = std::max(0, need - others); p <= std::min(pairs, need); p++) {
                    // if (need > p + others || need < p)
                    //     continue;
 
                    int current = (1LL * comb[pairs][p] * comb[others][need - p]) % MOD;
                    // current = (1LL * current * pow2[p]) % MOD;
                    current = (1LL * current * dp[rem][pairs][others]) % MOD;
                    add(dp[rem - 1][pairs - p][others + p - (need - p)], current);
                }
            }
        }
    }
 
    int answer = (1LL * dp[0][0][0] * pow2[N]) % MOD;
    for (int rem = 0; rem < M; rem++) {
        answer = (1LL * answer * fact[counter[rem]]) % MOD;
    }
 
    fout << answer << "\n";
 
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 11 ms 7652 KB Output is correct
12 Correct 6 ms 5068 KB Output is correct
13 Correct 1 ms 844 KB Output is correct
14 Correct 3 ms 2764 KB Output is correct
15 Correct 8 ms 6604 KB Output is correct
16 Correct 3 ms 1612 KB Output is correct
17 Correct 5 ms 3404 KB Output is correct
18 Correct 5 ms 5080 KB Output is correct
19 Correct 2 ms 844 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 11 ms 7652 KB Output is correct
12 Correct 6 ms 5068 KB Output is correct
13 Correct 1 ms 844 KB Output is correct
14 Correct 3 ms 2764 KB Output is correct
15 Correct 8 ms 6604 KB Output is correct
16 Correct 3 ms 1612 KB Output is correct
17 Correct 5 ms 3404 KB Output is correct
18 Correct 5 ms 5080 KB Output is correct
19 Correct 2 ms 844 KB Output is correct
20 Correct 19 ms 4844 KB Output is correct
21 Correct 30 ms 16148 KB Output is correct
22 Correct 184 ms 85144 KB Output is correct
23 Correct 75 ms 6588 KB Output is correct
24 Correct 203 ms 52896 KB Output is correct
25 Correct 187 ms 78708 KB Output is correct
26 Correct 63 ms 5744 KB Output is correct
27 Correct 292 ms 108536 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 11 ms 7652 KB Output is correct
12 Correct 6 ms 5068 KB Output is correct
13 Correct 1 ms 844 KB Output is correct
14 Correct 3 ms 2764 KB Output is correct
15 Correct 8 ms 6604 KB Output is correct
16 Correct 3 ms 1612 KB Output is correct
17 Correct 5 ms 3404 KB Output is correct
18 Correct 5 ms 5080 KB Output is correct
19 Correct 2 ms 844 KB Output is correct
20 Correct 19 ms 4844 KB Output is correct
21 Correct 30 ms 16148 KB Output is correct
22 Correct 184 ms 85144 KB Output is correct
23 Correct 75 ms 6588 KB Output is correct
24 Correct 203 ms 52896 KB Output is correct
25 Correct 187 ms 78708 KB Output is correct
26 Correct 63 ms 5744 KB Output is correct
27 Correct 292 ms 108536 KB Output is correct
28 Execution timed out 965 ms 13616 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #5
0 / 48.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 11 ms 7652 KB Output is correct
12 Correct 6 ms 5068 KB Output is correct
13 Correct 1 ms 844 KB Output is correct
14 Correct 3 ms 2764 KB Output is correct
15 Correct 8 ms 6604 KB Output is correct
16 Correct 3 ms 1612 KB Output is correct
17 Correct 5 ms 3404 KB Output is correct
18 Correct 5 ms 5080 KB Output is correct
19 Correct 2 ms 844 KB Output is correct
20 Correct 19 ms 4844 KB Output is correct
21 Correct 30 ms 16148 KB Output is correct
22 Correct 184 ms 85144 KB Output is correct
23 Correct 75 ms 6588 KB Output is correct
24 Correct 203 ms 52896 KB Output is correct
25 Correct 187 ms 78708 KB Output is correct
26 Correct 63 ms 5744 KB Output is correct
27 Correct 292 ms 108536 KB Output is correct
28 Execution timed out 965 ms 13616 KB Time limit exceeded
29 Halted 0 ms 0 KB -