oj.uz

Submission #746324

# Submission time Handle Problem Language Result Execution time Memory
746324 2023-05-22T10:52:12 Z Trunkty Magneti (COCI21_magneti) C++14
0 / 110
 8 ms 4172 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

int n,l,ans,mod=1e9+7;
int arr[55];
int dp[55][10005];

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> l;
    for(int i=1;i<=n;i++){
        cin >> arr[i];
    }
    sort(arr+1,arr+n+1);
    dp[1][1] = 1;
    for(int i=2;i<=n;i++){
        for(int j=0;j<=l;j++){
            if(j>=arr[i]){
                dp[i][j] += dp[i-1][j-arr[i]]*2LL;
                dp[i][j] %= mod;
            }
            if(j>=arr[i]*2LL-1LL){
                dp[i][j] += dp[i-1][j-arr[i]*2LL+1LL]*(i-2LL);
                dp[i][j] %= mod;
            }
        }
    }
    for(int j=0;j<=l;j++){
        ans += dp[n][j]*(l-j+1LL);
        ans %= mod;
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 4172 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 980 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 4172 KB Output isn't correct
2 Halted 0 ms 0 KB -