| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 438679 | peijar | Skyscraper (JOI16_skyscraper) | C++17 | 2108 ms | 316924 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 int long long
using namespace std;
const int MOD = 1e9 + 7;
int lenPerm, maxSum;
int dp[100][1001][101][2][2];
// dp[curPos][curSum][ccCenter][fL][fR];
int diffs[101];
int solve(int curPos, int curSum, int ccCenter, bool fL, bool fR) {
if (curSum > maxSum)
return 0;
int &cur = dp[curPos][curSum][ccCenter][fL][fR];
if (cur != -1)
return cur;
cur = 0;
curSum += fL * diffs[curPos];
curSum += fR * diffs[curPos];
curSum += ccCenter * diffs[curPos] * 2;
if (curSum > maxSum)
return 0;
if (curPos == lenPerm - 1) {
if (ccCenter > 0)
return 0;
if (!fL and !fR)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||