Submission #887593

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
887593	2023-12-14T19:47:47 Z	TAhmed33	Sightseeing in Kyoto (JOI22_kyoto)	C++	10 / 100	6 ms	8536 KB

kyoto

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[1001], b[1001], n, m, dp[1001][1001];
int main () {
	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 j = 1; j <= m; j++) {
			if (i == j && j == 1) continue;
			dp[i][j] = 1e18;
			if (i != 1) dp[i][j] = min(dp[i][j], dp[i - 1][j] + b[j]);
			if (j != 1) dp[i][j] = min(dp[i][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	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	2652 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	5 ms	8536 KB	Output is correct
10	Correct	6 ms	8280 KB	Output is correct
11	Correct	6 ms	8280 KB	Output is correct
12	Correct	5 ms	8536 KB	Output is correct
13	Correct	6 ms	8284 KB	Output is correct
14	Correct	6 ms	8536 KB	Output is correct
15	Correct	5 ms	8160 KB	Output is correct
16	Correct	6 ms	8284 KB	Output is correct
17	Correct	6 ms	8088 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	440 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	448 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	600 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	2 ms	4700 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	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	2652 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	5 ms	8536 KB	Output is correct
10	Correct	6 ms	8280 KB	Output is correct
11	Correct	6 ms	8280 KB	Output is correct
12	Correct	5 ms	8536 KB	Output is correct
13	Correct	6 ms	8284 KB	Output is correct
14	Correct	6 ms	8536 KB	Output is correct
15	Correct	5 ms	8160 KB	Output is correct
16	Correct	6 ms	8284 KB	Output is correct
17	Correct	6 ms	8088 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	440 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	448 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	600 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Incorrect	2 ms	4700 KB	Output isn't correct
32	Halted	0 ms	0 KB	-