# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
554060 | tht2005 | Sightseeing in Kyoto (JOI22_kyoto) | C++17 | 1 ms | 212 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>
using namespace std;
typedef long long LL;
const LL INF = numeric_limits<LL>::max();
const int N = 100005;
const int W = 2003;
int w, h, a[N], b[N], n, m, c[W], d[W];
LL f[W][W];
int main() {
freopen("kyoto.inp", "r", stdin);
scanf("%d %d", &w, &h);
for(int i = 1; i <= w; ++i) {
scanf("%d", a + i);
}
n = 0;
for(int i = 1; i <= w; ++i) {
c[++n] = i;
if(i != 1 && i != w) {
while(n > 1) {
if(a[c[n]] < a[c[n - 1]] || a[c[n]] < a[i + 1])
break;
--n;
}
}
}
for(int i = 1; i <= h; ++i) {
scanf("%d", b + i);
}
m = 0;
for(int i = 1; i <= h; ++i) {
d[++m] = i;
if(i != 1 && i != h) {
while(m > 1) {
if(b[d[m]] < b[d[m - 1]] || b[d[m]] < b[i + 1])
break;
--m;
}
}
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
f[i][j] = INF;
}
}
f[1][1] = 0;
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if(i != 1) f[i][j] = min(f[i][j], f[i - 1][j] + (LL)b[d[j]] * (c[i] - c[i - 1]));
if(j != 1) f[i][j] = min(f[i][j], f[i][j - 1] + (LL)a[c[i]] * (d[j] - d[j - 1]));
}
}
printf("%lld", f[n][m]);
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... |