# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
821157 | 2023-08-11T07:51:10 Z | danikoynov | Sightseeing in Kyoto (JOI22_kyoto) | C++14 | 0 ms | 212 KB |
#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 i = 2; i <= h; i ++) { for (int j = 2; j <= w; j ++) dp[j] = min(dp[j], dp[j - 1]); for (int j = 1; j <= w; j ++) { dp[j] += (ll)(j) * (a[i - 1] - a[i]) + b[j]; } for (int j = 1; j <= w; j ++) cout << dp[j] << " "; cout << endl; } 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |