# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
821209 | danikoynov | Sightseeing in Kyoto (JOI22_kyoto) | C++14 | 4 ms | 324 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 endl '\n'
using namespace std;
typedef long long ll;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const int maxn = 1e3 + 10;
const ll inf = 1e18;
int h, w;
ll a[maxn], b[maxn], dp[maxn];
void solve()
{
cin >> h >> w;
for (int i = 1; i <= h; i ++)
cin >> a[i];
for (int i = 1; i <= w; i ++)
cin >> b[i];
for (int i = 1; i <= w; i ++)
dp[i] = (ll)1 * (-a[1]);
/**cout << "---------" << endl;
for (int j = 1; j <= w; j ++)
cout << dp[j] << " ";
cout << endl;*/
for (int j = 2; j <= w; j ++)
dp[j] = min(dp[j], dp[j - 1]);
for (int i = 2; i <= h; i ++)
{
/**for (int j = 1; j <= w; j ++)
cout << dp[j] << " ";
cout << endl;*/
for (int j = 1; j <= w; j ++)
{
dp[j] += (ll)(j) * (a[i - 1] - a[i]) + b[j];
}
if (i != h)
for (int j = 2; j <= w; j ++)
dp[j] = min(dp[j], dp[j - 1]);
}
ll ans = inf;
for (int j = 1; j <= w; j ++)
ans = min(ans, + w * a[h] + dp[j]);
cout << ans << endl;
}
int main()
{
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |