Submission #602548

#	Time	Username	Problem	Language	Result	Execution time	Memory
602548		Mher	Sightseeing in Kyoto (JOI22_kyoto)	C++14	10 / 100	9 ms	8232 KiB

kyoto

#include <bits/stdc++.h>

using namespace std;

const int N = 1003;

int h, w;
int a[N], b[N];
long long 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++)
        {
            if (i == 1 && j == 1)
                continue;
            if (i == 1)
                dp[i][j] = dp[i][j - 1] + a[i];
            else if (j == 1)
                dp[i][j] = dp[i - 1][j] + b[j];
            else
                dp[i][j] = min(dp[i - 1][j] + b[j], dp[i][j - 1] + a[i]);
        }
    }
    cout << dp[h][w];
    return 0;
}

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