답안 #994240

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
994240	2024-06-07T09:41:55 Z	vjudge1	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	5 ms	8328 KB

kyoto

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 1010;

ll dp[MAXN][MAXN], a[MAXN], b[MAXN];

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m; 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++) {
            dp[i][j] = 1e18;
        }
    }
    dp[1][1] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            dp[i][j+1] = min(dp[i][j+1], dp[i][j] + a[i]);
            dp[i+1][j] = min(dp[i+1][j], dp[i][j] + b[j]);
        }
    }
    cout << dp[n][m] << "\n";
    return 0;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 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	2396 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	3 ms	8284 KB	Output is correct
10	Correct	3 ms	8284 KB	Output is correct
11	Correct	3 ms	8284 KB	Output is correct
12	Correct	3 ms	8284 KB	Output is correct
13	Correct	5 ms	8284 KB	Output is correct
14	Correct	4 ms	8284 KB	Output is correct
15	Correct	4 ms	8328 KB	Output is correct
16	Correct	3 ms	8280 KB	Output is correct
17	Correct	3 ms	8284 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	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 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	348 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

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

Subtask #3

0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 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	2396 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	3 ms	8284 KB	Output is correct
10	Correct	3 ms	8284 KB	Output is correct
11	Correct	3 ms	8284 KB	Output is correct
12	Correct	3 ms	8284 KB	Output is correct
13	Correct	5 ms	8284 KB	Output is correct
14	Correct	4 ms	8284 KB	Output is correct
15	Correct	4 ms	8328 KB	Output is correct
16	Correct	3 ms	8280 KB	Output is correct
17	Correct	3 ms	8284 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	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 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	348 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	1 ms	4700 KB	Output isn't correct
32	Halted	0 ms	0 KB	-