# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44599 | choikiwon | Skyscraper (JOI16_skyscraper) | C++17 | 2082 ms | 491404 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;
const int mod = 1e9 + 7;
const int offset = 1000;
int N, L;
int A[102];
int cc[102][102][3010][2][2];
int dp(int n, int d, int sum, int s, int e) {
if(sum >= 3010) return 0;
if(n == N) return !d && sum <= L + offset && s && e;
int &ret = cc[n][d][sum][s][e];
if(ret != -1) return ret;
int l = d;
int r = d + e - s;
if(n && l <= 0 && r <= 0) return ret = 0;
ret = 0;
if(!s) {
ret += dp(n + 1, d + 1, A[n] + sum + 2 * (A[n + 1] - A[n]) * (d + 1), 1, e);
ret %= mod;
if(r) {
ret += 1LL * (n == N - 1? r : r - e) * dp(n + 1, d, A[n] + sum + 2 * (A[n + 1] - A[n]) * d, 1, e) % mod;
ret %= mod;
}
}
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... |