oj.uz

Submission #981993

# Submission time Handle Problem Language Result Execution time Memory
981993 2024-05-13T17:49:43 Z dimashhh Skyscraper (JOI16_skyscraper) C++17
20 / 100
 2000 ms 386844 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 1e2 + 5, MOD = 1e9 + 7;

int n,l,a[N];
map<int,int> dp[N][N][2][2];
void add(int &x,int y){
    x += y;
    if(x >= MOD) x -= MOD;
}
void test(){
    cin >> n >> l;
    for(int i = 1;i <= n;i++) {
        cin >> a[i];
    }
    sort(a + 1,a + n + 1);
    if(n == 1) {
        cout << 1;
        return;
    }
    dp[1][1][0][0][-a[1] * 2] = 1;
    dp[1][1][0][1][-a[1]] = dp[1][1][1][0][-a[1]] = 1;
    for(int i = 1;i <= n;i++){
        a[i] = a[i+1];
        for(int j = 1;j <= i;j++){
            for(int s = 0;s < 2;s++){
                for(int t = 0;t < 2;t++){
                    for(auto [k,d]:dp[i][j][s][t]){
//                        cout << i << ' ' << j << ' ' << s << ' ' << t << ' ' << k << ' ' << d << '\n';
                        {//new
                            add(dp[i+1][j+1][s][t][k-a[i]*2],d*1ll*(j+1-s-t)%MOD);
                            if(!s){
                                add(dp[i+1][j+1][1][t][k-a[i]],d);
                            }
                            if(!t){
                                add(dp[i+1][j+1][s][1][k-a[i]],d);
                            }
                        }
                        {//merge
                            add(dp[i+1][j-1][s][t][k+a[i]*2],d*1ll*(j-1)%MOD);
                        }
                        {//corner
                            add(dp[i+1][j][s][t][k],d*1ll*(j*2-s-t)%MOD);
                            if(!s){
                                add(dp[i+1][j][1][t][k+a[i]],d);
                            }
                            if(!t){
                                add(dp[i+1][j][s][1][k+a[i]],d);
                            }
                        }
                    }
                }
            }
        }
    }
    int ans = 0;
    for(auto [x,y]:dp[n][1][1][1]){
        if(x <= l && x >= 0){
            add(ans,y);
        }
    }
    cout << ans;
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    int T = 1;
//    cin >> T;
    while (T--){
        test();
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 14 ms 6368 KB Output is correct
6 Correct 14 ms 6492 KB Output is correct
7 Correct 8 ms 4184 KB Output is correct
8 Correct 3 ms 2908 KB Output is correct
9 Correct 14 ms 6460 KB Output is correct
10 Correct 3 ms 2908 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3164 KB Output is correct
2 Correct 34 ms 9988 KB Output is correct
3 Correct 7 ms 3932 KB Output is correct
4 Correct 34 ms 10076 KB Output is correct
5 Correct 43 ms 11612 KB Output is correct
6 Correct 21 ms 6744 KB Output is correct
7 Correct 13 ms 4956 KB Output is correct
8 Correct 7 ms 3932 KB Output is correct
9 Correct 8 ms 4064 KB Output is correct
10 Correct 28 ms 8796 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 14 ms 6368 KB Output is correct
6 Correct 14 ms 6492 KB Output is correct
7 Correct 8 ms 4184 KB Output is correct
8 Correct 3 ms 2908 KB Output is correct
9 Correct 14 ms 6460 KB Output is correct
10 Correct 3 ms 2908 KB Output is correct
11 Correct 4 ms 3164 KB Output is correct
12 Correct 34 ms 9988 KB Output is correct
13 Correct 7 ms 3932 KB Output is correct
14 Correct 34 ms 10076 KB Output is correct
15 Correct 43 ms 11612 KB Output is correct
16 Correct 21 ms 6744 KB Output is correct
17 Correct 13 ms 4956 KB Output is correct
18 Correct 7 ms 3932 KB Output is correct
19 Correct 8 ms 4064 KB Output is correct
20 Correct 28 ms 8796 KB Output is correct
21 Correct 341 ms 63824 KB Output is correct
22 Execution timed out 2089 ms 386844 KB Time limit exceeded
23 Halted 0 ms 0 KB -