Submission #602557

#	Time	Username	Problem	Language	Result	Execution time	Memory
602557		Tigryonochekk	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	10 ms	8148 KiB

kyoto

#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;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 30
• Subtask 3: 0 / 60