oj.uz

Submission #821047

# Submission time Handle Problem Language Result Execution time Memory
821047 2023-08-11T07:08:34 Z alexander707070 Sightseeing in Kyoto (JOI22_kyoto) C++14
10 / 100
 7 ms 8272 KB 
#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;   
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 6 ms 8148 KB Output is correct
10 Correct 7 ms 8148 KB Output is correct
11 Correct 5 ms 8272 KB Output is correct
12 Correct 5 ms 8148 KB Output is correct
13 Correct 6 ms 8148 KB Output is correct
14 Correct 5 ms 8192 KB Output is correct
15 Correct 7 ms 8148 KB Output is correct
16 Correct 5 ms 8148 KB Output is correct
17 Correct 6 ms 8148 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 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 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 2 ms 2772 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 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 6 ms 8148 KB Output is correct
10 Correct 7 ms 8148 KB Output is correct
11 Correct 5 ms 8272 KB Output is correct
12 Correct 5 ms 8148 KB Output is correct
13 Correct 6 ms 8148 KB Output is correct
14 Correct 5 ms 8192 KB Output is correct
15 Correct 7 ms 8148 KB Output is correct
16 Correct 5 ms 8148 KB Output is correct
17 Correct 6 ms 8148 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Incorrect 2 ms 2772 KB Output isn't correct
32 Halted 0 ms 0 KB -