Submission #821057

#TimeUsernameProblemLanguageResultExecution timeMemory
821057DobromirAngelovSightseeing in Kyoto (JOI22_kyoto)C++17
10 / 100
8 ms8148 KiB
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;

const long long INF=1e18;

int n,m;
long long dp[1005][1005];
long long a[1005];
long long b[1005];

int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=m;i++) cin>>b[i];

dp[1][1]=0;
for(int i=1;i<=n;i++)
{
    for(int j=1;j<=m;j++)
    {
        if(i>1 || j>1) dp[i][j]=INF;
        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]<<endl;
return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...