oj.uz

Submission #1008581

# Submission time Handle Problem Language Result Execution time Memory
1008581 2024-06-26T14:39:16 Z yellowtoad Skyscraper (JOI16_skyscraper) C++17
100 / 100
 260 ms 256336 KB 
#include <iostream>
#include <algorithm>
#define int long long
using namespace std;

const long long mod = 1e9+7;
long long n, m, a[110], dp[110][1010][110][3], sum;

signed main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> a[i];
	if (n == 1) {
		cout << 1 << endl;
		return 0;
	}
	sort(a+1,a+n+1);
	dp[1][0][1][0] = 1;
	dp[1][0][1][1] = 2;
	for (int i = 2; i <= n; i++) {
		for (int j = 0; j <= m; j++) {
			for (int k = 1; k <= n; k++) {
				if (j >= 2*(k-1)*(a[i]-a[i-1])) (dp[i][j][k][0] += dp[i-1][j-2*(k-1)*(a[i]-a[i-1])][k-1][0]*k) %= mod;
				if (j >= 2*(k)*(a[i]-a[i-1])) (dp[i][j][k][0] += dp[i-1][j-2*(k)*(a[i]-a[i-1])][k][0]*2*k) %= mod;
				if (j >= 2*(k+1)*(a[i]-a[i-1])) (dp[i][j][k][0] += dp[i-1][j-2*(k+1)*(a[i]-a[i-1])][k+1][0]*k) %= mod;
				
				if (j >= 2*(k-1)*(a[i]-a[i-1])) (dp[i][j][k][1] += dp[i-1][j-2*(k-1)*(a[i]-a[i-1])][k-1][0]*2) %= mod;
				if (j >= 2*(k)*(a[i]-a[i-1])) (dp[i][j][k][1] += dp[i-1][j-2*(k)*(a[i]-a[i-1])][k][0]*2) %= mod;
				
				if (j >= (2*(k-1)-1)*(a[i]-a[i-1])) (dp[i][j][k][1] += dp[i-1][j-(2*(k-1)-1)*(a[i]-a[i-1])][k-1][1]*(k-1)) %= mod;
				if (j >= (2*(k)-1)*(a[i]-a[i-1])) (dp[i][j][k][1] += dp[i-1][j-(2*(k)-1)*(a[i]-a[i-1])][k][1]*(2*(k)-1)) %= mod;
				if (j >= (2*(k+1)-1)*(a[i]-a[i-1])) (dp[i][j][k][1] += dp[i-1][j-(2*(k+1)-1)*(a[i]-a[i-1])][k+1][1]*(k)) %= mod;
				
				if (j >= (2*(k-1)-1)*(a[i]-a[i-1])) (dp[i][j][k][2] += dp[i-1][j-(2*(k-1)-1)*(a[i]-a[i-1])][k-1][1]) %= mod;
				if (j >= (2*(k)-1)*(a[i]-a[i-1])) (dp[i][j][k][2] += dp[i-1][j-(2*(k)-1)*(a[i]-a[i-1])][k][1]) %= mod;
				
				if (j >= (2*(k-1)-2)*(a[i]-a[i-1])) (dp[i][j][k][2] += dp[i-1][j-(2*(k-1)-2)*(a[i]-a[i-1])][k-1][2]*(k-2)) %= mod;
				if (j >= (2*(k)-2)*(a[i]-a[i-1])) (dp[i][j][k][2] += dp[i-1][j-(2*(k)-2)*(a[i]-a[i-1])][k][2]*(2*(k)-2)) %= mod;
				if (j >= (2*(k+1)-2)*(a[i]-a[i-1])) (dp[i][j][k][2] += dp[i-1][j-(2*(k+1)-2)*(a[i]-a[i-1])][k+1][2]*(k)) %= mod;
			}
		}
	}
	for (int i = 0; i <= m; i++) (sum += dp[n][i][1][2]) %= mod;
	cout << sum << endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 7 ms 17500 KB Output is correct
6 Correct 6 ms 15708 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 8 ms 16732 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2140 KB Output is correct
2 Correct 2 ms 3676 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 2 ms 3676 KB Output is correct
5 Correct 2 ms 3676 KB Output is correct
6 Correct 2 ms 3420 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 2 ms 3232 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 7 ms 17500 KB Output is correct
6 Correct 6 ms 15708 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 8 ms 16732 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2140 KB Output is correct
12 Correct 2 ms 3676 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 2 ms 3676 KB Output is correct
15 Correct 2 ms 3676 KB Output is correct
16 Correct 2 ms 3420 KB Output is correct
17 Correct 1 ms 1368 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 2 ms 2908 KB Output is correct
20 Correct 2 ms 3232 KB Output is correct
21 Correct 3 ms 4700 KB Output is correct
22 Correct 162 ms 164344 KB Output is correct
23 Correct 260 ms 252148 KB Output is correct
24 Correct 170 ms 190884 KB Output is correct
25 Correct 227 ms 255060 KB Output is correct
26 Correct 192 ms 216976 KB Output is correct
27 Correct 71 ms 63724 KB Output is correct
28 Correct 106 ms 78004 KB Output is correct
29 Correct 166 ms 147280 KB Output is correct
30 Correct 220 ms 256336 KB Output is correct