Submission #26990

# Submission time Handle Problem Language Result Execution time Memory
26990 2017-07-08T09:39:38 Z Bruteforceman Skyscraper (JOI16_skyscraper) C++11
100 / 100
99 ms 132024 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long Long;
int a[110];
int n;
const int mod = 1000000007;
int L;
int fn[105][105][3][1005];

int dp(int i, int group, int oneside, int value) {
	value += (a[i] - a[i-1]) * (2 * group + oneside);
	if(value > L) return 0;
	if(group < 0) return 0;
	if(oneside > 2) return 0;
	if(i == n) {
		if(group == 0 and oneside) return 1;
		else return 0;
	}
	if(fn[i][group][oneside][value] != -1) return fn[i][group][oneside][value];

	Long ans = 0;
	ans += 1LL * (2 * group + oneside) * dp(i + 1, group, oneside, value);
	ans += 1LL * (group + 1) * dp(i + 1, group + 1, oneside, value);
	ans += 1LL * (group + oneside - 1) * dp(i + 1, group - 1, oneside, value);
	ans += 1LL * (2 - oneside) * dp(i + 1, group, oneside + 1, value);
	ans += 1LL * (2 - oneside) * dp(i + 1, group - 1, oneside + 1, value);
	ans %= mod;
	return fn[i][group][oneside][value] = ans;
}

int main(int argc, char const *argv[])
{
	ios_base :: sync_with_stdio (false);
	cin.tie (nullptr);
	
	cin >> n >> L;
	if(n == 1) {
		cout << 1 << endl;
		exit(0);
	} 
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a+1, a+n+1);
	memset(fn, -1, sizeof fn);
	cout << dp(1, 0, 0, 0) << endl;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 132024 KB Output is correct
2 Correct 0 ms 132024 KB Output is correct
3 Correct 0 ms 132024 KB Output is correct
4 Correct 6 ms 132024 KB Output is correct
5 Correct 16 ms 132024 KB Output is correct
6 Correct 6 ms 132024 KB Output is correct
7 Correct 29 ms 132024 KB Output is correct
8 Correct 6 ms 132024 KB Output is correct
9 Correct 13 ms 132024 KB Output is correct
10 Correct 9 ms 132024 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 132024 KB Output is correct
2 Correct 13 ms 132024 KB Output is correct
3 Correct 13 ms 132024 KB Output is correct
4 Correct 3 ms 132024 KB Output is correct
5 Correct 6 ms 132024 KB Output is correct
6 Correct 9 ms 132024 KB Output is correct
7 Correct 9 ms 132024 KB Output is correct
8 Correct 6 ms 132024 KB Output is correct
9 Correct 3 ms 132024 KB Output is correct
10 Correct 6 ms 132024 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 132024 KB Output is correct
2 Correct 0 ms 132024 KB Output is correct
3 Correct 0 ms 132024 KB Output is correct
4 Correct 6 ms 132024 KB Output is correct
5 Correct 16 ms 132024 KB Output is correct
6 Correct 6 ms 132024 KB Output is correct
7 Correct 29 ms 132024 KB Output is correct
8 Correct 6 ms 132024 KB Output is correct
9 Correct 13 ms 132024 KB Output is correct
10 Correct 9 ms 132024 KB Output is correct
11 Correct 0 ms 132024 KB Output is correct
12 Correct 13 ms 132024 KB Output is correct
13 Correct 13 ms 132024 KB Output is correct
14 Correct 3 ms 132024 KB Output is correct
15 Correct 6 ms 132024 KB Output is correct
16 Correct 9 ms 132024 KB Output is correct
17 Correct 9 ms 132024 KB Output is correct
18 Correct 6 ms 132024 KB Output is correct
19 Correct 3 ms 132024 KB Output is correct
20 Correct 6 ms 132024 KB Output is correct
21 Correct 19 ms 132024 KB Output is correct
22 Correct 99 ms 132024 KB Output is correct
23 Correct 89 ms 132024 KB Output is correct
24 Correct 86 ms 132024 KB Output is correct
25 Correct 83 ms 132024 KB Output is correct
26 Correct 76 ms 132024 KB Output is correct
27 Correct 29 ms 132024 KB Output is correct
28 Correct 33 ms 132024 KB Output is correct
29 Correct 93 ms 132024 KB Output is correct
30 Correct 93 ms 132024 KB Output is correct