Submission #1205956

#TimeUsernameProblemLanguageResultExecution timeMemory
1205956PenguinsAreCuteSightseeing in Kyoto (JOI22_kyoto)C++20
10 / 100
530 ms1114112 KiB
#include <bits/stdc++.h> using namespace std; int main() { int h, w; cin >> h >> w; int a[h], b[w]; for(int i=0;i<h;i++) cin >> a[i]; for(int i=0;i<w;i++) cin >> b[i]; long long dp[h][w]; memset(dp,1,sizeof(dp)); dp[0][0] = 0; for(int i=0;i<h;i++) for(int j=0;j<w;j++) { if(j) dp[i][j] = min(dp[i][j], dp[i][j-1] + a[i]); if(i) dp[i][j] = min(dp[i][j], dp[i-1][j] + b[j]); } cout << dp[h-1][w-1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...