Submission #593004

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
593004	2022-07-10T06:26:37 Z	jhnah917	Sightseeing in Kyoto (JOI22_kyoto)	C++14	10 / 100	8 ms	8344 KB

kyoto

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll N, M, A[1010], B[1010], D[1010][1010];

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N >> M;
    for(int i=1; i<=N; i++) cin >> A[i];
    for(int i=1; i<=M; i++) cin >> B[i];
    memset(D, 0x3f, sizeof D);
    D[1][1] = 0;
    for(int i=1; i<=N; i++){
        for(int j=1; j<=M; j++){
            if(i > 1) D[i][j] = min(D[i][j], D[i-1][j] + B[j]);
            if(j > 1) D[i][j] = min(D[i][j], D[i][j-1] + A[i]);
        }
    }
    cout << D[N][M];
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	8228 KB	Output is correct
2	Correct	3 ms	8276 KB	Output is correct
3	Correct	5 ms	8276 KB	Output is correct
4	Correct	4 ms	8276 KB	Output is correct
5	Correct	4 ms	8276 KB	Output is correct
6	Correct	3 ms	8276 KB	Output is correct
7	Correct	3 ms	8276 KB	Output is correct
8	Correct	4 ms	8276 KB	Output is correct
9	Correct	8 ms	8344 KB	Output is correct
10	Correct	7 ms	8292 KB	Output is correct
11	Correct	7 ms	8344 KB	Output is correct
12	Correct	8 ms	8276 KB	Output is correct
13	Correct	7 ms	8276 KB	Output is correct
14	Correct	8 ms	8280 KB	Output is correct
15	Correct	8 ms	8276 KB	Output is correct
16	Correct	8 ms	8276 KB	Output is correct
17	Correct	7 ms	8284 KB	Output is correct
18	Correct	3 ms	8200 KB	Output is correct
19	Correct	3 ms	8276 KB	Output is correct
20	Correct	3 ms	8276 KB	Output is correct
21	Correct	3 ms	8276 KB	Output is correct
22	Correct	3 ms	8276 KB	Output is correct
23	Correct	3 ms	8276 KB	Output is correct
24	Correct	3 ms	8276 KB	Output is correct
25	Correct	3 ms	8268 KB	Output is correct
26	Correct	4 ms	8276 KB	Output is correct
27	Correct	3 ms	8276 KB	Output is correct
28	Correct	3 ms	8276 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	8276 KB	Output is correct
2	Correct	3 ms	8276 KB	Output is correct
3	Incorrect	5 ms	8276 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	8228 KB	Output is correct
2	Correct	3 ms	8276 KB	Output is correct
3	Correct	5 ms	8276 KB	Output is correct
4	Correct	4 ms	8276 KB	Output is correct
5	Correct	4 ms	8276 KB	Output is correct
6	Correct	3 ms	8276 KB	Output is correct
7	Correct	3 ms	8276 KB	Output is correct
8	Correct	4 ms	8276 KB	Output is correct
9	Correct	8 ms	8344 KB	Output is correct
10	Correct	7 ms	8292 KB	Output is correct
11	Correct	7 ms	8344 KB	Output is correct
12	Correct	8 ms	8276 KB	Output is correct
13	Correct	7 ms	8276 KB	Output is correct
14	Correct	8 ms	8280 KB	Output is correct
15	Correct	8 ms	8276 KB	Output is correct
16	Correct	8 ms	8276 KB	Output is correct
17	Correct	7 ms	8284 KB	Output is correct
18	Correct	3 ms	8200 KB	Output is correct
19	Correct	3 ms	8276 KB	Output is correct
20	Correct	3 ms	8276 KB	Output is correct
21	Correct	3 ms	8276 KB	Output is correct
22	Correct	3 ms	8276 KB	Output is correct
23	Correct	3 ms	8276 KB	Output is correct
24	Correct	3 ms	8276 KB	Output is correct
25	Correct	3 ms	8268 KB	Output is correct
26	Correct	4 ms	8276 KB	Output is correct
27	Correct	3 ms	8276 KB	Output is correct
28	Correct	3 ms	8276 KB	Output is correct
29	Correct	4 ms	8276 KB	Output is correct
30	Correct	3 ms	8276 KB	Output is correct
31	Incorrect	5 ms	8276 KB	Output isn't correct
32	Halted	0 ms	0 KB	-