제출 #602557

#제출 시각아이디문제언어결과실행 시간메모리
602557TigryonochekkSightseeing in Kyoto (JOI22_kyoto)C++17
10 / 100
10 ms8148 KiB
#include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <set> #include <map> #include <string> using namespace std; #define ll long long #define pii pair<int, int> const int N = 1002; const ll inf = 1e18 + 49; int h, w; int a[N], b[N]; ll dp[N][N]; int main() { 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 <= h; i++) { for (int j = 1; j <= w; j++) { dp[i][j] = inf; dp[1][1] = 0; if (i > 1) dp[i][j] = min(dp[i][j], dp[i - 1][j] + b[j]); if (j > 1) dp[i][j] = min(dp[i][j], dp[i][j - 1] + a[i]); } } cout << dp[h][w] << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...