oj.uz

Submission #862629

# Submission time Handle Problem Language Result Execution time Memory
862629 2023-10-18T16:37:56 Z AbdelmagedNour Magneti (COCI21_magneti) C++17
110 / 110
 35 ms 5208 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
typedef long long ll;
const int N=12005,mod=(1e9)+7;
ll Fact[N],inv[N];
void preprocess(){
    Fact[0]=Fact[1]=inv[0]=inv[1]=1;
    for(int i=2;i<N;i++){
        Fact[i]=i*Fact[i-1]%mod;
        inv[i]=mod-mod/i*inv[mod%i]%mod;
    }
    for(int i=2;i<N;i++)inv[i]=inv[i]*inv[i-1]%mod;
}
ll nCr(int n,int r){
    return Fact[n]*inv[n-r]%mod*inv[r]%mod;
}
ll dp[N][55];
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
    preprocess();
	int n,l;
	cin>>n>>l;
    int a[n+1]={};
	for(int i=1;i<=n;i++)cin>>a[i];
    sort(a+1,a+n+1);
    dp[0][0]=1;
    for(int i=1;i<=n;i++){
        for(int k=l;k>=1;k--){
            for(int j=1;j<=i;j++){
                dp[k][j]=dp[k-1][j-1];
                if(k>=(2*a[i]-1))(dp[k][j]+=dp[k-(2*a[i]-1)][j+1]*j*(j+1)+dp[k-a[i]][j]*2LL*j)%=mod;
                else if(k>=a[i])(dp[k][j]+=dp[k-a[i]][j]*2LL*j)%=mod;
            }
        }
        dp[0][0]=0;
    }
    ll res=0;
    for(int i=1;i<=l;i++)res+=dp[i][1]*nCr(n+l-i,n)%mod;
    cout<<(res%mod);
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 4700 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 3 ms 4188 KB Output is correct
4 Correct 3 ms 4696 KB Output is correct
5 Correct 3 ms 1884 KB Output is correct
6 Correct 12 ms 4444 KB Output is correct
7 Correct 9 ms 2976 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 3 ms 2396 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5208 KB Output is correct
2 Correct 2 ms 2736 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 2 ms 3928 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 5 ms 4720 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 600 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 4700 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 3 ms 4188 KB Output is correct
4 Correct 3 ms 4696 KB Output is correct
5 Correct 3 ms 1884 KB Output is correct
6 Correct 12 ms 4444 KB Output is correct
7 Correct 9 ms 2976 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 3 ms 2396 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 4 ms 5208 KB Output is correct
12 Correct 2 ms 2736 KB Output is correct
13 Correct 4 ms 4956 KB Output is correct
14 Correct 2 ms 3928 KB Output is correct
15 Correct 4 ms 4956 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 5 ms 4720 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 2908 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 856 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 35 ms 4700 KB Output is correct
32 Correct 24 ms 3676 KB Output is correct
33 Correct 32 ms 4700 KB Output is correct
34 Correct 11 ms 3420 KB Output is correct
35 Correct 34 ms 4932 KB Output is correct
36 Correct 4 ms 3420 KB Output is correct
37 Correct 33 ms 4700 KB Output is correct
38 Correct 5 ms 1372 KB Output is correct
39 Correct 32 ms 4960 KB Output is correct
40 Correct 11 ms 4444 KB Output is correct
41 Correct 31 ms 4956 KB Output is correct
42 Correct 1 ms 1624 KB Output is correct
43 Correct 32 ms 4960 KB Output is correct
44 Correct 5 ms 3420 KB Output is correct
45 Correct 31 ms 4700 KB Output is correct
46 Correct 2 ms 4700 KB Output is correct
47 Correct 5 ms 3912 KB Output is correct
48 Correct 2 ms 1628 KB Output is correct
49 Correct 2 ms 4188 KB Output is correct
50 Correct 1 ms 604 KB Output is correct