oj.uz

Submission #380986

# Submission time Handle Problem Language Result Execution time Memory
380986 2021-03-24T06:14:10 Z pure_mem Skyscraper (JOI16_skyscraper) C++14
100 / 100
 123 ms 50924 KB 
#include <bits/stdc++.h>

#define X first
#define Y second
#define MP make_pair
#define ll long long

using namespace std;

const int N = 103;
const int mod = 1e9 + 7;

int n, d, a[N];
ll dp[N][N][1001][3];

int main () {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> d;
	for(int i = 1;i <= n;i++)
		cin >> a[i];
	sort(a + 1, a + n + 1);
	if(n == 1)
		return cout << 1, 0;
	a[n + 1] = 10000;
	dp[0][0][0][0] = 1;
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= i;j++){
			for(int k = 0;k <= d;k++){
				for(int m = 0;m < 3;m++){
					int cost = (2 * j - m) * (a[i + 1] - a[i]);
					if(cost > k || i + j + 1 - m > n)
						continue;
					dp[i][j][k][m] += dp[i - 1][j - 1][k - cost][m];
					if(m)
						dp[i][j][k][m] += (3 - m) * dp[i - 1][j - 1][k - cost][m - 1];
					dp[i][j][k][m] += (2 * j - m) * dp[i - 1][j][k - cost][m];
					if(m == 1)
						dp[i][j][k][m] += 2 * j * dp[i - 1][j][k - cost][m - 1];
					if(m == 2){
						if(i == n) 
							dp[i][j][k][m] += dp[i - 1][j][k - cost][m - 1];
						else if(j > 1)
							dp[i][j][k][m] += (j - 1) * dp[i - 1][j][k - cost][m - 1];
					}
					if(m == 2){
						if(i == n)
							dp[i][j][k][m] += dp[i - 1][j + 1][k - cost][m];
						else
							dp[i][j][k][m] += j * (j - 1) * dp[i - 1][j + 1][k - cost][m];
					}
					else if(m == 1)
						dp[i][j][k][m] += j * j * dp[i - 1][j + 1][k - cost][m];
					else
						dp[i][j][k][m] += j * (j + 1) * dp[i - 1][j + 1][k - cost][m];
					dp[i][j][k][m] %= mod;
				}
			}
		}
	}
	ll ans = 0;
	for(int i = 0;i <= d;i++)
		ans += dp[n][1][i][2];
	cout << ans % mod;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 2 ms 748 KB Output is correct
10 Correct 1 ms 492 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 1 ms 760 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 1 ms 748 KB Output is correct
10 Correct 1 ms 748 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 2 ms 748 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 1 ms 748 KB Output is correct
13 Correct 1 ms 620 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 1 ms 760 KB Output is correct
17 Correct 1 ms 620 KB Output is correct
18 Correct 1 ms 620 KB Output is correct
19 Correct 1 ms 748 KB Output is correct
20 Correct 1 ms 748 KB Output is correct
21 Correct 3 ms 2412 KB Output is correct
22 Correct 72 ms 35948 KB Output is correct
23 Correct 103 ms 47724 KB Output is correct
24 Correct 94 ms 46828 KB Output is correct
25 Correct 123 ms 50796 KB Output is correct
26 Correct 94 ms 46188 KB Output is correct
27 Correct 37 ms 23660 KB Output is correct
28 Correct 45 ms 26988 KB Output is correct
29 Correct 78 ms 41452 KB Output is correct
30 Correct 114 ms 50924 KB Output is correct