oj.uz

Submission #852593

# Submission time Handle Problem Language Result Execution time Memory
852593 2023-09-22T07:18:32 Z noyancanturk Magneti (COCI21_magneti) C++17
110 / 110
 219 ms 200452 KB 
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define lim 10000
using namespace std;
const int mod=1000000007ll;

int dist[10055][55];

int sum(int a,int b){
    return ((a%mod)+(b%mod))%mod;
}
int mul(int a,int b){
    return ((a%mod)*(b%mod))%mod;
}

void solve(){
    dist[0][0]=1;
    for(int i=1;i<10055;i++){
        dist[i][0]=1;
        for(int j=1;j<55;j++){
            dist[i][j]=sum(dist[i-1][j-1],dist[i-1][j]);
        }
    }
    int n,l;
    cin>>n>>l;
    int a[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    sort(a,a+n);
    int dp[n][n][l];
    dp[0][0][0]=1;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            for(int k=0;k<l;k++){
                dp[i][j][k]=0;
            }
        }
    }
    dp[0][0][0]=1;
    for(int i=1;i<n;i++){
        dp[i][0][0]=0;
        for(int g=0;g<=i;g++){
            for(int s=1;s<l;s++){
                //cerr<<"0 on "<<i<<" "<<g<<" "<<s<<"\n";
                if(g)dp[i][g][s]=dp[i-1][g-1][s-1];
                else dp[i][g][s]=0;
                //cerr<<dp[i][g][s]<<"\n";
                if(a[i]<=s){
                    //cerr<<"1 on "<<i<<" "<<g<<" "<<s<<"\n";
                    //cerr<<dp[i][g][s]<<" ";
                    dp[i][g][s]=sum(dp[i][g][s],mul(2*(g+1),dp[i-1][g][s-a[i]]));
                    //cerr<<dp[i][g][s]<<"\n";
                }
                if(2*a[i]-1<=s){
                    //cerr<<"2 on "<<i<<" "<<g<<" "<<s<<"\n";
                    //cerr<<dp[i][g][s]<<" ";
                    dp[i][g][s]=sum(dp[i][g][s],mul((g+2)*(g+1),dp[i-1][g+1][s-2*a[i]+1]));
                    //cerr<<dp[i][g][s]<<"\n";
                }
            }
        }
    }
    /*
    cerr<<"\n";
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            for(int k=0;k<l;k++){
                cerr<<dp[i][j][k]<<" ";
            }cerr<<"\n";
        }cerr<<"\n";
    }cerr<<"\n";
    */
    int ans=0;
    for(int i=0;i<l;i++){
        ans=sum(ans,mul(dp[n-1][0][i],dist[l-i+n-1][n]));
        //cerr<<dp[n-1][0][i]<<" "<<dist[l-i+n-1][n]<<"\n";
    }
    cout<<ans<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
#ifdef Local  
    freopen("in","r",stdin);
    freopen("out","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 200452 KB Output is correct
2 Correct 3 ms 5720 KB Output is correct
3 Correct 13 ms 12376 KB Output is correct
4 Correct 4 ms 5976 KB Output is correct
5 Correct 14 ms 14936 KB Output is correct
6 Correct 64 ms 60508 KB Output is correct
7 Correct 74 ms 101712 KB Output is correct
8 Correct 2 ms 4696 KB Output is correct
9 Correct 30 ms 50520 KB Output is correct
10 Correct 2 ms 4696 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12376 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 10 ms 12376 KB Output is correct
4 Correct 3 ms 5720 KB Output is correct
5 Correct 11 ms 12616 KB Output is correct
6 Correct 4 ms 5976 KB Output is correct
7 Correct 10 ms 12380 KB Output is correct
8 Correct 3 ms 5468 KB Output is correct
9 Correct 3 ms 5724 KB Output is correct
10 Correct 3 ms 4696 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6744 KB Output is correct
2 Correct 3 ms 5208 KB Output is correct
3 Correct 5 ms 6748 KB Output is correct
4 Correct 3 ms 5724 KB Output is correct
5 Correct 5 ms 6748 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Correct 5 ms 6748 KB Output is correct
8 Correct 2 ms 4952 KB Output is correct
9 Correct 3 ms 5464 KB Output is correct
10 Correct 3 ms 4952 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 200452 KB Output is correct
2 Correct 3 ms 5720 KB Output is correct
3 Correct 13 ms 12376 KB Output is correct
4 Correct 4 ms 5976 KB Output is correct
5 Correct 14 ms 14936 KB Output is correct
6 Correct 64 ms 60508 KB Output is correct
7 Correct 74 ms 101712 KB Output is correct
8 Correct 2 ms 4696 KB Output is correct
9 Correct 30 ms 50520 KB Output is correct
10 Correct 2 ms 4696 KB Output is correct
11 Correct 11 ms 12376 KB Output is correct
12 Correct 3 ms 4952 KB Output is correct
13 Correct 10 ms 12376 KB Output is correct
14 Correct 3 ms 5720 KB Output is correct
15 Correct 11 ms 12616 KB Output is correct
16 Correct 4 ms 5976 KB Output is correct
17 Correct 10 ms 12380 KB Output is correct
18 Correct 3 ms 5468 KB Output is correct
19 Correct 3 ms 5724 KB Output is correct
20 Correct 3 ms 4696 KB Output is correct
21 Correct 5 ms 6744 KB Output is correct
22 Correct 3 ms 5208 KB Output is correct
23 Correct 5 ms 6748 KB Output is correct
24 Correct 3 ms 5724 KB Output is correct
25 Correct 5 ms 6748 KB Output is correct
26 Correct 2 ms 4696 KB Output is correct
27 Correct 5 ms 6748 KB Output is correct
28 Correct 2 ms 4952 KB Output is correct
29 Correct 3 ms 5464 KB Output is correct
30 Correct 3 ms 4952 KB Output is correct
31 Correct 218 ms 200276 KB Output is correct
32 Correct 145 ms 123572 KB Output is correct
33 Correct 216 ms 200268 KB Output is correct
34 Correct 45 ms 43820 KB Output is correct
35 Correct 216 ms 200272 KB Output is correct
36 Correct 13 ms 15192 KB Output is correct
37 Correct 214 ms 200276 KB Output is correct
38 Correct 36 ms 35556 KB Output is correct
39 Correct 213 ms 200432 KB Output is correct
40 Correct 62 ms 61264 KB Output is correct
41 Correct 210 ms 200240 KB Output is correct
42 Correct 3 ms 5720 KB Output is correct
43 Correct 214 ms 200368 KB Output is correct
44 Correct 23 ms 23128 KB Output is correct
45 Correct 217 ms 200272 KB Output is correct
46 Correct 3 ms 4952 KB Output is correct
47 Correct 40 ms 61428 KB Output is correct
48 Correct 20 ms 30296 KB Output is correct
49 Correct 5 ms 7768 KB Output is correct
50 Correct 3 ms 4952 KB Output is correct