제출 #1189929

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1189929		AbdullahIshfaq	Skyscraper (JOI16_skyscraper)	C++20	100 / 100	106 ms	115088 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
const int N = 1e2+7, L = 1e3+5;
ll dp[N][N][3][L];
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n, m, a[N];
    cin >> n >> m;
    for (int i=1;i<=n;i++) {
        cin >> a[i];
    }
    sort(a+1,a+n+1);
    dp[1][1][0][0] = 1;
    dp[1][1][1][0] = 2;
    dp[1][1][2][0] = 1;
    for (int i=1;i<n;i++) { // have placed i number
        for (int j=1;j<=i;j++) { // the number of connected components = j
            for (int k=0;k<=2;k++) { // the number of corner
                int c = (a[i+1]-a[i])*(2*j-k);
                for (int l=0;l<=m-c;l++) {
                    dp[i+1][j-1][k][l+c] += dp[i][j][k][l]*(j-1);
                    dp[i+1][j-1][k][l+c] %= MOD;
                    dp[i+1][j][k][l+c] += dp[i][j][k][l]*(2*j-k);
                    dp[i+1][j][k][l+c] %= MOD;
                    dp[i+1][j+1][k][l+c] += dp[i][j][k][l]*(j+1-k);
                    dp[i+1][j+1][k][l+c] %= MOD;
                    dp[i+1][j][k+1][l+c] += dp[i][j][k][l]*(2-k);
                    dp[i+1][j][k+1][l+c] %= MOD;
                    dp[i+1][j+1][k+1][l+c] += dp[i][j][k][l]*(2-k);
                    dp[i+1][j+1][k+1][l+c] %= MOD;
                }
            }
        }
    }
    ll ans = 0;
    for (int i=0;i<=m;i++) {
        ans += dp[n][1][2][i];
        ans %= MOD;
    }
    cout << ans << "\n";
}

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 80 / 80