# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1008387 | giorgi_pkhaladze | Building 4 (JOI20_building4) | C++17 | 37 ms | 4432 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 ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define ff first
#define ss second
using namespace std;
int n,m,k,i,j,ans,a[2][50005],d[2][50005][2];
int main() {
cin>>n;
n*=2;
for(k=1; k<=n; k++)
cin>>a[1][k];
for(k=1; k<=n; k++)
cin>>a[0][k];
for(k=1; k<=n; k++){
for(i=0; i<=1; i++){
d[i][k][0]=n+1;
d[i][k][1]=-1;
for(j=0; j<=1; j++){
if(a[j][k-1]<=a[i][k]){
d[i][k][0]=min(d[i][k][0],d[j][k-1][0]+i);
d[i][k][1]=max(d[i][k][1],d[j][k-1][1]+i);
}
}
}
}
int sz=-1;
int pos=-1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |