Submission #712917

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
712917	2023-03-20T12:58:08 Z	lam	Sightseeing in Kyoto (JOI22_kyoto)	C++14	10 / 100	9 ms	8280 KB

kyoto

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e3 + 10;
typedef pair<int,int> ii;
#define ff first
#define ss second
int n,m;
int a[maxn],b[maxn];
int dp[maxn][maxn];
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>a[i];
    for (int j=1; j<=m; j++) cin>>b[j];
    for (int i=0; i<=n; i++)
        for (int j=0; j<=m; j++) dp[i][j] = 1e18;
    dp[1][1] = 0;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=m; j++)
    {
        if (i==1&&j==1) continue;
        dp[i][j] = min(dp[i-1][j] + b[j], dp[i][j-1] + a[i]);
    }
    cout<<dp[n][m]<<'\n';
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1616 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	8 ms	8164 KB	Output is correct
10	Correct	8 ms	8148 KB	Output is correct
11	Correct	8 ms	8276 KB	Output is correct
12	Correct	8 ms	8276 KB	Output is correct
13	Correct	9 ms	8148 KB	Output is correct
14	Correct	8 ms	8276 KB	Output is correct
15	Correct	9 ms	8268 KB	Output is correct
16	Correct	8 ms	8280 KB	Output is correct
17	Correct	9 ms	8276 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	328 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	1 ms	340 KB	Output is correct
27	Correct	1 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	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Incorrect	3 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	1 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	1616 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	8 ms	8164 KB	Output is correct
10	Correct	8 ms	8148 KB	Output is correct
11	Correct	8 ms	8276 KB	Output is correct
12	Correct	8 ms	8276 KB	Output is correct
13	Correct	9 ms	8148 KB	Output is correct
14	Correct	8 ms	8276 KB	Output is correct
15	Correct	9 ms	8268 KB	Output is correct
16	Correct	8 ms	8280 KB	Output is correct
17	Correct	9 ms	8276 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	328 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	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Incorrect	3 ms	2772 KB	Output isn't correct
32	Halted	0 ms	0 KB	-