# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
553878 | tht2005 | Sightseeing in Kyoto (JOI22_kyoto) | C++17 | 16 ms | 8188 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 = 1003;
int w, h, a[N], b[N];
LL f[N][N];
int main() {
scanf("%d %d", &w, &h);
for(int i = 1; i <= w; ++i) {
scanf("%d", a + i);
}
for(int i = 1; i <= h; ++i) {
scanf("%d", b + i);
}
for(int i = 1; i <= w; ++i) {
for(int j = 1; j <= h; ++j) {
f[i][j] = INF;
}
}
f[1][1] = 0;
for(int i = 1; i <= w; ++i) {
for(int j = 1; j <= h; ++j) {
if(i != 1) f[i][j] = min(f[i][j], f[i - 1][j] + b[j]);
if(j != 1) f[i][j] = min(f[i][j], f[i][j - 1] + a[i]);
}
}
printf("%lld", f[w][h]);
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... |