oj.uz

Submission #884912

# Submission time Handle Problem Language Result Execution time Memory
884912 2023-12-08T16:37:25 Z Ahmed57 Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 908 ms 1048576 KB 
#include <bits/stdc++.h>
 
using namespace std;
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    long long n,m;cin>>n>>m;
    long long ro[n+1],co[m+1];
    for(int i = 1;i<=n;i++)cin>>ro[i];
    for(int i = 1;i<=m;i++)cin>>co[i];
    long long dp[n+1][m+1];
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
            dp[i][j] = 1e18;
            if(i==1&&j==1)dp[i][j] = 0;
            if(i>1)dp[i][j] = min(dp[i][j],dp[i-1][j]+co[j]);
            if(j>1)dp[i][j] = min(dp[i][j],dp[i][j-1]+ro[i]);
        }
    }
    cout<<dp[n][m]<<endl;
    return 0;
}

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 344 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 7 ms 8332 KB Output is correct
10 Correct 6 ms 8296 KB Output is correct
11 Correct 6 ms 8284 KB Output is correct
12 Correct 6 ms 8276 KB Output is correct
13 Correct 6 ms 8284 KB Output is correct
14 Correct 6 ms 8168 KB Output is correct
15 Correct 6 ms 8280 KB Output is correct
16 Correct 7 ms 8284 KB Output is correct
17 Correct 6 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 452 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 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 344 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 908 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 344 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 7 ms 8332 KB Output is correct
10 Correct 6 ms 8296 KB Output is correct
11 Correct 6 ms 8284 KB Output is correct
12 Correct 6 ms 8276 KB Output is correct
13 Correct 6 ms 8284 KB Output is correct
14 Correct 6 ms 8168 KB Output is correct
15 Correct 6 ms 8280 KB Output is correct
16 Correct 7 ms 8284 KB Output is correct
17 Correct 6 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 452 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 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 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 2 ms 3420 KB Output is correct
32 Runtime error 908 ms 1048576 KB Execution killed with signal 9
33 Halted 0 ms 0 KB -