Submission #814941

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
814941	2023-08-08T11:17:01 Z	groshi	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	43 ms	63908 KB

kyoto

#include<bits/stdc++.h>
#define int long long
using namespace std;
int dp[2000][2000];
int a[2000],b[2000];
int32_t main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    int h,w;
    cin>>h>>w;
    for(int i=0;i<=h;i++)
        for(int j=0;j<=w;j++)
            dp[i][j]=1e18;
    dp[1][1]=0;
    for(int i=1;i<=h;i++)
        cin>>a[i];
    for(int i=1;i<=w;i++)
        cin>>b[i];
    for(int i=1;i<=h;i++)
        for(int j=1;j<=w;j++)
        {
            dp[i][j]=min(dp[i][j],dp[i-1][j]+b[j]);
            dp[i][j]=min(dp[i][j],dp[i][j-1]+a[i]);
        }
    cout<<dp[h][w];
    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	0 ms	340 KB	Output is correct
4	Correct	1 ms	980 KB	Output is correct
5	Correct	1 ms	2260 KB	Output is correct
6	Correct	1 ms	1612 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	7 ms	12244 KB	Output is correct
10	Correct	9 ms	12244 KB	Output is correct
11	Correct	7 ms	12244 KB	Output is correct
12	Correct	7 ms	12296 KB	Output is correct
13	Correct	9 ms	12244 KB	Output is correct
14	Correct	9 ms	12292 KB	Output is correct
15	Correct	8 ms	12292 KB	Output is correct
16	Correct	6 ms	12244 KB	Output is correct
17	Correct	7 ms	12244 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	336 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	332 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	1 ms	340 KB	Output is correct
3	Correct	4 ms	4564 KB	Output is correct
4	Runtime error	43 ms	63908 KB	Execution killed with signal 11
5	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	0 ms	340 KB	Output is correct
4	Correct	1 ms	980 KB	Output is correct
5	Correct	1 ms	2260 KB	Output is correct
6	Correct	1 ms	1612 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	7 ms	12244 KB	Output is correct
10	Correct	9 ms	12244 KB	Output is correct
11	Correct	7 ms	12244 KB	Output is correct
12	Correct	7 ms	12296 KB	Output is correct
13	Correct	9 ms	12244 KB	Output is correct
14	Correct	9 ms	12292 KB	Output is correct
15	Correct	8 ms	12292 KB	Output is correct
16	Correct	6 ms	12244 KB	Output is correct
17	Correct	7 ms	12244 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	336 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	332 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	1 ms	340 KB	Output is correct
31	Correct	4 ms	4564 KB	Output is correct
32	Runtime error	43 ms	63908 KB	Execution killed with signal 11
33	Halted	0 ms	0 KB	-