# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288217 | Pyqe | Skyscraper (JOI16_skyscraper) | C++14 | 158 ms | 5504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
long long n,d,a[169],dp[2][169][3][1069],dv=1e9+7;
int main()
{
long long i,j,r,jj,k,z=0;
scanf("%lld%lld",&n,&d);
if(n==1)
{
printf("1\n");
return 0;
}
for(i=1;i<=n;i++)
{
scanf("%lld",a+i);
}
sort(a+1,a+n+1);
for(i=n;i;i--)
{
a[i]-=a[i-1];
}
dp[0][0][0][0]=1;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
for(r=0;r<=2;r++)
{
k=a[i+1]*(j*2-r);
for(jj=k;jj<=d;jj++)
{
dp[1][j][r][jj]=(dp[0][j-1][r][jj-k]*(j-r)+dp[0][j][r][jj-k]*(j*2-r)+dp[0][j+1][r][jj-k]*j)%dv;
if(r)
{
dp[1][j][r][jj]=(dp[1][j][r][jj]+dp[0][j-1][r-1][jj-k]*(3-r)+dp[0][j][r-1][jj-k]*(3-r))%dv;
}
}
}
}
for(j=0;j<=n;j++)
{
for(r=0;r<=2;r++)
{
for(jj=0;jj<=d;jj++)
{
dp[0][j][r][jj]=dp[1][j][r][jj];
dp[1][j][r][jj]=0;
}
}
}
}
for(i=0;i<=d;i++)
{
z=(z+dp[0][1][2][i])%dv;
}
printf("%lld\n",z);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |