# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232158 | brcode | Building 4 (JOI20_building4) | C++14 | 1264 ms | 48912 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 <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+5;
int a[MAXN];
int b[MAXN];
int dpmax[MAXN][3];
int dpmin[MAXN][3];
int main(){
int n;
cin>>n;
for(int i=1;i<=2*n;i++){
cin>>a[i];
}
for(int i=1;i<=2*n;i++){
cin>>b[i];
}
for(int i=1;i<=2*n;i++){
for(int k=0;k<=1;k++){
dpmin[i][k] = 1e9;
}
}
for(int i=1;i<=2*n;i++){
for(int k=0;k<=1;k++){
if(k){
if(a[i-1]<=b[i]){
dpmin[i][k] = min(dpmin[i][k],dpmin[i-1][0]);
}
if(b[i-1]<=b[i]){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |