oj.uz

Submission #40409

# Submission time Handle Problem Language Result Execution time Memory
40409 2018-02-01T11:12:37 Z RockyB Skyscraper (JOI16_skyscraper) C++14
5 / 100
 2000 ms 181256 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)100 + 7;
const int L = (int)1e3 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, S;
int a[N];

int dp[2][2][N][N][L];
int calc(int at = 1, int curl = 0, int cnt = 0, int l = 0, int r = 0) {
	if (cnt < 0) return 0;
	/// add previous cost
	if (at > 1) { 
		curl += (l + r + 2 * cnt) * (a[at] - a[at - 1]);
	} 
	if (curl > S) return 0;

	if (at == n) {
		return cnt == 0 ? 1 : 0; 
	}
	ll res = 0;
	///new component
	res += calc(at + 1, curl, cnt + 1, l, r);
	///add to left border
	res += calc(at + 1, curl, cnt, 1, r);
	///connect left border and some middle component
	res += calc(at + 1, curl, cnt - 1, 1, r) * cnt;
	///add to right border
	res += calc(at + 1, curl, cnt, l, 1);
	///connect right border and some middle component
	res += calc(at + 1, curl, cnt - 1, l, 1) * cnt;
	///connect with middle component
	res += calc(at + 1, curl, cnt, l, r) * cnt * 2;
	///connect two middle component
	res += calc(at + 1, curl, cnt - 1, l, r) * cnt * (cnt - 1);
	return dp[l][r][at][cnt][curl] = res % mod;
}	
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> S;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort (a + 1, a + 1 + n);
	memset(dp, -1, sizeof(dp));
	cout << calc();
	ioi
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 180728 KB Output is correct
2 Correct 131 ms 180968 KB Output is correct
3 Correct 128 ms 180968 KB Output is correct
4 Correct 129 ms 180968 KB Output is correct
5 Correct 126 ms 181120 KB Output is correct
6 Correct 129 ms 181120 KB Output is correct
7 Correct 131 ms 181180 KB Output is correct
8 Correct 130 ms 181180 KB Output is correct
9 Correct 131 ms 181180 KB Output is correct
10 Correct 133 ms 181180 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1077 ms 181180 KB Output is correct
2 Correct 168 ms 181256 KB Output is correct
3 Execution timed out 2048 ms 181256 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 180728 KB Output is correct
2 Correct 131 ms 180968 KB Output is correct
3 Correct 128 ms 180968 KB Output is correct
4 Correct 129 ms 180968 KB Output is correct
5 Correct 126 ms 181120 KB Output is correct
6 Correct 129 ms 181120 KB Output is correct
7 Correct 131 ms 181180 KB Output is correct
8 Correct 130 ms 181180 KB Output is correct
9 Correct 131 ms 181180 KB Output is correct
10 Correct 133 ms 181180 KB Output is correct
11 Correct 1077 ms 181180 KB Output is correct
12 Correct 168 ms 181256 KB Output is correct
13 Execution timed out 2048 ms 181256 KB Time limit exceeded
14 Halted 0 ms 0 KB -