Submission #886960

# Submission time Handle Problem Language Result Execution time Memory
886960 2023-12-13T09:11:42 Z Alora Magneti (COCI21_magneti) C++17
110 / 110
93 ms 12688 KB
#include <bits/stdc++.h>
#define Alora "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define all(v) v.begin(), v.end()
#define pb push_back
#define maxn 10088
const int M = 1e9 + 7;
using namespace std;
int n, l, r[55];
ll res, C[55][maxn], gt[55], dp[2][55][maxn];
void add(ll &x, ll y){x = (x + y) % M;}
ll mul(ll x, ll y) {return x*y % M;}

void pre(){
    fi(i, 1, l + n) C[0][i] = 1;
    C[1][1] = 1;
    fi(i, 2, l + n){
        fi(j, 1, min(50, i)){
            add(C[j][i], C[j][i - 1] + C[j - 1][i - 1]);
        }
    }
    gt[0] = 1;
    fi(i, 1, n) gt[i] = 1ll*gt[i - 1]*i % M;
}

void sub1(){
    if(n == 1) {cout << l; exit(0);}
    int len = l - (1 + r[1]*(n - 1));
    if(len < 0){cout << 0; exit(0);}
    len += n;
    cout << C[n][len]*gt[n] % M;
    exit(0);
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	if(fopen(Alora".inp", "r")){
    freopen(Alora".inp", "r", stdin);
    freopen(Alora".out", "w", stdout);}
    cin >> n >> l;
    pre();
    fi(i, 1, n) cin >> r[i];
    sort(r + 1, r + n + 1);
    if(r[1] == r[n]) sub1();
    dp[0][0][0] = 1;
    int t = 0;
    fi(i, 1, n){
        t ^= 1;
        dp[t][0][0] = 0;
        fi(j, 1, i){
            fi(d, 1, l){
                dp[t][j][d] = dp[1 - t][j - 1][d - 1]; // add new
                if(d >= r[i]) add(dp[t][j][d], mul(dp[1 - t][j][d - r[i]], 2*j)); // add
                if(d >= 2*r[i] - 1) add(dp[t][j][d], mul(dp[1 - t][j + 1][d - 2*r[i] + 1], (j + 1)*j)); // connect
            }
        }
    }
    fi(d, 1, l) add(res, mul(dp[t][1][d], C[n][l - d + n]));
    cout << res;
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen(Alora".inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:46:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |     freopen(Alora".out", "w", stdout);}
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 1 ms 3160 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct
10 Correct 1 ms 3164 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 7512 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 6 ms 7516 KB Output is correct
4 Correct 3 ms 6544 KB Output is correct
5 Correct 6 ms 7516 KB Output is correct
6 Correct 2 ms 5724 KB Output is correct
7 Correct 6 ms 7516 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 2 ms 6032 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 1 ms 3160 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct
10 Correct 1 ms 3164 KB Output is correct
11 Correct 6 ms 7512 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Correct 6 ms 7516 KB Output is correct
14 Correct 3 ms 6544 KB Output is correct
15 Correct 6 ms 7516 KB Output is correct
16 Correct 2 ms 5724 KB Output is correct
17 Correct 6 ms 7516 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 2 ms 6032 KB Output is correct
20 Correct 1 ms 3420 KB Output is correct
21 Correct 2 ms 4952 KB Output is correct
22 Correct 1 ms 4696 KB Output is correct
23 Correct 2 ms 4956 KB Output is correct
24 Correct 1 ms 4696 KB Output is correct
25 Correct 2 ms 4952 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 2 ms 4956 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 1 ms 4700 KB Output is correct
30 Correct 1 ms 4696 KB Output is correct
31 Correct 89 ms 12528 KB Output is correct
32 Correct 56 ms 10068 KB Output is correct
33 Correct 87 ms 12624 KB Output is correct
34 Correct 19 ms 7772 KB Output is correct
35 Correct 93 ms 12688 KB Output is correct
36 Correct 7 ms 7004 KB Output is correct
37 Correct 88 ms 12672 KB Output is correct
38 Correct 15 ms 6236 KB Output is correct
39 Correct 86 ms 12668 KB Output is correct
40 Correct 26 ms 9036 KB Output is correct
41 Correct 86 ms 12612 KB Output is correct
42 Correct 2 ms 5208 KB Output is correct
43 Correct 86 ms 12624 KB Output is correct
44 Correct 10 ms 7000 KB Output is correct
45 Correct 88 ms 12588 KB Output is correct
46 Correct 3 ms 7000 KB Output is correct
47 Correct 10 ms 12124 KB Output is correct
48 Correct 5 ms 8028 KB Output is correct
49 Correct 3 ms 6748 KB Output is correct
50 Correct 1 ms 4700 KB Output is correct