Submission #783221

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
783221	2023-07-14T18:15:56 Z	Dan4Life	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	14 ms	8332 KB

kyoto

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = (int)1e3+10;
int n, m;
int dp[mxN][mxN];
int a[100010], b[100010];

int32_t main()
{
	cin >> n >> m;
	for(int i = 0; i < n; i++) cin >> a[i];
	for(int i = 0; i < m; i++) cin >> b[i];
	memset(dp,63,sizeof(dp)); dp[1][1] = 0;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(i>1) dp[i][j] = min(dp[i][j], dp[i-1][j]+b[j-1]);
			if(j>1) dp[i][j] = min(dp[i][j], dp[i][j-1]+a[i-1]);
		}
	}
	cout << dp[n][m];
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	8276 KB	Output is correct
2	Correct	4 ms	8248 KB	Output is correct
3	Correct	3 ms	8276 KB	Output is correct
4	Correct	4 ms	8276 KB	Output is correct
5	Correct	4 ms	8232 KB	Output is correct
6	Correct	3 ms	8276 KB	Output is correct
7	Correct	4 ms	8276 KB	Output is correct
8	Correct	4 ms	8276 KB	Output is correct
9	Correct	7 ms	8276 KB	Output is correct
10	Correct	7 ms	8324 KB	Output is correct
11	Correct	8 ms	8276 KB	Output is correct
12	Correct	7 ms	8276 KB	Output is correct
13	Correct	7 ms	8276 KB	Output is correct
14	Correct	7 ms	8280 KB	Output is correct
15	Correct	14 ms	8328 KB	Output is correct
16	Correct	8 ms	8276 KB	Output is correct
17	Correct	8 ms	8332 KB	Output is correct
18	Correct	3 ms	8276 KB	Output is correct
19	Correct	3 ms	8276 KB	Output is correct
20	Correct	3 ms	8276 KB	Output is correct
21	Correct	3 ms	8276 KB	Output is correct
22	Correct	3 ms	8228 KB	Output is correct
23	Correct	3 ms	8244 KB	Output is correct
24	Correct	3 ms	8276 KB	Output is correct
25	Correct	4 ms	8244 KB	Output is correct
26	Correct	3 ms	8276 KB	Output is correct
27	Correct	3 ms	8276 KB	Output is correct
28	Correct	3 ms	8276 KB	Output is correct

Subtask #2

0 / 30.0

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

Subtask #3

0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	8276 KB	Output is correct
2	Correct	4 ms	8248 KB	Output is correct
3	Correct	3 ms	8276 KB	Output is correct
4	Correct	4 ms	8276 KB	Output is correct
5	Correct	4 ms	8232 KB	Output is correct
6	Correct	3 ms	8276 KB	Output is correct
7	Correct	4 ms	8276 KB	Output is correct
8	Correct	4 ms	8276 KB	Output is correct
9	Correct	7 ms	8276 KB	Output is correct
10	Correct	7 ms	8324 KB	Output is correct
11	Correct	8 ms	8276 KB	Output is correct
12	Correct	7 ms	8276 KB	Output is correct
13	Correct	7 ms	8276 KB	Output is correct
14	Correct	7 ms	8280 KB	Output is correct
15	Correct	14 ms	8328 KB	Output is correct
16	Correct	8 ms	8276 KB	Output is correct
17	Correct	8 ms	8332 KB	Output is correct
18	Correct	3 ms	8276 KB	Output is correct
19	Correct	3 ms	8276 KB	Output is correct
20	Correct	3 ms	8276 KB	Output is correct
21	Correct	3 ms	8276 KB	Output is correct
22	Correct	3 ms	8228 KB	Output is correct
23	Correct	3 ms	8244 KB	Output is correct
24	Correct	3 ms	8276 KB	Output is correct
25	Correct	4 ms	8244 KB	Output is correct
26	Correct	3 ms	8276 KB	Output is correct
27	Correct	3 ms	8276 KB	Output is correct
28	Correct	3 ms	8276 KB	Output is correct
29	Correct	3 ms	8276 KB	Output is correct
30	Correct	3 ms	8240 KB	Output is correct
31	Incorrect	5 ms	8276 KB	Output isn't correct
32	Halted	0 ms	0 KB	-