oj.uz

답안 #589387

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
589387 2022-07-04T14:28:33 Z Loki_Nguyen Skyscraper (JOI16_skyscraper) C++14
100 / 100
 1097 ms 24376 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define pll pair<int, pii>
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
const int N = 102;
const int M = 10002;
const int mod = 1e9 + 7;
const int base = 75;
const ll inf = 1e12;
int n, t, tong;
int k, m, a[N], b[N], dp[2][N][M][3];
int ans;
void add(int& x, int y)
{
    x += y;
    if (x >= mod)
        x -= mod;
}
void sol()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
        cin >> a[i], b[i] = i;
    if (n == 1)
    {
        cout << 1 << '\n';
        return;
    }
    sort(a + 1, a + 1 + n);
    reverse(a + 1, a + 1 + n);
    dp[1][1][a[1] * 2][0] = 1;
    dp[1][1][a[1]][1] = 2;
    for (int i = 1; i < n; i++)
    {
        memset(dp[(i&1)^1], 0, sizeof(dp[(i&1)^1]));
        for (int j = 1; j <= i; j++)
        {
            for (int p = 0; p < M; p++)
            {
                for (int q = 0; q < 3; q++)
                {
                    if (dp[i&1][j][p][q] == 0)
                        continue;
                    if (p + a[i + 1] * 2 < M)
                        add(dp[(i&1)^1][j + 1][p + a[i + 1] * 2][q], 1ll * dp[i&1][j][p][q] * (j + 1 - q) % mod);
                    if (q < 2 && p + a[i + 1] < M)
                        add(dp[(i&1)^1][j + 1][p + a[i + 1]][q + 1], 1ll * dp[i&1][j][p][q] * (2 - q) % mod);
                    add(dp[(i&1)^1][j][p][q], 1ll * dp[i&1][j][p][q] * (2 * j - q) % mod);
                    if (q < 2 && p >= a[i + 1])
                        add(dp[(i&1)^1][j][p - a[i + 1]][q + 1], 1ll * dp[i&1][j][p][q] * (2 - q) % mod);
                    if (j > 1 && p >= a[i + 1] * 2)
                        add(dp[(i&1)^1][j - 1][p - a[i + 1] * 2][q], 1ll * dp[i&1][j][p][q] * (j - 1) % mod);
                }
            } 
        }
    }
    for (int i = 0; i <= k; i++)
        add(ans, dp[n&1][1][i][2]);
    cout << ans << '\n';
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
#define task "tests"
    if (fopen(task ".inp", "r"))
    {
        freopen(task ".inp", "r", stdin);
        freopen(task ".out", "w", stdout);
    }
    int test = 1;
    // cin >> test;
    while (test-- > 0)
        sol();
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:75:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |         freopen(task ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:76:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |         freopen(task ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 10 ms 12244 KB Output is correct
3 Correct 18 ms 24160 KB Output is correct
4 Correct 15 ms 24172 KB Output is correct
5 Correct 18 ms 24148 KB Output is correct
6 Correct 17 ms 24284 KB Output is correct
7 Correct 19 ms 24276 KB Output is correct
8 Correct 21 ms 24276 KB Output is correct
9 Correct 19 ms 24280 KB Output is correct
10 Correct 19 ms 24276 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 24156 KB Output is correct
2 Correct 29 ms 24148 KB Output is correct
3 Correct 31 ms 24276 KB Output is correct
4 Correct 30 ms 24276 KB Output is correct
5 Correct 29 ms 24148 KB Output is correct
6 Correct 33 ms 24260 KB Output is correct
7 Correct 30 ms 24276 KB Output is correct
8 Correct 31 ms 24208 KB Output is correct
9 Correct 27 ms 24276 KB Output is correct
10 Correct 30 ms 24276 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 10 ms 12244 KB Output is correct
3 Correct 18 ms 24160 KB Output is correct
4 Correct 15 ms 24172 KB Output is correct
5 Correct 18 ms 24148 KB Output is correct
6 Correct 17 ms 24284 KB Output is correct
7 Correct 19 ms 24276 KB Output is correct
8 Correct 21 ms 24276 KB Output is correct
9 Correct 19 ms 24280 KB Output is correct
10 Correct 19 ms 24276 KB Output is correct
11 Correct 24 ms 24156 KB Output is correct
12 Correct 29 ms 24148 KB Output is correct
13 Correct 31 ms 24276 KB Output is correct
14 Correct 30 ms 24276 KB Output is correct
15 Correct 29 ms 24148 KB Output is correct
16 Correct 33 ms 24260 KB Output is correct
17 Correct 30 ms 24276 KB Output is correct
18 Correct 31 ms 24208 KB Output is correct
19 Correct 27 ms 24276 KB Output is correct
20 Correct 30 ms 24276 KB Output is correct
21 Correct 105 ms 24256 KB Output is correct
22 Correct 586 ms 24276 KB Output is correct
23 Correct 526 ms 24276 KB Output is correct
24 Correct 730 ms 24376 KB Output is correct
25 Correct 547 ms 24276 KB Output is correct
26 Correct 633 ms 24256 KB Output is correct
27 Correct 1097 ms 24276 KB Output is correct
28 Correct 1083 ms 24256 KB Output is correct
29 Correct 1066 ms 24276 KB Output is correct
30 Correct 538 ms 24256 KB Output is correct