oj.uz

답안 #850363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
850363 2023-09-16T12:41:42 Z serifefedartar Magneti (COCI21_magneti) C++17
110 / 110
 229 ms 219220 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll LOGN = 20;
const ll MAXN = 24000;

ll expo(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1)
            res = (res * a) % MOD;
        a = (a * a) % MOD;
        b /= 2;
    }
    return res;
}
ll fact[MAXN], inv[MAXN]; 
ll dp[55][55][MAXN];

ll nCr(ll n, ll r) {
    if (r > n)
        return 0LL;
    return ((fact[n] * inv[r]) % MOD * inv[n-r]) % MOD;
}

ll dist(ll item, ll plc) {
    return nCr(item + plc - 1, item);
}

vector<ll> seq;
int main() {
    fast
    fact[0] = inv[0] = 1;
    for (ll i = 1; i < MAXN; i++) {
        fact[i] = (fact[i-1] * i) % MOD;
        inv[i] = expo(fact[i], MOD-2); 
    }

    ll N, L;
    cin >> N >> L;

    seq = vector<ll>(N);
    for (int i = 0; i < N; i++)
        cin >> seq[i];
    sort(seq.begin(), seq.end());

    dp[1][1][1] = 1;
    for (int i = 2; i <= N; i++) {
        for (int open = 1; open <= N; open++) {
            for (int len = 1; len <= L; len++) {
                dp[i][open+1][len + 1] = (dp[i][open+1][len + 1] + dp[i-1][open][len]) % MOD;
                dp[i][open][len + seq[i-1]] = (dp[i][open][len + seq[i-1]] + 2 * open * dp[i-1][open][len]) % MOD;

                if (open != 1)
                    dp[i][open-1][len + 2 * seq[i-1] - 1] = (dp[i][open-1][len + 2 * seq[i-1] - 1] + open * (open-1) * dp[i-1][open][len] % MOD) % MOD;
            }
        }
    }

    ll ans = 0;
    for (int d = 1; d <= L; d++) {
        ll ways = dp[N][1][d];
        ans = (ans + ways * dist(L - d, N+1)) % MOD; 
    }
    cout << ans << "\n";
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 211580 KB Output is correct
2 Correct 11 ms 16732 KB Output is correct
3 Correct 13 ms 12916 KB Output is correct
4 Correct 5 ms 5720 KB Output is correct
5 Correct 15 ms 16728 KB Output is correct
6 Correct 67 ms 64752 KB Output is correct
7 Correct 151 ms 206508 KB Output is correct
8 Correct 4 ms 4440 KB Output is correct
9 Correct 85 ms 134128 KB Output is correct
10 Correct 4 ms 4440 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 13400 KB Output is correct
2 Correct 4 ms 4952 KB Output is correct
3 Correct 15 ms 13660 KB Output is correct
4 Correct 5 ms 5468 KB Output is correct
5 Correct 16 ms 13816 KB Output is correct
6 Correct 6 ms 6236 KB Output is correct
7 Correct 13 ms 14172 KB Output is correct
8 Correct 5 ms 5980 KB Output is correct
9 Correct 5 ms 6492 KB Output is correct
10 Correct 4 ms 4444 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 10844 KB Output is correct
2 Correct 6 ms 7004 KB Output is correct
3 Correct 10 ms 10808 KB Output is correct
4 Correct 6 ms 7516 KB Output is correct
5 Correct 10 ms 11268 KB Output is correct
6 Correct 5 ms 6236 KB Output is correct
7 Correct 8 ms 10840 KB Output is correct
8 Correct 4 ms 5208 KB Output is correct
9 Correct 8 ms 8284 KB Output is correct
10 Correct 5 ms 5368 KB Output is correct

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 211580 KB Output is correct
2 Correct 11 ms 16732 KB Output is correct
3 Correct 13 ms 12916 KB Output is correct
4 Correct 5 ms 5720 KB Output is correct
5 Correct 15 ms 16728 KB Output is correct
6 Correct 67 ms 64752 KB Output is correct
7 Correct 151 ms 206508 KB Output is correct
8 Correct 4 ms 4440 KB Output is correct
9 Correct 85 ms 134128 KB Output is correct
10 Correct 4 ms 4440 KB Output is correct
11 Correct 12 ms 13400 KB Output is correct
12 Correct 4 ms 4952 KB Output is correct
13 Correct 15 ms 13660 KB Output is correct
14 Correct 5 ms 5468 KB Output is correct
15 Correct 16 ms 13816 KB Output is correct
16 Correct 6 ms 6236 KB Output is correct
17 Correct 13 ms 14172 KB Output is correct
18 Correct 5 ms 5980 KB Output is correct
19 Correct 5 ms 6492 KB Output is correct
20 Correct 4 ms 4444 KB Output is correct
21 Correct 9 ms 10844 KB Output is correct
22 Correct 6 ms 7004 KB Output is correct
23 Correct 10 ms 10808 KB Output is correct
24 Correct 6 ms 7516 KB Output is correct
25 Correct 10 ms 11268 KB Output is correct
26 Correct 5 ms 6236 KB Output is correct
27 Correct 8 ms 10840 KB Output is correct
28 Correct 4 ms 5208 KB Output is correct
29 Correct 8 ms 8284 KB Output is correct
30 Correct 5 ms 5368 KB Output is correct
31 Correct 229 ms 215240 KB Output is correct
32 Correct 154 ms 135276 KB Output is correct
33 Correct 224 ms 215364 KB Output is correct
34 Correct 47 ms 48224 KB Output is correct
35 Correct 226 ms 215488 KB Output is correct
36 Correct 16 ms 16988 KB Output is correct
37 Correct 218 ms 215516 KB Output is correct
38 Correct 43 ms 46676 KB Output is correct
39 Correct 221 ms 219220 KB Output is correct
40 Correct 66 ms 68320 KB Output is correct
41 Correct 220 ms 219152 KB Output is correct
42 Correct 5 ms 6236 KB Output is correct
43 Correct 221 ms 218472 KB Output is correct
44 Correct 25 ms 26452 KB Output is correct
45 Correct 221 ms 217956 KB Output is correct
46 Correct 4 ms 4700 KB Output is correct
47 Correct 92 ms 128384 KB Output is correct
48 Correct 46 ms 64000 KB Output is correct
49 Correct 9 ms 10332 KB Output is correct
50 Correct 5 ms 5936 KB Output is correct