oj.uz

답안 #40412

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40412 2018-02-01T11:17:54 Z RockyB Skyscraper (JOI16_skyscraper) C++14
100 / 100
 407 ms 181356 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; 
	}
	if (~dp[l][r][at][cnt][curl]) return dp[l][r][at][cnt][curl];
	ll res = 0;
	///new component
	res += calc(at + 1, curl, cnt + 1, l, r);
	res %= mod;
	///add to left border
	res += calc(at + 1, curl, cnt, 1, r);
	res %= mod;
	///connect left border and some middle component
	res += calc(at + 1, curl, cnt - 1, 1, r) * (ll)cnt;
	res %= mod;
	///add to right border
	res += calc(at + 1, curl, cnt, l, 1);
	res %= mod;
	///connect right border and some middle component
	res += calc(at + 1, curl, cnt - 1, l, 1) * (ll)cnt;
	res %= mod;
	///connect with middle component
	res += calc(at + 1, curl, cnt, l, r) * (ll)cnt * 2;
	res %= mod;
	///connect two middle component
	res += calc(at + 1, curl, cnt - 1, l, r) * (ll)cnt * (cnt - 1);
	res %= mod;
	return dp[l][r][at][cnt][curl] = res;
}	
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

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 180860 KB Output is correct
2 Correct 132 ms 180860 KB Output is correct
3 Correct 130 ms 181012 KB Output is correct
4 Correct 129 ms 181012 KB Output is correct
5 Correct 126 ms 181016 KB Output is correct
6 Correct 141 ms 181028 KB Output is correct
7 Correct 132 ms 181120 KB Output is correct
8 Correct 142 ms 181120 KB Output is correct
9 Correct 130 ms 181120 KB Output is correct
10 Correct 130 ms 181120 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 181208 KB Output is correct
2 Correct 131 ms 181208 KB Output is correct
3 Correct 129 ms 181208 KB Output is correct
4 Correct 129 ms 181208 KB Output is correct
5 Correct 133 ms 181208 KB Output is correct
6 Correct 129 ms 181208 KB Output is correct
7 Correct 130 ms 181208 KB Output is correct
8 Correct 128 ms 181208 KB Output is correct
9 Correct 128 ms 181208 KB Output is correct
10 Correct 135 ms 181208 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 180860 KB Output is correct
2 Correct 132 ms 180860 KB Output is correct
3 Correct 130 ms 181012 KB Output is correct
4 Correct 129 ms 181012 KB Output is correct
5 Correct 126 ms 181016 KB Output is correct
6 Correct 141 ms 181028 KB Output is correct
7 Correct 132 ms 181120 KB Output is correct
8 Correct 142 ms 181120 KB Output is correct
9 Correct 130 ms 181120 KB Output is correct
10 Correct 130 ms 181120 KB Output is correct
11 Correct 135 ms 181208 KB Output is correct
12 Correct 131 ms 181208 KB Output is correct
13 Correct 129 ms 181208 KB Output is correct
14 Correct 129 ms 181208 KB Output is correct
15 Correct 133 ms 181208 KB Output is correct
16 Correct 129 ms 181208 KB Output is correct
17 Correct 130 ms 181208 KB Output is correct
18 Correct 128 ms 181208 KB Output is correct
19 Correct 128 ms 181208 KB Output is correct
20 Correct 135 ms 181208 KB Output is correct
21 Correct 135 ms 181208 KB Output is correct
22 Correct 407 ms 181208 KB Output is correct
23 Correct 340 ms 181228 KB Output is correct
24 Correct 328 ms 181232 KB Output is correct
25 Correct 337 ms 181232 KB Output is correct
26 Correct 344 ms 181252 KB Output is correct
27 Correct 197 ms 181252 KB Output is correct
28 Correct 218 ms 181252 KB Output is correct
29 Correct 334 ms 181252 KB Output is correct
30 Correct 336 ms 181356 KB Output is correct