Submission #887593

#	Time	Username	Problem	Language	Result	Execution time	Memory
887593		TAhmed33	Sightseeing in Kyoto (JOI22_kyoto)	C++98	10 / 100	6 ms	8536 KiB

kyoto

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[1001], b[1001], n, m, dp[1001][1001];
int main () {
	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++) {
			if (i == j && j == 1) continue;
			dp[i][j] = 1e18;
			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[n][m] << '\n';
}

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