# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94598 | Bliss_of_comprehension | Skyscraper (JOI16_skyscraper) | C++14 | 4 ms | 1912 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>
#define mod 1000000007
using namespace std;
typedef long long ll;
ll dp[105][105][1005][2][2]={};
int main(){
int n,l;
cin >> n >> l;
vector <int> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a.begin(),a.end());
dp[0][0][0][0][0]=1;
ll ans=0;
for(int i=0;i<n;i++){
if(i==n-1){
for(int k=0;k<=l;k++){
for(int iss=0;iss<2;iss++){
for(int ise=0;ise<2;ise++){
dp[i][0][k][iss][ise]%=mod;
if(iss+ise>0)
ans=(ans+dp[i][0][k][iss][ise])%mod;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |