oj.uz

답안 #488708

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488708 2021-11-20T06:42:41 Z andreiomd Skyscraper (JOI16_skyscraper) C++11
100 / 100
 288 ms 3624 KB 
#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

using ll = long long;

const int NMAX = 1e2 + 3, KMAX = 1e3 + 3;
const int MOD = 1e9 + 7;

int N, K, A[NMAX];

int New[NMAX][KMAX][2][2], Old[NMAX][KMAX][2][2];

static inline void Read ()
{
    ios_base :: sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N >> K;

    for(int i = 1; i <= N; ++i)
        cin >> A[i];

    return;
}

static inline void Initialize ()
{
    New[0][0][1][1] = New[0][0][0][1] = New[0][0][1][0] = New[0][0][0][0] = 1;

    return;
}

void Add (int &x, int y, int z)
{
    x = (1ll * x + 1LL * y * z) % (1ll * MOD);

    return;
}

static inline void Find_Answer ()
{
    int ans = 0;
    for(int i = 0; i <= K; ++i)
        Add(ans, 1, New[0][i][0][0]);

    cout << ans << '\n';

    return;
}

int main()
{
    Read();

    sort(A + 1, A + N + 1);
    for(int i = 1; i <= N; ++i)
        A[i] = A[i+1] - A[i];

    Initialize();

    for(int i = 1; i < N; ++i)
    {
        memcpy(Old, New, sizeof(New));
        memset(New, 0, sizeof(New));

        for(int j = 0; j <= N; ++j)
            for(int k = 0; k <= K; ++k)
                for(int F = 0; F < 2; ++F)
                    for(int S = 0; S < 2; ++S)
                    {
                        int new_k = k + A[i] * ((j << 1) + F + S);

                        if(new_k > K)
                            continue;

                        Add(New[j + 1][new_k][F][S], j, Old[j][k][F][S]);
                        Add(New[j][new_k][F][S], (j << 1), Old[j][k][F][S]);

                        if(j > 0)
                            Add(New[j - 1][new_k][F][S], j, Old[j][k][F][S]);

                        if(F > 0)
                        {
                            Add(New[j + 1][new_k][1][S], 1, Old[j][k][F][S]);
                            Add(New[j + 1][new_k][0][S], 1, Old[j][k][F][S]);

                            Add(New[j][new_k][1][S], 1, Old[j][k][F][S]);
                            Add(New[j][new_k][0][S], 1, Old[j][k][F][S]);
                        }

                        if(S > 0)
                        {
                            Add(New[j + 1][new_k][F][1], 1, Old[j][k][F][S]);
                            Add(New[j + 1][new_k][F][0], 1, Old[j][k][F][S]);

                            Add(New[j][new_k][F][1], 1, Old[j][k][F][S]);
                            Add(New[j][new_k][F][0], 1, Old[j][k][F][S]);
                        }
                    }
    }

    Find_Answer();

    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 3532 KB Output is correct
3 Correct 2 ms 3532 KB Output is correct
4 Correct 2 ms 3532 KB Output is correct
5 Correct 3 ms 3532 KB Output is correct
6 Correct 3 ms 3532 KB Output is correct
7 Correct 2 ms 3532 KB Output is correct
8 Correct 2 ms 3532 KB Output is correct
9 Correct 4 ms 3532 KB Output is correct
10 Correct 2 ms 3532 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3532 KB Output is correct
2 Correct 3 ms 3532 KB Output is correct
3 Correct 3 ms 3508 KB Output is correct
4 Correct 3 ms 3532 KB Output is correct
5 Correct 3 ms 3532 KB Output is correct
6 Correct 5 ms 3532 KB Output is correct
7 Correct 3 ms 3532 KB Output is correct
8 Correct 4 ms 3624 KB Output is correct
9 Correct 4 ms 3532 KB Output is correct
10 Correct 4 ms 3532 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 3532 KB Output is correct
3 Correct 2 ms 3532 KB Output is correct
4 Correct 2 ms 3532 KB Output is correct
5 Correct 3 ms 3532 KB Output is correct
6 Correct 3 ms 3532 KB Output is correct
7 Correct 2 ms 3532 KB Output is correct
8 Correct 2 ms 3532 KB Output is correct
9 Correct 4 ms 3532 KB Output is correct
10 Correct 2 ms 3532 KB Output is correct
11 Correct 3 ms 3532 KB Output is correct
12 Correct 3 ms 3532 KB Output is correct
13 Correct 3 ms 3508 KB Output is correct
14 Correct 3 ms 3532 KB Output is correct
15 Correct 3 ms 3532 KB Output is correct
16 Correct 5 ms 3532 KB Output is correct
17 Correct 3 ms 3532 KB Output is correct
18 Correct 4 ms 3624 KB Output is correct
19 Correct 4 ms 3532 KB Output is correct
20 Correct 4 ms 3532 KB Output is correct
21 Correct 6 ms 3532 KB Output is correct
22 Correct 256 ms 3532 KB Output is correct
23 Correct 275 ms 3532 KB Output is correct
24 Correct 250 ms 3532 KB Output is correct
25 Correct 288 ms 3532 KB Output is correct
26 Correct 255 ms 3532 KB Output is correct
27 Correct 97 ms 3532 KB Output is correct
28 Correct 131 ms 3532 KB Output is correct
29 Correct 240 ms 3532 KB Output is correct
30 Correct 285 ms 3540 KB Output is correct