Submission #994207

# Submission time Handle Problem Language Result Execution time Memory
994207 2024-06-07T08:55:48 Z vjudge1 Sightseeing in Kyoto (JOI22_kyoto) C++17
0 / 100
406 ms 1048576 KB
#include <bits/stdc++.h>
using namespace std;
using ll=long long;

void solve();

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);

    int t=1;
    //cin>>t;
    while (t--) solve();
    return 0;
}

const int maxn = 1e5+1;

ll a[maxn], b[maxn];

void solve(){
    int h,w;
    cin>>h>>w;
    for (int i = 1; i <= h; i++)
    {
        cin>>a[i];
    }
    for (int i = 1; i <= w; i++)
    {
        cin>>b[i];
    }

    vector<vector<ll>> dp(h+1, vector<ll> (w+1, 1e11));
    dp[1][1]=0;

    for (int i=1;i<=h;i++){
        for (int j = 1; j <= w; j++)
        {
            if (i==1 && j==1 ) continue;
            int x=b[j];
            int y=a[i];
            dp[i][j]=min(dp[i-1][j]+x, dp[i][j-1]+y);
        }
        
    }
    cout<<dp[h][w]<<"\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 860 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 3420 KB Output is correct
4 Runtime error 406 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 860 KB Output isn't correct
5 Halted 0 ms 0 KB -