oj.uz

Submission #1087522

# Submission time Handle Problem Language Result Execution time Memory
1087522 2024-09-12T20:15:33 Z TAhmed33 Skyscraper (JOI16_skyscraper) C++
20 / 100
 2000 ms 151164 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("Ofast")
typedef long long ll;
const int MOD = 1e9 + 7;
int add (int a, int b) {
	a += b; if (a >= MOD) a -= MOD;
	return a;
}
int sub (int a, int b) {
	a -= b; if (a < 0) a += MOD;
	return a;
}
int mul (int a, int b) {
	return (a * 1ll * b) % MOD;
}
int power (int a, int b) {
	if (!b) return 1;
	int u = power(a, b >> 1);
	u = mul(u, u);
	if (b & 1) u = mul(u, a);
	return u;
}
int n, l, a[101];
const int B = 2000;
map <int, int> dp[102][102][3];
int ans (int x, int y, int z, int c) {
	if (y < 1 || c < 0 || c > 2) {
		return 0;
	}
	if (x == n + 1) {
		return y == 1 && z >= 0 && z <= l && c == 0;
	}
	if (dp[x][y][c].count(z)) {
		return dp[x][y][c][z];
	}
	int ret = 0;
	if (y == 1) {
		ret = add(ret, mul(c, ans(x + 1, y, z, c)));
		ret = add(ret, mul(c, ans(x + 1, y, z + a[x], c - 1)));
		ret = add(ret, mul(c, ans(x + 1, y + 1, z - 2 * a[x], c)));
		ret = add(ret, mul(c, ans(x + 1, y + 1, z - a[x], c - 1)));
	} else {
		ret = add(ret, mul(c, ans(x + 1, y + 1, z - 2 * a[x], c)));
		ret = add(ret, mul(c, ans(x + 1, y + 1, z - a[x], c - 1)));
		ret = add(ret, mul(c, ans(x + 1, y, z + a[x], c - 1)));
		ret = add(ret, mul(y - 1, ans(x + 1, y + 1, z - 2 * a[x], c)));
		ret = add(ret, mul(y - 1, ans(x + 1, y - 1, z + 2 * a[x], c)));
		ret = add(ret, mul(2 * y - 2 + c, ans(x + 1, y, z, c)));
	}
	return dp[x][y][c][z] = ret;
}
void solve () {
	cin >> n >> l;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	if (n == 1) {
		cout << 1 << '\n';
		return;
	}
	sort(a + 1, a + n + 1);
	int sum = ans(2, 1, -a[1], 1);
	sum = mul(sum, 2);
	sum = add(sum, ans(2, 1, -2 * a[1], 2));
	cout << sum << '\n';
}				
signed main () {
	ios::sync_with_stdio(0); cin.tie(0);
	int tc = 1; //cin >> tc;
	while (tc--) solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 2 ms 2140 KB Output is correct
6 Correct 3 ms 2140 KB Output is correct
7 Correct 2 ms 2140 KB Output is correct
8 Correct 2 ms 1884 KB Output is correct
9 Correct 2 ms 2136 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2096 KB Output is correct
2 Correct 24 ms 4440 KB Output is correct
3 Correct 4 ms 2392 KB Output is correct
4 Correct 30 ms 4516 KB Output is correct
5 Correct 31 ms 4944 KB Output is correct
6 Correct 14 ms 3348 KB Output is correct
7 Correct 9 ms 2908 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 17 ms 3876 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 2 ms 2140 KB Output is correct
6 Correct 3 ms 2140 KB Output is correct
7 Correct 2 ms 2140 KB Output is correct
8 Correct 2 ms 1884 KB Output is correct
9 Correct 2 ms 2136 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 2 ms 2096 KB Output is correct
12 Correct 24 ms 4440 KB Output is correct
13 Correct 4 ms 2392 KB Output is correct
14 Correct 30 ms 4516 KB Output is correct
15 Correct 31 ms 4944 KB Output is correct
16 Correct 14 ms 3348 KB Output is correct
17 Correct 9 ms 2908 KB Output is correct
18 Correct 4 ms 2396 KB Output is correct
19 Correct 4 ms 2396 KB Output is correct
20 Correct 17 ms 3876 KB Output is correct
21 Correct 421 ms 36688 KB Output is correct
22 Execution timed out 2065 ms 151164 KB Time limit exceeded
23 Halted 0 ms 0 KB -