제출 #1174726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1174726		chikien2009	Skyscraper (JOI16_skyscraper)	C++20	0 / 100	1 ms	836 KiB

skyscraper

#include <bits/stdc++.h>

using namespace std;

void setup()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int n, a[101], b, l;
long long f[101][101][1001][3], mod = 1e9 + 7;

int main()
{
    setup();

    cin >> n >> l;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    f[0][0][0][0] = 1;
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j <= i; ++j)
        {
            for (int k = 0; k <= l; ++k)
            {
                for (int g = 0; g <= 2; ++g)
                {
                    b = (a[i + 1] - a[i]) * (2 * j - g) + k;
                    if (b < 0 || b > l || f[i][j][k][g] == 0)
                    {
                        continue;
                    }
                    (f[i + 1][j + 1][b][g] += f[i][j][k][g] * (j + 1 - g)) %= mod;
                    if (g < 2)
                    {
                        (f[i + 1][j + 1][b][g + 1] += f[i][j][k][g] * (2 - g)) %= mod;
                    }
                    if (j > 0)
                    {
                        (f[i + 1][j][b][g] += f[i][j][k][g] * (2 * j - g)) %= mod;
                        if (g < 2)
                        {
                            (f[i + 1][j][b][g + 1] += f[i][j][k][g] * (2 - g)) %= mod;
                        }
                    }
                    if (1 < j)
                    {
                        (f[i + 1][j - 1][b][g] += f[i][j][k][g] * (j - 1)) %= mod;
                    }
                }
            }
        }
    }
    b = 0;
    for (int i = 1; i <= l; ++i)
    {
        (b += f[n][1][i][2]) % mod;
    }
    cout << b;
    return 0;
}

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