답안 #631411

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
631411	2022-08-18T05:53:22 Z	LittleCube	Sightseeing in Kyoto (JOI22_kyoto)	C++14	10 / 100	12 ms	8208 KB

kyoto

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

ll H, W, A[1005], B[1005], dp[1005][1005];

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	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] = (i + j == 2 ? 0 : 1e18);
			if(j > 1)
				dp[i][j] = min(dp[i][j], dp[i][j - 1] + A[i]);
			if(i > 1)
				dp[i][j] = min(dp[i][j], dp[i - 1][j] + B[j]);
		}
	cout << dp[H][W];
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 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	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	11 ms	8148 KB	Output is correct
10	Correct	12 ms	8164 KB	Output is correct
11	Correct	12 ms	8124 KB	Output is correct
12	Correct	11 ms	8148 KB	Output is correct
13	Correct	11 ms	8148 KB	Output is correct
14	Correct	10 ms	8152 KB	Output is correct
15	Correct	10 ms	8148 KB	Output is correct
16	Correct	10 ms	8208 KB	Output is correct
17	Correct	10 ms	8144 KB	Output is correct
18	Correct	0 ms	260 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	320 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Incorrect	4 ms	2764 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3

0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 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	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	11 ms	8148 KB	Output is correct
10	Correct	12 ms	8164 KB	Output is correct
11	Correct	12 ms	8124 KB	Output is correct
12	Correct	11 ms	8148 KB	Output is correct
13	Correct	11 ms	8148 KB	Output is correct
14	Correct	10 ms	8152 KB	Output is correct
15	Correct	10 ms	8148 KB	Output is correct
16	Correct	10 ms	8208 KB	Output is correct
17	Correct	10 ms	8144 KB	Output is correct
18	Correct	0 ms	260 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	320 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	4 ms	2764 KB	Output isn't correct
32	Halted	0 ms	0 KB	-