# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211738 | nibnalin | Building 4 (JOI20_building4) | C++17 | 450 ms | 105848 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 <iostream>
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = int(1e6)+5, inf = int(1e9)+5;
int n, A[maxn], B[maxn];
pair<int, int> memo[maxn][2];
pair<int, int> DP(int idx, int prev)
{
if(idx > 2*n) return {0, 0};
else if(memo[idx][prev].first != -1) return memo[idx][prev];
else
{
int p = prev?B[idx-1]:A[idx-1];
pair<int, int> res = {inf, -inf}, tmp;
if(A[idx] >= p)
{
tmp = DP(idx+1, 0);
res.first = min(res.first, tmp.first+1);
res.second = max(res.second, tmp.second+1);
}
if(B[idx] >= p)
{
tmp = DP(idx+1, 1);
res.first = min(res.first, tmp.first);
res.second = max(res.second, tmp.second);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |