# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1014111 | Aiperiii | Building 4 (JOI20_building4) | C++14 | 169 ms | 68936 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 int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int N=5e5+5;
pair <int,int> dp[N*2][2];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n;
cin>>n;
vector <int> a(n*2+1),b(n*2+1);
for(int i=1;i<=n*2;i++){
cin>>a[i];
}
for(int i=1;i<=n*2;i++){
cin>>b[i];
}
dp[1][0]={0,0};
dp[1][1]={1,1};
for(int i=2;i<=n*2;i++){
dp[i][0]={1e9,-1e9};
dp[i][1]={1e9,-1e9};
}
for(int i=2;i<=n*2;i++){
if(a[i]>=a[i-1]){
dp[i][0].ff=min(dp[i][0].ff,dp[i-1][0].ff);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |