oj.uz

Submission #860951

# Submission time Handle Problem Language Result Execution time Memory
860951 2023-10-14T22:07:01 Z blackslex Skyscraper (JOI16_skyscraper) C++17
20 / 100
 56 ms 43372 KB 
#include<bits/stdc++.h>

using namespace std;

const int N = 105, L = 1005, M = 1e9 + 7;
int n, d, a[N], dp[N][N][L][3];

int main() {
    scanf("%d %d", &n, &d);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]); sort(a + 1, a + n + 1);
    dp[1][1][0][0] = 1; dp[1][1][0][1] = 2;
    for (int i = 1; i < n; i++) {
        for (int j = 1; j <= i; j++) {
            for (int l = 0; l <= d; l++) {
                for (int k = 0; k < 3; k++) {
                    int cur = l + (a[i + 1] - a[i]) * (j * 2 - k);
                    if (cur > d) continue;
                    dp[i + 1][j - 1][cur][k] += (j - 1) * dp[i][j][l][k]; dp[i + 1][j - 1][cur][k] %= M; // add, merge
                    dp[i + 1][j][cur][k] += (j * 2 - k) * dp[i][j][l][k]; dp[i + 1][j][cur][k] %= M; // add, merge one ending point
                    dp[i + 1][j + 1][cur][k] += (j + 1 - k) * dp[i][j][l][k]; dp[i + 1][j + 1][cur][k] %= M; // add, no merge
                    if (k == 2) continue;
                    dp[i + 1][j][cur][k + 1] += (2 - k) * dp[i][j][l][k]; dp[i + 1][j][cur][k + 1] %= M; // add, fix, merge
                    dp[i + 1][j + 1][cur][k + 1] = (2 - k) * dp[i][j][l][k]; dp[i + 1][j + 1][cur][k + 1] %= M; // add, fix, no merge
                }
            }
        }
    }
    for (int i = 1; i <= d; i++) dp[n][1][i][2] += dp[n][1][i - 1][2], dp[n][1][i][2] %= M;
    printf("%d", dp[n][1][d][2] + (n == 1));
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:10:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   10 |     for (int i = 1; i <= n; i++) scanf("%d", &a[i]); sort(a + 1, a + n + 1);
      |     ^~~
skyscraper.cpp:10:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   10 |     for (int i = 1; i <= n; i++) scanf("%d", &a[i]); sort(a + 1, a + n + 1);
      |                                                      ^~~~
skyscraper.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d %d", &n, &d);
      |     ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:10:39: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     for (int i = 1; i <= n; i++) scanf("%d", &a[i]); sort(a + 1, a + n + 1);
      |                                  ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2904 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2908 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 2904 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2904 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 1 ms 2908 KB Output is correct
17 Correct 1 ms 2904 KB Output is correct
18 Correct 1 ms 2908 KB Output is correct
19 Correct 1 ms 2908 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct
21 Correct 2 ms 5208 KB Output is correct
22 Incorrect 56 ms 43372 KB Output isn't correct
23 Halted 0 ms 0 KB -