Submission #602557

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
602557	2022-07-23T08:27:49 Z	Tigryonochekk	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	10 ms	8148 KB

kyoto

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <string>
using namespace std;
#define ll long long
#define pii pair<int, int>
const int N = 1002;
const ll inf = 1e18 + 49;

int h, w;
int a[N], b[N];
ll dp[N][N];

int main() {
	cin >> h >> w;
	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] = inf;
			dp[1][1] = 0;
			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[h][w] << endl;
	return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	724 KB	Output is correct
5	Correct	2 ms	2260 KB	Output is correct
6	Correct	1 ms	1620 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	8 ms	8148 KB	Output is correct
10	Correct	8 ms	8148 KB	Output is correct
11	Correct	8 ms	8148 KB	Output is correct
12	Correct	7 ms	8148 KB	Output is correct
13	Correct	8 ms	8040 KB	Output is correct
14	Correct	8 ms	8148 KB	Output is correct
15	Correct	10 ms	8148 KB	Output is correct
16	Correct	9 ms	8100 KB	Output is correct
17	Correct	8 ms	8080 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	224 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Incorrect	4 ms	2644 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	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	724 KB	Output is correct
5	Correct	2 ms	2260 KB	Output is correct
6	Correct	1 ms	1620 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	8 ms	8148 KB	Output is correct
10	Correct	8 ms	8148 KB	Output is correct
11	Correct	8 ms	8148 KB	Output is correct
12	Correct	7 ms	8148 KB	Output is correct
13	Correct	8 ms	8040 KB	Output is correct
14	Correct	8 ms	8148 KB	Output is correct
15	Correct	10 ms	8148 KB	Output is correct
16	Correct	9 ms	8100 KB	Output is correct
17	Correct	8 ms	8080 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	224 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Incorrect	4 ms	2644 KB	Output isn't correct
32	Halted	0 ms	0 KB	-