# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
570765 | dattranxxx | Building 4 (JOI20_building4) | C++11 | 7 ms | 8276 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;
using ll = long long;
const int N = 1e6 + 5;
int n;
int a[N], b[N], tmin[N], tmax[N], res[N];
pair<int, int> dp[N][2];
int trace_min() {
for (int i = 1; i <= n*2; ++i) {
dp[i][0].first = 1e9;
if (b[i] >= a[i-1]) dp[i][0] = min(dp[i][0], {dp[i-1][1].first, 1});
if (b[i] >= b[i-1]) dp[i][0] = min(dp[i][0], {dp[i-1][0].first, 0});
dp[i][1].first = 1e9;
if (a[i] >= a[i-1]) dp[i][1] = min(dp[i][1], {dp[i-1][1].first + 1, 1});
if (a[i] >= b[i-1]) dp[i][1] = min(dp[i][1], {dp[i-1][0].first + 1, 0});
}
if (dp[n * 2][0].first > n && dp[n * 2][1].first > n)
return 0;
pair<int, int> cur; cur.first = n * 2;
cur.second = dp[n * 2][0].first < dp[n * 2][1].first ? 0 : 1;
while (cur.first > 0) {
tmin[cur.first] = cur.second;
cur.second = dp[cur.first][cur.second].second;
cur.first--;
}
return 1;
}
int trace_max() {
for (int i = 1, t; i <= n*2; ++i) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |