# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
361381 | jumpOverTheWall | Skyscraper (JOI16_skyscraper) | C++14 | 94 ms | 173832 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 N = 105;
const int L = 1005;
const int MOD = 1000000007;
int dp[N][L][N][2][2], a[N], n, lim;
int add(int x, int y) {
if ((x += y) >= MOD) x -= MOD;
return x;
}
int mul(int x, int y) {
return (long long)x * y % MOD;
}
int calc(int i, int cSum, int cMid, int cLef, int cRig) {
int &res = dp[i][cSum][cMid][cLef][cRig];
if (res >= 0) return res; res = 0;
/// assume missing position is filled with a[i + 1]
int nSum = cSum + (cMid * 2 + cLef + cRig) * (a[i + 1] - a[i]);
if (nSum > lim || cMid < 0) return res = 0;
/// concate left segment and right segment
if (i == n - 1) return res = cMid == 0 && cLef && cRig;
/// append to left segment
res = add(res, calc(i + 1, nSum, cMid, 1, cRig));
/// append to right segment
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... |