oj.uz

답안 #853976

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
853976 2023-09-25T17:50:00 Z NotLinux Magneti (COCI21_magneti) C++17
110 / 110
 326 ms 204636 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e4 + 7;
const int mod = 1e9 + 7;
inline void add(int &x , int &y , int coef){
	x = (x + y * coef % mod) % mod;
}
inline int fastpow(int a , int b){
	if(b == 0)return 1;
	if(b == 1)return a;
	int val = fastpow(a,b/2);
	return val * val % mod * (b&1?a:1) % mod;
}
void solve(){
	int fact[N],invfact[N];
	fact[0] = invfact[0] = 1;
	for(int i = 1;i<N;i++){
		fact[i] = fact[i-1] * i % mod;
		invfact[i] = fastpow(fact[i] , mod-2);
	}

	function < int (int , int) > Cr = [&](int n , int r){//n tane sepete , x tane top
		return fact[n] * invfact[r] % mod * invfact[n-r] % mod;
	};

	int n,l;
	cin >> n >> l;
	int arr[n];
	for(int i = 0;i<n;i++){
		cin >> arr[i];
	}
	sort(arr , arr + n);
	int dp[n+1][n+1][l+5];
	memset(dp , 0 , sizeof(dp));
	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++){
				/*if(dp[i][j][k]){
					cout << i << " " << j << " " << k << " => " << dp[i][j][k] << endl;
				}*/
				//create a new component
				add(dp[i+1][j+1][k + 1] , dp[i][j][k] , j+1);
				//add to the right and left
				if((k + arr[i]) <= l){
					add(dp[i+1][j][k + arr[i]] , dp[i][j][k] , 2 * j % mod);
				}
				//merge two components
				if(j > 1 and (k + 2 * arr[i] - 1) <= l){
					add(dp[i+1][j-1][k + 2 * arr[i] - 1] , dp[i][j][k] , j-1);
				}
			}
		}
	}
	int ans = 0;
	for(int i = 0;i<l;i++){//i = boşluk miktarı
		int locans = dp[n][1][l - i] * Cr(n + i, n) % mod;
		add(ans , locans , 1);
	}
	cout << ans << endl;
}
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	int testcase = 1;//cin >> testcase;
	while(testcase--)solve();
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 204636 KB Output is correct
2 Correct 4 ms 1628 KB Output is correct
3 Correct 15 ms 9820 KB Output is correct
4 Correct 4 ms 2396 KB Output is correct
5 Correct 18 ms 11784 KB Output is correct
6 Correct 92 ms 60456 KB Output is correct
7 Correct 120 ms 101968 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 56 ms 49032 KB Output is correct
10 Correct 2 ms 604 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 10076 KB Output is correct
2 Correct 3 ms 1120 KB Output is correct
3 Correct 15 ms 10076 KB Output is correct
4 Correct 4 ms 1884 KB Output is correct
5 Correct 14 ms 10076 KB Output is correct
6 Correct 4 ms 2140 KB Output is correct
7 Correct 14 ms 10088 KB Output is correct
8 Correct 3 ms 1372 KB Output is correct
9 Correct 4 ms 2088 KB Output is correct
10 Correct 3 ms 856 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2656 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 6 ms 2652 KB Output is correct
4 Correct 4 ms 1632 KB Output is correct
5 Correct 5 ms 2648 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 5 ms 2652 KB Output is correct
8 Correct 3 ms 860 KB Output is correct
9 Correct 3 ms 1372 KB Output is correct
10 Correct 2 ms 860 KB Output is correct

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 204636 KB Output is correct
2 Correct 4 ms 1628 KB Output is correct
3 Correct 15 ms 9820 KB Output is correct
4 Correct 4 ms 2396 KB Output is correct
5 Correct 18 ms 11784 KB Output is correct
6 Correct 92 ms 60456 KB Output is correct
7 Correct 120 ms 101968 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 56 ms 49032 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 14 ms 10076 KB Output is correct
12 Correct 3 ms 1120 KB Output is correct
13 Correct 15 ms 10076 KB Output is correct
14 Correct 4 ms 1884 KB Output is correct
15 Correct 14 ms 10076 KB Output is correct
16 Correct 4 ms 2140 KB Output is correct
17 Correct 14 ms 10088 KB Output is correct
18 Correct 3 ms 1372 KB Output is correct
19 Correct 4 ms 2088 KB Output is correct
20 Correct 3 ms 856 KB Output is correct
21 Correct 5 ms 2656 KB Output is correct
22 Correct 3 ms 1116 KB Output is correct
23 Correct 6 ms 2652 KB Output is correct
24 Correct 4 ms 1632 KB Output is correct
25 Correct 5 ms 2648 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 5 ms 2652 KB Output is correct
28 Correct 3 ms 860 KB Output is correct
29 Correct 3 ms 1372 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 324 ms 204300 KB Output is correct
32 Correct 208 ms 124704 KB Output is correct
33 Correct 326 ms 204100 KB Output is correct
34 Correct 65 ms 42612 KB Output is correct
35 Correct 315 ms 204284 KB Output is correct
36 Correct 19 ms 12636 KB Output is correct
37 Correct 321 ms 204284 KB Output is correct
38 Correct 51 ms 32876 KB Output is correct
39 Correct 312 ms 204288 KB Output is correct
40 Correct 94 ms 61276 KB Output is correct
41 Correct 313 ms 204112 KB Output is correct
42 Correct 4 ms 1880 KB Output is correct
43 Correct 313 ms 204116 KB Output is correct
44 Correct 31 ms 21080 KB Output is correct
45 Correct 314 ms 204116 KB Output is correct
46 Correct 3 ms 1116 KB Output is correct
47 Correct 71 ms 61276 KB Output is correct
48 Correct 34 ms 27480 KB Output is correct
49 Correct 6 ms 4700 KB Output is correct
50 Correct 3 ms 1116 KB Output is correct