//https://www.instagram.com/_modwwe/
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
void phongbeo();
const int inf=1e14;
const int mod2=1e9+7;
const int mod1=998244353;
struct icd
{
int a,b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c,d,e,f;
};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l,s33;
int i,s10,s12;
int kk;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
// fin(task),fou(task);
#endif
NHP
/// cin>>s1;
// modwwe
phongbeo();
}
vector<int> v;
vector<int> v2;
int a[100001];
int b[100001];
int c[100002];
void phongbeo()
{
cin>>n>>m;
for(int i=1; i<=n; i++) cin>>a[i];
for(int i=1; i<=m; i++) cin>>b[i];
c[0]=inf;
for(int i=1; i<=n; i++)
{
if(a[i]<c[i-1])
c[i]=a[i],v.pb(i);
else c[i]=c[i-1];
}
c[0]=inf;
for(int i=1; i<=m; i++)
{
if(b[i]<c[i-1])
c[i]=b[i],v2.pb(i);
else c[i]=c[i-1];
}
l=0;
r=0;
s4=0;
/*c[n+1]=inf;
for(int i=n; i>=1; --i){
if(i==s5) break;
if(a[i]<c[i+1])
c[i]=a[i],v.pb(i);
else c[i]=c[i+1];}
c[m+1]=inf;
for(int i=m; i>=1; --i){
if(i==s6) break;
if(b[i]<c[i+1])
c[i]=b[i],v2.pb(i);
else c[i]=c[i+1];
}
sort(v.begin(),v.end());
sort(v2.begin(),v2.end());
l=0 ;
r=0;*/
int n2=n;
int m2=m;
s5=v.back();
s6=v2.back();
n=v.size();
m=v2.size();
reverse(v.begin(),v.end());
reverse(v2.begin(),v2.end());
l=0;
r=0;
while(l+1<n||r+1<m)
{
if(l+1==n)
{
s4+=abs(v2.back()-v2[r])*a[v[l]];
break;
}
else if(r+1==m)
{
s4+=abs(v.back()-v[l])*b[v2[r]];
break;
}
else
{
s2=a[v[l]]*abs(v2[r+1]-v2[r])+b[v2[r+1]]*abs(v[l+1]-v[l]);
s3=b[v2[r]]*abs(v[l+1]-v[l])+a[v[l+1]]*abs(v2[r+1]-v2[r]);
if(s2>=s3)
{
int l2=l+1;
s4+=abs(v[l2]-v[l])*(b[v2[r]]);
l=l2;
}
else
{
int l2=r+1;
s4+=abs(v2[l2]-v2[r])*a[v[l]];
r=l2;
}
}
}
n=n2;
m=m2;
v.clear();
v2.clear();
c[n+1]=inf;
for(int i=n; i>=1; --i)
{
if(i==s5)
{
v.pb(s5);
break;
}
if(a[i]<c[i+1])
c[i]=a[i],v.pb(i);
else c[i]=c[i+1];
}
c[m+1]=inf;
for(int i=m; i>=1; --i)
{
if(i==s6)
{
v2.pb(s6);
break;
}
if(b[i]<c[i+1])
c[i]=b[i],v2.pb(i);
else c[i]=c[i+1];
}
l=0;
r=0;
n=v.size();
m=v2.size();
reverse(v.begin(),v.end());
reverse(v2.begin(),v2.end());
//cout<<n<<" "<<m<<" "<<s4<<"\n";
while(l+1<n||r+1<m)
{
if(l+1==n)
{
s4+=abs(v2.back()-v2[r])*a[v[l]];
break;
}
else if(r+1==m)
{
s4+=abs(v.back()-v[l])*b[v2[r]];
break;
}
else
{
s2=a[v[l]]*abs(v2[r+1]-v2[r])+b[v2[r+1]]*abs(v[l+1]-v[l]);
s3=b[v2[r]]*abs(v[l+1]-v[l])+a[v[l+1]]*abs(v2[r+1]-v2[r]);
if(s2>=s3)
{
int l2=l+1;
s4+=abs(v[l2]-v[l])*(b[v2[r]]);
l=l2;
}
else
{
int l2=r+1;
s4+=abs(v2[l2]-v2[r])*a[v[l]];
r=l2;
}
}
}
cout<<s4;
}
Compilation message
kyoto.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
49 | main()
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
