Submission #821047

#TimeUsernameProblemLanguageResultExecution timeMemory
821047alexander707070Sightseeing in Kyoto (JOI22_kyoto)C++14
10 / 100
7 ms8272 KiB
#include<bits/stdc++.h> #define MAXN 1007 using namespace std; const long long inf=1e17; int n,m; long long a[MAXN],b[MAXN]; long long dp[MAXN][MAXN]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 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 f=1;f<=m;f++){ dp[i][f]=inf; if(i==f and i==1){ dp[i][f]=0; continue; }else{ if(i>1)dp[i][f]=min(dp[i][f],dp[i-1][f]+b[f]); if(f>1)dp[i][f]=min(dp[i][f],dp[i][f-1]+a[i]); } } } cout<<dp[n][m]<<"\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...