oj.uz

답안 #204220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
204220 2020-02-25T08:26:35 Z Atalasion Skyscraper (JOI16_skyscraper) C++14
0 / 100
 19 ms 504 KB 
//khodaya khodet komak kon
#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimise ("ofast")
#pragma GCC optimise("unroll-loops")
#define int long long

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int N = 100 + 10;
const ll MOD = 1000000000 + 7;
const ll INF = 1000000000000000000;
const ll LOG = 25;

int dp[N][1010][N][3], n, a[N], L;

int32_t main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> L;
  	assert(n == 1);
	for (int i = 1; i <= n; i++) cin >> a[i];
	if (n == 2){
    	if (abs(a[1] - a[2]) <= L) return cout << 2, 0;
      	return cout << 0, 0;
    }
  if (n == 1){
		if (L == 0) return cout << 1, 0;
		return cout << 0, 0;
	}
	sort(a + 1, a + n + 1);
	dp[1][0][0][1] = 2;
	dp[1][0][0][2] = 1;
	for (int i = 1; i < n; i++) for (int sm = 0; sm <= L; sm++) for (int cnt = 0; cnt <= i + 1; cnt++) for (int cor = 0; cor <= 2; cor++){
		if (cnt + cor == 0) continue;
		int delta = a[i + 1] - a[i];
		int num = min(1009* 1ll, sm + (cnt * 2 + cor) * delta);
		//if (dp[i][sm][cnt][cor] != 0) cout << num << '\n';
		if (cnt != 0){
			dp[i + 1][num][cnt - 1][cor] += (cnt * dp[i][sm][cnt][cor]) % MOD;
			dp[i + 1][num][cnt - 1][cor] %= MOD;
			dp[i + 1][num][cnt + 1][cor] += (cnt * dp[i][sm][cnt][cor]) % MOD;
			dp[i + 1][num][cnt + 1][cor] %= MOD;
			dp[i + 1][num][cnt][cor] += (cnt * 2 * dp[i][sm][cnt][cor]) % MOD;
			dp[i + 1][num][cnt][cor] %= MOD;
        }
		if (cor != 0){
          	//cout << "YES" << endl;
			dp[i + 1][num][cnt + 1][cor - 1] += cor * dp[i][sm][cnt][cor];
			dp[i + 1][num][cnt + 1][cor - 1] %= MOD;
			dp[i + 1][num][cnt + 1][cor] += cor * dp[i][sm][cnt][cor];
			dp[i + 1][num][cnt + 1][cor] %= MOD;
			dp[i + 1][num][cnt][cor - 1] += cor * dp[i][sm][cnt][cor];
			dp[i + 1][num][cnt][cor - 1] %= MOD;
			dp[i + 1][num][cnt][cor] += cor * dp[i][sm][cnt][cor];
			dp[i + 1][num][cnt][cor] %= MOD;
		}
	}
	ll ans = 0;
	for (int i = 0; i <= L; i++) ans += dp[n][i][0][0], ans %= MOD;
	cout << ans;
	










	return 0;
}

Compilation message

skyscraper.cpp:8:0: warning: ignoring #pragma GCC optimise [-Wunknown-pragmas]
 #pragma GCC optimise ("ofast")
 
skyscraper.cpp:9:0: warning: ignoring #pragma GCC optimise [-Wunknown-pragmas]
 #pragma GCC optimise("unroll-loops")

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -