Submission #994218

#TimeUsernameProblemLanguageResultExecution timeMemory
994218vjudge1Sightseeing in Kyoto (JOI22_kyoto)C++17
0 / 100
3 ms8076 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; const int MAXN = 1001; ll dp[MAXN][MAXN], a[MAXN], b[MAXN]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= m; i++) cin >> b[i]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { dp[i][j] = 1e18; } } dp[1][1] = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { dp[i][j+1] = min(dp[i][j+1], dp[i][j] + a[i]); dp[i+1][j] = min(dp[i+1][j], dp[i][j] + b[j]); } } cout << dp[n][m] << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...