oj.uz

Submission #994223

# Submission time Handle Problem Language Result Execution time Memory
994223 2024-06-07T09:26:25 Z UVince Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 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;
const ll inf = 1e18;

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, inf));
    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";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 8232 KB Output is correct
10 Correct 5 ms 8284 KB Output is correct
11 Correct 4 ms 8216 KB Output is correct
12 Correct 5 ms 8284 KB Output is correct
13 Correct 5 ms 8312 KB Output is correct
14 Correct 5 ms 8120 KB Output is correct
15 Correct 5 ms 8284 KB Output is correct
16 Correct 5 ms 8284 KB Output is correct
17 Correct 5 ms 8284 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 2 ms 3416 KB Output is correct
4 Runtime error 406 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 8232 KB Output is correct
10 Correct 5 ms 8284 KB Output is correct
11 Correct 4 ms 8216 KB Output is correct
12 Correct 5 ms 8284 KB Output is correct
13 Correct 5 ms 8312 KB Output is correct
14 Correct 5 ms 8120 KB Output is correct
15 Correct 5 ms 8284 KB Output is correct
16 Correct 5 ms 8284 KB Output is correct
17 Correct 5 ms 8284 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 600 KB Output is correct
31 Correct 2 ms 3416 KB Output is correct
32 Runtime error 406 ms 1048576 KB Execution killed with signal 9
33 Halted 0 ms 0 KB -