Submission #994175

#TimeUsernameProblemLanguageResultExecution timeMemory
994175vjudge1Sightseeing in Kyoto (JOI22_kyoto)C++17
0 / 100
2033 ms1048576 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int H, W; cin >> H >> W; vector <unsigned long long> A(H), B(W); for(auto &x : A){ cin >> x; } for(auto &x : B){ cin >> x; } unsigned long long dp[H][W] = {0}; for(int i = 1; i < H; i++){ dp[i][0] = B[0] * i; } for(int j = 1; j < W; j++){ dp[0][j] = A[0] * j; } for(int i = 1; i < H; i++){ for(int j = 1; j < W; j++){ cerr << (dp[i][j] = min(dp[i][j - 1] + A[i], dp[i - 1][j] + B[j])) << " "; } cerr << "\n"; } cout << dp[H - 1][W - 1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...