oj.uz

답안 #681643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
681643 2023-01-13T13:59:16 Z vjudge1 Skyscraper (JOI16_skyscraper) C++17
100 / 100
 1556 ms 247820 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define pll pair<ll,ll>
#define vi vector<int>
#define vll vector<long long>
#define vpii vector<pii >
#define Graph vector<vector<int> >
#define WGraph vector<vector<pii>>
#define read freopen("input.txt","r",stdin)
#define write freopen("output.txt","w",stdout)
#define mp(a,b) make_pair(a,b)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define bound(i,j,n,m) ((i)<n&&(j)<m&&(i)>=0&&(j)>=0)
#define all(container) container.begin(),container.end()
#define fi first
#define se second
#define pub push_back
#define sqr(x) ((x)*(x))
#define LL_MAX 0x7fffffffffffffff
#define getPos(i,j,m) ((i)*m+(j))
const ll mod=1000000007;
const int offset=200001;
int dp[2][102][offset+2005*2][3];
int a[101];
int suf[101];
void solvecases(int cse)
{
    int n,l;
    cin>>n>>l;
    for(int i=0;i<n;++i)
        cin>>a[i];
    sort(a,a+n);
    for(int i=1;i<n;++i)
        a[i]=a[i]-a[0];
    a[0]=0;
    for(int i=n-1;i>=0;--i)
        suf[i]=(suf[i+1]+a[i]);
//    for(int i=0;i<n;++i)
//        cout<<a[i]<<' ';
//    cout<<'\n';
    dp[0][1][0+offset][0]=1;
    dp[0][1][0+offset][1]=2;
    dp[0][1][0+offset][2]=1;

    int cur=1;
    int sum=0;
    for(int i=1;i<n;++i)
    {
        for(int j=1;j<=i+1;++j){
            for(int cost=-2*sum-2*a[i];cost<=2005;++cost){
                for(int k=0;k<3;++k){
                    dp[cur][j][cost+offset][k]=0;
                }
            }
        }
        int prv=cur^1;
        for(int j=1;j<=min(i,n-i+1);++j)
        {
            for(int cost=max(-2*sum,-2*suf[i]);cost<=2005;++cost)
            {
                if(dp[prv][j][cost+offset][0])
                {
                    dp[cur][j+1][cost+offset-2*a[i]][0]
                    =(dp[cur][j+1][cost+offset-2*a[i]][0]+
                      (ll)dp[prv][j][cost+offset][0]*(j+1))%mod;
                    dp[cur][j+1][cost+offset-a[i]][1]
                    =(dp[cur][j+1][cost+offset-a[i]][1]+
                      (ll)dp[prv][j][cost+offset][0]*(2))%mod;
                    if(j>1&&cost+2*a[i]<=2005)
                    {
                        dp[cur][j-1][cost+offset+2*a[i]][0]
                        =(dp[cur][j-1][cost+offset+2*a[i]][0]+
                        (ll)dp[prv][j][cost+offset][0]*(j-1))%mod;

                    }
                    dp[cur][j][cost+offset][0]=
                    (dp[cur][j][cost+offset][0]+
                     (ll)dp[prv][j][cost+offset][0]*(2*j))%mod;
                    if(cost+a[i]<=2005){

                        dp[cur][j][cost+offset+a[i]][1]=
                        (dp[cur][j][cost+offset+a[i]][1]+
                         (ll)dp[prv][j][cost+offset][0]*2)%mod;
                    }

                }
                if(dp[prv][j][cost+offset][1])
                {
                    dp[cur][j+1][cost+offset-2*a[i]][1]
                    =(dp[cur][j+1][cost+offset-2*a[i]][1]+
                      (ll)dp[prv][j][cost+offset][1]*(j))%mod;
                    dp[cur][j+1][cost+offset-a[i]][2]
                    =(dp[cur][j+1][cost+offset-a[i]][2]+
                      dp[prv][j][cost+offset][1]);
                    if(dp[cur][j+1][cost+offset-a[i]][2]>=mod)
                        dp[cur][j+1][cost+offset-a[i]][2]-=mod;
                    if(j>1&&cost+2*a[i]<=2005)
                    {
                        dp[cur][j-1][cost+offset+2*a[i]][1]
                        =(dp[cur][j-1][cost+offset+2*a[i]][1]+
                        (ll)dp[prv][j][cost+offset][1]*(j-1))%mod;
                    }
                    dp[cur][j][cost+offset][1]=
                    (dp[cur][j][cost+offset][1]+
                     (ll)dp[prv][j][cost+offset][1]*(2*j-1))%mod;
                    if(cost+a[i]<=2005){
                        dp[cur][j][cost+offset+a[i]][2]=
                        (dp[cur][j][cost+offset+a[i]][2]+
                         dp[prv][j][cost+offset][1]);
                        if(dp[cur][j][cost+offset+a[i]][2]>=mod)
                            dp[cur][j][cost+offset+a[i]][2]-=mod;
                    }
                }
                if(dp[prv][j][cost+offset][2])
                {
                    if(j>1){
                        dp[cur][j+1][cost+offset-2*a[i]][2]
                        =(dp[cur][j+1][cost+offset-2*a[i]][2]+
                          (ll)dp[prv][j][cost+offset][2]*(j-1))%mod;
                        if(cost+2*a[i]<=2005){
                            dp[cur][j-1][cost+offset+2*a[i]][2]=
                            (dp[cur][j-1][cost+offset+2*a[i]][2]+
                                (ll)dp[prv][j][cost+offset][2]*(j-1)
                             )%mod;
                        }
                        dp[cur][j][cost+offset][2]=
                        (dp[cur][j][cost+offset][2]+
                         (ll)dp[prv][j][cost+offset][2]*2*(j-1))%mod;
                    }
                }
            }
        }
        cur^=1;
        sum+=a[i];
    }
    cur^=1;
    ll ans=0;
    for(int i=0;i<=l;++i)
        ans+=dp[cur][1][i+offset][2];
//    for(int i=-offset;i<0;++i)
//        assert(!dp[cur][1][i+offset][2]);
    ans%=mod;
    cout<<ans<<'\n';
}
int main()
{

    fastio;
    //build(100000);
    //brute();
    int t=1;
    //cout<<fixed<<setprecision(2);
    //cin>>t;
    for(int i=1;i<=t;i++)
    {
        solvecases(i);
        //brute(i);
    }
}
/*
4 10
3 6 2 9
8 35
3 7 1 5 10 2 11 6
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 2004 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 852 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 2004 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 2 ms 1364 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Correct 1 ms 1236 KB Output is correct
17 Correct 1 ms 1236 KB Output is correct
18 Correct 1 ms 1236 KB Output is correct
19 Correct 1 ms 1236 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 10 ms 4180 KB Output is correct
22 Correct 96 ms 18216 KB Output is correct
23 Correct 1556 ms 247820 KB Output is correct
24 Correct 799 ms 126212 KB Output is correct
25 Correct 1432 ms 236140 KB Output is correct
26 Correct 1152 ms 193260 KB Output is correct
27 Correct 196 ms 29472 KB Output is correct
28 Correct 202 ms 29364 KB Output is correct
29 Correct 366 ms 55048 KB Output is correct
30 Correct 1433 ms 238256 KB Output is correct