oj.uz

답안 #933388

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
933388 2024-02-25T15:34:50 Z parlimoos Skyscraper (JOI16_skyscraper) C++14
20 / 100
 48 ms 19028 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define cl clear
#define bg begin
#define arr(x) array<int , x>
#define endl '\n'

const int MOD = int(1e9) + 7;

void Add(int &a , int b){
    a += b;
    if(a > MOD) a %= MOD;
}

int n , l;
vector<int> a;
int dp[101][101][1001][3];

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> l;
    a.pb(0);
    for(int i = 0 ; i < n ; i++){
        int d;
        cin >> d;
        a.pb(d);
    }
    a.pb(10000);
    if(n == 1){
        cout << 1;
        return 0;
    }
    sort(a.bg() , a.end());
    dp[0][0][0][0] = 1;
    for(int i = 1 ; i <= n ; i++){
        for(int j = 1 ; j <= i ; j++){
            for(int k = 0 ; k <= l ; k++){
                for(int m = 0 ; m < 3 ; m++){
                    int d = (2 * j - m) * (a[i + 1] - a[i]);
                    if(d > k or i + j + 1 - m > n) continue;
                    Add(dp[i][j][k][m] , dp[i - 1][j - 1][k - d][m]);

                    if(m > 0) Add(dp[i][j][k][m] , (3 - m) * dp[i - 1][j - 1][k - d][m - 1]);

                    Add(dp[i][j][k][m] , (2 * j - m) * dp[i - 1][j][k - d][m]);
                    
                    if(m == 1) Add(dp[i][j][k][m] , (2 * j) * dp[i - 1][j][k - d][m - 1]);
                    else if(m == 2){
                        if(i == n) Add(dp[i][j][k][m] , dp[i - 1][j][k - d][m - 1]);
                        else if(j > 1) Add(dp[i][j][k][m] , (j - 1) * dp[i - 1][j][k - d][m - 1]);
                    }

                    if(m == 2){
                        if(i == n) Add(dp[i][j][k][m] , dp[i - 1][j + 1][k - d][m]);
                        else Add(dp[i][j][k][m] , (j - 1) * j * dp[i - 1][j + 1][k - d][m]);
                    }else if(m == 1) Add(dp[i][j][k][m] , j * j * dp[i - 1][j + 1][k - d][m]);
                    else Add(dp[i][j][k][m] , j * (j + 1) * dp[i - 1][j + 1][k - d][m]);
                }
            }
        }
    }
    int o = 0;
    for(int i = 0 ; i <= l ; i++) Add(o , dp[n][1][i][2]);
    cout << o;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 444 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 2136 KB Output is correct
22 Incorrect 48 ms 19028 KB Output isn't correct
23 Halted 0 ms 0 KB -