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