| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 783221 | Dan4Life | Sightseeing in Kyoto (JOI22_kyoto) | C++17 | 14 ms | 8332 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;
#define int long long
const int mxN = (int)1e3+10;
int n, m;
int dp[mxN][mxN];
int a[100010], b[100010];
int32_t main()
{
cin >> n >> m;
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < m; i++) cin >> b[i];
memset(dp,63,sizeof(dp)); dp[1][1] = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
if(i>1) dp[i][j] = min(dp[i][j], dp[i-1][j]+b[j-1]);
if(j>1) dp[i][j] = min(dp[i][j], dp[i][j-1]+a[i-1]);
}
}
cout << dp[n][m];
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
