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 f first
#define s second
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define vec vector
#define pb push_back
#define sz(x) (int)(x).size()
#define pw(x) (1LL<<(x))
#define fast_resp ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef long double ld;
typedef pair<int,ll> pil;
template<class T> bool umin(T &a,const T &b){return (a>b?a=b,1:0);}
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
const int M=1e9+7;
//const int N=5e5+1;
void add(int &a,int b){
a+=b;
if(a>=M) a-=M;
else if(a<0) a+=M;
}
int mult(int a,int b){
return 1ll*a*b%M;
}
//int dp[N][26];
const int N=4e3+1;
ll dp[N][N];
signed main(){
fast_resp;
int n,m;
cin>>n>>m;
vec<int>a(n),b(m);
// int i=0,j=0;
for(auto &z : a) cin>>z;
for(auto &z : b) cin>>z;
vec<int> p1(n),p2(m);
vec<int> kx,ky;
iota(all(p1),0);
sort(all(p1),[&](int i,int j){return m_p(a[i],i)<m_p(a[j],j);});
for(int i=0;i<min(n,1000);i++) kx.pb(p1[i]);
sort(all(p1),[&](int i,int j){return m_p(a[i],-i)<m_p(a[j],-j);});
for(int i=0;i<min(1000,n);i++) kx.pb(n-i-1);
for(int i=0;i<min(1000,n);i++) kx.pb(i);
iota(all(p2),0);
sort(all(p2),[&](int i,int j){return m_p(b[i],i)<m_p(b[j],j);});
for(int i=0;i<min(n,1000);i++) ky.pb(p2[i]);
sort(all(p2),[&](int i,int j){return m_p(b[i],-i)<m_p(b[j],-j);});
for(int i=0;i<min(m,1000);i++) ky.pb(p2[i]);
for(int i=0;i<min(1000,m);i++) ky.pb(m-i-1);
for(int i=0;i<min(1000,m);i++) ky.pb(i);
sort(all(kx));kx.erase(unique(all(kx)),kx.end());
sort(all(ky));ky.erase(unique(all(ky)),ky.end());
// cout<<endl;
// cout<<0<<' ';
for(int i=0;i<sz(kx);i++){
for(int j=0;j<sz(ky);j++){
if(!i && !j) continue;
dp[i][j]=1e18;
if(i) umin(dp[i][j],dp[i-1][j]+1ll*(kx[i]-kx[i-1])*b[ky[j]]);
if(j) umin(dp[i][j],dp[i][j-1]+1ll*(ky[j]-ky[j-1])*a[kx[i]]);
// cout<<dp[i][j]-((i&&j)?dp[i-1][j-1]:0)<<' ';
}
// cout<<endl;
}
cout<<dp[sz(kx)-1][sz(ky)-1];
return 0;
}
/*
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |