Submission #788385

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
788385	2023-07-20T07:42:19 Z	vjudge1	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	6 ms	8284 KB

kyoto

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int n, m, A[N], B[N];
signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> A[i];
	}
	for (int i = 1; i <= m; i++) {
		cin >> B[i];
	}
	if (max(n, m) <= 1000) {
		static int dp[1005][1005];
		memset(dp, 0x3f, sizeof dp);
		dp[1][1] = 0;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				if (i > 1 || j > 1) {
					dp[i][j] = min(dp[i - 1][j] + B[j], dp[i][j - 1] + A[i]);
				}
			}
		}
		cout << dp[n][m] << "\n";
		return 0;
	}
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	8148 KB	Output is correct
2	Correct	3 ms	8148 KB	Output is correct
3	Correct	4 ms	8140 KB	Output is correct
4	Correct	3 ms	8148 KB	Output is correct
5	Correct	3 ms	8148 KB	Output is correct
6	Correct	3 ms	8148 KB	Output is correct
7	Correct	3 ms	8148 KB	Output is correct
8	Correct	3 ms	8140 KB	Output is correct
9	Correct	5 ms	8148 KB	Output is correct
10	Correct	5 ms	8276 KB	Output is correct
11	Correct	5 ms	8152 KB	Output is correct
12	Correct	5 ms	8284 KB	Output is correct
13	Correct	5 ms	8160 KB	Output is correct
14	Correct	6 ms	8148 KB	Output is correct
15	Correct	5 ms	8152 KB	Output is correct
16	Correct	5 ms	8152 KB	Output is correct
17	Correct	4 ms	8276 KB	Output is correct
18	Correct	4 ms	8148 KB	Output is correct
19	Correct	3 ms	8148 KB	Output is correct
20	Correct	3 ms	8136 KB	Output is correct
21	Correct	3 ms	8236 KB	Output is correct
22	Correct	3 ms	8132 KB	Output is correct
23	Correct	3 ms	8148 KB	Output is correct
24	Correct	3 ms	8148 KB	Output is correct
25	Correct	3 ms	8148 KB	Output is correct
26	Correct	3 ms	8148 KB	Output is correct
27	Correct	3 ms	8148 KB	Output is correct
28	Correct	3 ms	8148 KB	Output is correct

Subtask #2

0 / 30.0

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

Subtask #3

0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	8148 KB	Output is correct
2	Correct	3 ms	8148 KB	Output is correct
3	Correct	4 ms	8140 KB	Output is correct
4	Correct	3 ms	8148 KB	Output is correct
5	Correct	3 ms	8148 KB	Output is correct
6	Correct	3 ms	8148 KB	Output is correct
7	Correct	3 ms	8148 KB	Output is correct
8	Correct	3 ms	8140 KB	Output is correct
9	Correct	5 ms	8148 KB	Output is correct
10	Correct	5 ms	8276 KB	Output is correct
11	Correct	5 ms	8152 KB	Output is correct
12	Correct	5 ms	8284 KB	Output is correct
13	Correct	5 ms	8160 KB	Output is correct
14	Correct	6 ms	8148 KB	Output is correct
15	Correct	5 ms	8152 KB	Output is correct
16	Correct	5 ms	8152 KB	Output is correct
17	Correct	4 ms	8276 KB	Output is correct
18	Correct	4 ms	8148 KB	Output is correct
19	Correct	3 ms	8148 KB	Output is correct
20	Correct	3 ms	8136 KB	Output is correct
21	Correct	3 ms	8236 KB	Output is correct
22	Correct	3 ms	8132 KB	Output is correct
23	Correct	3 ms	8148 KB	Output is correct
24	Correct	3 ms	8148 KB	Output is correct
25	Correct	3 ms	8148 KB	Output is correct
26	Correct	3 ms	8148 KB	Output is correct
27	Correct	3 ms	8148 KB	Output is correct
28	Correct	3 ms	8148 KB	Output is correct
29	Correct	3 ms	8200 KB	Output is correct
30	Correct	3 ms	8148 KB	Output is correct
31	Incorrect	1 ms	340 KB	Output isn't correct
32	Halted	0 ms	0 KB	-