# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211604 | mieszko11b | Building 4 (JOI20_building4) | C++14 | 424 ms | 26128 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 ii = pair<int, int>;
#define X first
#define Y second
int n;
ii dp[1000007][2];
int a[1000007], b[1000007];
ii merge(ii a, ii b) {
return {min(a.X, b.X), max(a.Y, b.Y)};
}
ii addone(ii a) {
return {a.X + 1, a.Y + 1};
}
int main() {
scanf("%d", &n);
n *= 2;
for(int i = 1 ; i <= n ; i++)
scanf("%d", &a[i]);
for(int i = 1 ; i <= n ; i++)
scanf("%d", &b[i]);
dp[1][0] = {1, 1};
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |