oj.uz

Submission #857770

# Submission time Handle Problem Language Result Execution time Memory
857770 2023-10-06T22:11:20 Z divad NoM (RMI21_nom) C++14
100 / 100
 73 ms 63320 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9+7;
const int NMAX = 2e3+2;
int n,m,cnt[NMAX];
/// dp[i][j] = cate imperecheri pot obtine cu primele i resturi si sa ramana j neimperecheata

struct Mint{
    int val;
    Mint(){
        val = 0;
    }
    Mint(int _val){
        val = _val%MOD;
    }
    Mint operator * (Mint oth) {
        return (val * oth.val);
    }
    Mint operator * (int oth) {
        oth %= MOD;
        return (val * oth);
    }
    Mint operator + (Mint oth) {
        return (val + oth.val);
    }
    Mint operator - (Mint oth) {
        return (val + MOD - oth.val);
    }
    Mint operator = (int oth){
        val = oth;
        val %= MOD;
        return *this;
    }
    Mint operator += (Mint oth){
        val += oth.val;
        val %= MOD;
        return *this;
    }
} fact[2*NMAX], inv[2*NMAX], dp[NMAX][2*NMAX];

Mint lgput(int n, int a){
    if(a == 0){
        return 1ll;
    }else{
        if(a%2 == 0){
            Mint val = lgput(n, a/2);
            return val*val;
        }else{
            return lgput(n, a-1)*n;
        }
    }
}

Mint comb(int n, int m){
    return fact[n]*inv[n-m]*inv[m];
}

Mint aranj(int n, int m){
    return fact[n]*inv[n-m];
}

signed main()
{
    /// 257 15
    fact[0] = 1;
    for(int i = 1; i < NMAX*2; i++){
        fact[i] = fact[i-1]*i;
    }
    inv[NMAX*2-1] = lgput(fact[NMAX*2-1].val, MOD-2);
    for(int i = NMAX*2-2; i >= 0; i--){
        inv[i] = inv[i+1]*(i+1);
    }
    cin >> n >> m;
    for(int i = 1; i <= 2*n; i++){
        cnt[i%m]++;
    }
    dp[0][cnt[0]] = 1;
    int maxi = cnt[0];
    for(int i = 1; i < m; i++){
        for(int k = 0; k <= cnt[i]; k++){
            for(int j = k; j <= maxi; j++){
                /// (i-1, j) -> (i, j-k+(cnt[i]-k))
                dp[i][j-k+(cnt[i]-k)] += dp[i-1][j]*comb(cnt[i], k)*aranj(j, k);
            }
        }
        maxi += cnt[i];
    }
    dp[m-1][0] = dp[m-1][0]*fact[n];
    dp[m-1][0] = dp[m-1][0]*lgput(2, n);
    cout << dp[m-1][0].val;
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 63068 KB Output is correct
2 Correct 8 ms 63068 KB Output is correct
3 Correct 7 ms 63200 KB Output is correct
4 Correct 8 ms 63320 KB Output is correct
5 Correct 8 ms 63172 KB Output is correct
6 Correct 7 ms 63068 KB Output is correct
7 Correct 7 ms 63244 KB Output is correct
8 Correct 8 ms 63224 KB Output is correct
9 Correct 7 ms 63068 KB Output is correct
10 Correct 8 ms 63236 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 63068 KB Output is correct
2 Correct 8 ms 63068 KB Output is correct
3 Correct 7 ms 63200 KB Output is correct
4 Correct 8 ms 63320 KB Output is correct
5 Correct 8 ms 63172 KB Output is correct
6 Correct 7 ms 63068 KB Output is correct
7 Correct 7 ms 63244 KB Output is correct
8 Correct 8 ms 63224 KB Output is correct
9 Correct 7 ms 63068 KB Output is correct
10 Correct 8 ms 63236 KB Output is correct
11 Correct 9 ms 63068 KB Output is correct
12 Correct 8 ms 63068 KB Output is correct
13 Correct 7 ms 63068 KB Output is correct
14 Correct 8 ms 63200 KB Output is correct
15 Correct 7 ms 63068 KB Output is correct
16 Correct 7 ms 63068 KB Output is correct
17 Correct 8 ms 63068 KB Output is correct
18 Correct 8 ms 63068 KB Output is correct
19 Correct 8 ms 63068 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 63068 KB Output is correct
2 Correct 8 ms 63068 KB Output is correct
3 Correct 7 ms 63200 KB Output is correct
4 Correct 8 ms 63320 KB Output is correct
5 Correct 8 ms 63172 KB Output is correct
6 Correct 7 ms 63068 KB Output is correct
7 Correct 7 ms 63244 KB Output is correct
8 Correct 8 ms 63224 KB Output is correct
9 Correct 7 ms 63068 KB Output is correct
10 Correct 8 ms 63236 KB Output is correct
11 Correct 9 ms 63068 KB Output is correct
12 Correct 8 ms 63068 KB Output is correct
13 Correct 7 ms 63068 KB Output is correct
14 Correct 8 ms 63200 KB Output is correct
15 Correct 7 ms 63068 KB Output is correct
16 Correct 7 ms 63068 KB Output is correct
17 Correct 8 ms 63068 KB Output is correct
18 Correct 8 ms 63068 KB Output is correct
19 Correct 8 ms 63068 KB Output is correct
20 Correct 9 ms 63068 KB Output is correct
21 Correct 8 ms 63068 KB Output is correct
22 Correct 9 ms 63068 KB Output is correct
23 Correct 8 ms 63164 KB Output is correct
24 Correct 9 ms 63232 KB Output is correct
25 Correct 8 ms 63068 KB Output is correct
26 Correct 8 ms 63068 KB Output is correct
27 Correct 9 ms 63200 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 63068 KB Output is correct
2 Correct 8 ms 63068 KB Output is correct
3 Correct 7 ms 63200 KB Output is correct
4 Correct 8 ms 63320 KB Output is correct
5 Correct 8 ms 63172 KB Output is correct
6 Correct 7 ms 63068 KB Output is correct
7 Correct 7 ms 63244 KB Output is correct
8 Correct 8 ms 63224 KB Output is correct
9 Correct 7 ms 63068 KB Output is correct
10 Correct 8 ms 63236 KB Output is correct
11 Correct 9 ms 63068 KB Output is correct
12 Correct 8 ms 63068 KB Output is correct
13 Correct 7 ms 63068 KB Output is correct
14 Correct 8 ms 63200 KB Output is correct
15 Correct 7 ms 63068 KB Output is correct
16 Correct 7 ms 63068 KB Output is correct
17 Correct 8 ms 63068 KB Output is correct
18 Correct 8 ms 63068 KB Output is correct
19 Correct 8 ms 63068 KB Output is correct
20 Correct 9 ms 63068 KB Output is correct
21 Correct 8 ms 63068 KB Output is correct
22 Correct 9 ms 63068 KB Output is correct
23 Correct 8 ms 63164 KB Output is correct
24 Correct 9 ms 63232 KB Output is correct
25 Correct 8 ms 63068 KB Output is correct
26 Correct 8 ms 63068 KB Output is correct
27 Correct 9 ms 63200 KB Output is correct
28 Correct 12 ms 63064 KB Output is correct
29 Correct 13 ms 63248 KB Output is correct
30 Correct 15 ms 63068 KB Output is correct
31 Correct 12 ms 63068 KB Output is correct
32 Correct 14 ms 63204 KB Output is correct
33 Correct 16 ms 63064 KB Output is correct
34 Correct 21 ms 63320 KB Output is correct

Subtask #5
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 63068 KB Output is correct
2 Correct 8 ms 63068 KB Output is correct
3 Correct 7 ms 63200 KB Output is correct
4 Correct 8 ms 63320 KB Output is correct
5 Correct 8 ms 63172 KB Output is correct
6 Correct 7 ms 63068 KB Output is correct
7 Correct 7 ms 63244 KB Output is correct
8 Correct 8 ms 63224 KB Output is correct
9 Correct 7 ms 63068 KB Output is correct
10 Correct 8 ms 63236 KB Output is correct
11 Correct 9 ms 63068 KB Output is correct
12 Correct 8 ms 63068 KB Output is correct
13 Correct 7 ms 63068 KB Output is correct
14 Correct 8 ms 63200 KB Output is correct
15 Correct 7 ms 63068 KB Output is correct
16 Correct 7 ms 63068 KB Output is correct
17 Correct 8 ms 63068 KB Output is correct
18 Correct 8 ms 63068 KB Output is correct
19 Correct 8 ms 63068 KB Output is correct
20 Correct 9 ms 63068 KB Output is correct
21 Correct 8 ms 63068 KB Output is correct
22 Correct 9 ms 63068 KB Output is correct
23 Correct 8 ms 63164 KB Output is correct
24 Correct 9 ms 63232 KB Output is correct
25 Correct 8 ms 63068 KB Output is correct
26 Correct 8 ms 63068 KB Output is correct
27 Correct 9 ms 63200 KB Output is correct
28 Correct 12 ms 63064 KB Output is correct
29 Correct 13 ms 63248 KB Output is correct
30 Correct 15 ms 63068 KB Output is correct
31 Correct 12 ms 63068 KB Output is correct
32 Correct 14 ms 63204 KB Output is correct
33 Correct 16 ms 63064 KB Output is correct
34 Correct 21 ms 63320 KB Output is correct
35 Correct 33 ms 63064 KB Output is correct
36 Correct 62 ms 63248 KB Output is correct
37 Correct 33 ms 63068 KB Output is correct
38 Correct 45 ms 63068 KB Output is correct
39 Correct 55 ms 63068 KB Output is correct
40 Correct 73 ms 63068 KB Output is correct