# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
952982 | andrei_boaca | Building 4 (JOI20_building4) | C++17 | 204 ms | 45636 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;
struct date
{
int l,r;
};
int n,a[1000005],b[1000005];
int last;
char sol[1000005];
date dp[2][1000005]; /// 0 -> A, 1 -> B
date plsput(date a, date b)
{
if(a.l==-1)
return b;
a.l=min(a.l,b.l);
a.r=max(a.r,b.r);
return a;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n;
n*=2;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
cin>>b[i];
dp[0][1]={1,1};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |