Submission #1278508

#	Time	Username	Problem	Language	Result	Execution time	Memory
1278508		sasde	Skyscraper (JOI16_skyscraper)	C++20	15 / 100	1 ms	832 KiB

skyscraper

#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define int long long
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time   cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e6+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
 return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int node,l,a[N],dp[105][105][1005][3];
void add(int &u,int v){
    u+=v;
    u%=mod;
    if(u<0)u+=mod;
}
bool M2;
void solve(){
    cin >> node >> l;
    for(int i=1;i<=node;++i)cin >>a[i];
    dp[0][0][0][0]=1;
    sort(a+1,a+1+node);
    a[node+1]=1e9;
    for(int i=1;i<=node;++i){
        for(int j=1;j<=i;++j){
            for(int k=0;k<=l;++k){
                for(int m=0;m<=2;++m){
                    int cost=(2*j-m)*(a[i+1]-a[i]);
                    if(cost>k||i+j+1-m>node)continue;
                    add(dp[i][j][k][m],dp[i-1][j-1][k-cost][m]);
                    if(m)
                    add(dp[i][j][k][m],(3-m)*dp[i-1][j-1][k-cost][m-1]);
                    add(dp[i][j][k][m],(2*j-m)*dp[i-1][j][k-cost][m]);
                    if(m==1)
                        add(dp[i][j][k][m],2*j*dp[i-1][j][k-cost][m-1]);
                    if(m==2){
                        if(i==node)
                            add(dp[i][j][k][m],dp[i-1][j][k-cost][m-1]);
                        else if(j>1){
                            add(dp[i][j][k][m],(j-1)*dp[i-1][j][k-cost][m-1]);
                        }
                    }
                    if(m==2){
                        if(i==node)
                            add(dp[i][j][k][m],dp[i-1][j+1][k-cost][m]);
                        else add(dp[i][j][k][m],j*(j-1)*dp[i-1][j+1][k-cost][m]);
                    }
                    else{
                        if(m==1)add(dp[i][j][k][m],j*j*dp[i-1][j+1][k-cost][m]);
                        else{
                            add(dp[i][j][k][m],j*(j+1)*dp[i-1][j+1][k-cost][m]);
                        }
                    }

                }
            }
        }
    }
    int ans=0;
    for(int i=0;i<=l;++i)add(ans,dp[node][1][i][2]);

    cout << ans%mod;
}
main()
{
  srand(time(0));
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    #define task "aws"
    if(fopen(task".inp","r")){
      freopen(task".inp","r",stdin);
      freopen(task".out","w",stdout);
    }
    int t=1;
 //   cin >> t;
while(t--){
    solve();cout<<'\n';
}
look_memory;
look_time;
}

Compilation message (stderr)

skyscraper.cpp:85:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   85 | main()
      | ^~~~
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:93:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |       freopen(task".inp","r",stdin);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:94:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |       freopen(task".out","w",stdout);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 15 / 15
• Subtask 3: 0 / 80