# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
585330 | Ace | Skyscraper (JOI16_skyscraper) | C++14 | 154 ms | 122784 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;
typedef long long ll;
const int N = 1e2;
const int L = 1e3;
const ll MOD = 1e9+7;
ll dmod(ll x){
return x%MOD;
}
int n,l;
int a[N+5];
int memo[N+2][N+2][L+2][3];
int dp(int x, int cc, int sisa, int tepi){
if(sisa < 0) return 0;
// printf(">> %d %d %d %d\n", x, cc, sisa, tepi);
if(x > n){
if(tepi == 2 && cc == 1) return 1;
return 0;
}
if(tepi == 2 && cc == 1) return 0;
int &ret = memo[x][cc][sisa][tepi];
if(ret != -1) return ret;
ret = 0;
// nambah cc
ret = dmod(ret + dmod((ll)(cc+1ll - tepi) * dp(x+1,cc+1,sisa-(2*(cc+1) - tepi)*(a[x+1]-a[x]),tepi)));
if(tepi < 2) ret = dmod(ret + dmod((ll)(2ll-tepi)*dp(x+1,cc+1,sisa-(2*(cc+1) - tepi - 1)*(a[x+1]-a[x]),tepi+1)));
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... |