oj.uz

Submission #706534

# Submission time Handle Problem Language Result Execution time Memory
706534 2023-03-07T01:23:49 Z pcc Sightseeing in Kyoto (JOI22_kyoto) C++14
10 / 100
 8 ms 8236 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
const ll mxn = 1010;
ll dp[mxn][mxn];
ll row[mxn],col[mxn];
ll n,m;

int main(){
    cin>>n>>m;
    if(n>mxn||m>mxn)return 0;
    dp[1][1] = 0;
    for(int i = 1;i<=n;i++)cin>>row[i];
    for(int i= 1;i<=m;i++)cin>>col[i];
    for(int i = 2;i<=n;i++){
        dp[i][1] = dp[i-1][1]+col[1];
    }
    for(int i = 2;i<=m;i++){
        dp[1][i] = dp[1][i-1]+row[1];
    }
    for(int i = 2;i<=n;i++){
        for(int j = 2;j<=m;j++){
            if(i == 1&&j == 1)continue;
            dp[i][j] = min(dp[i-1][j]+col[j],dp[i][j-1]+row[i]);
        }
    }
    // for(int i = 1;i<=n;i++){
    //     for(int j = 1;j<=m;j++){
    //         cout<<dp[i][j]<<' ';
    //     }
    //     cout<<endl;
    // }
    cout<<dp[n][m];
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 704 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 1592 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 8 ms 8152 KB Output is correct
10 Correct 8 ms 8236 KB Output is correct
11 Correct 8 ms 8148 KB Output is correct
12 Correct 8 ms 8148 KB Output is correct
13 Correct 8 ms 8148 KB Output is correct
14 Correct 8 ms 8132 KB Output is correct
15 Correct 8 ms 8148 KB Output is correct
16 Correct 8 ms 8128 KB Output is correct
17 Correct 8 ms 8148 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 704 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 1592 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 8 ms 8152 KB Output is correct
10 Correct 8 ms 8236 KB Output is correct
11 Correct 8 ms 8148 KB Output is correct
12 Correct 8 ms 8148 KB Output is correct
13 Correct 8 ms 8148 KB Output is correct
14 Correct 8 ms 8132 KB Output is correct
15 Correct 8 ms 8148 KB Output is correct
16 Correct 8 ms 8128 KB Output is correct
17 Correct 8 ms 8148 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Incorrect 1 ms 212 KB Output isn't correct
32 Halted 0 ms 0 KB -