#include <bits/stdc++.h>
using namespace std;
//ofstream fout("date.out");
mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
typedef long long ll;
const ll INF=1e17;
ll n,m;
ll A[100005],B[100005],dp[1005][1005];
ll from[1005][1005];
string dig(ll x)
{
string s;
while(x!=0)
{
s.push_back(char('0'+x%10));
x/=10;
}
while(s.size()<4)
s.push_back('0');
reverse(s.begin(),s.end());
return s;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
vector<ll> lins,cols;
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>A[i];
for(int i=1;i<=m;i++)
cin>>B[i];
ll minim=INF;
for(int i=n;i>=1;i--)
{
if(i==1)
lins.push_back(i);
else
{
if(A[i]<minim)
{
minim=A[i];
lins.push_back(i);
}
}
}
minim=INF;
for(int i=m;i>=1;i--)
{
if(i==1)
cols.push_back(i);
else
{
if(B[i]<minim)
{
minim=B[i];
cols.push_back(i);
}
}
}
reverse(lins.begin(),lins.end());
reverse(cols.begin(),cols.end());
for(int i=0;i<lins.size();i++)
for(int j=0;j<cols.size();j++)
if(i!=0||j!=0)
{
dp[i][j]=INF;
if(i>0)
dp[i][j]=min(dp[i][j],dp[i-1][j]+B[cols[j]]*(lins[i]-lins[i-1]));
if(j>0)
dp[i][j]=min(dp[i][j],dp[i][j-1]+A[lins[i]]*(cols[j]-cols[j-1]));
}
cout<<dp[(int)lins.size()-1][(int)cols.size()-1];
return 0;
}
Compilation message
kyoto.cpp: In function 'int main()':
kyoto.cpp:64:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
64 | for(int i=0;i<lins.size();i++)
| ~^~~~~~~~~~~~
kyoto.cpp:65:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
65 | for(int j=0;j<cols.size();j++)
| ~^~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
Output is correct |
2 |
Correct |
1 ms |
4444 KB |
Output is correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
4 |
Correct |
1 ms |
4444 KB |
Output is correct |
5 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
Output is correct |
2 |
Correct |
1 ms |
4444 KB |
Output is correct |
3 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
Output is correct |
2 |
Correct |
1 ms |
4444 KB |
Output is correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
4 |
Correct |
1 ms |
4444 KB |
Output is correct |
5 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |