Submission #1017771

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1017771	2024-07-09T10:05:51 Z	Unforgettablepl	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	454 ms	1048576 KB

kyoto

#include <bits/stdc++.h>
using namespace std;
 
#define int long long

const int INF = 1e15;

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int h,w;
	cin >> h >> w;
	vector<int> a(h+1);
	vector<int> b(w+1);
	for(int i=1;i<=h;i++)cin>>a[i];
	for(int i=1;i<=w;i++)cin>>b[i];
	vector<vector<int>> DP(h+1,vector<int>(w+1,INF));
	DP[1][1]=0;
	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			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] << '\n';
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	860 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	5 ms	8168 KB	Output is correct
10	Correct	5 ms	8376 KB	Output is correct
11	Correct	5 ms	8284 KB	Output is correct
12	Correct	5 ms	8284 KB	Output is correct
13	Correct	6 ms	8284 KB	Output is correct
14	Correct	5 ms	8284 KB	Output is correct
15	Correct	6 ms	8284 KB	Output is correct
16	Correct	8 ms	8308 KB	Output is correct
17	Correct	5 ms	8284 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 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	460 KB	Output is correct
23	Correct	1 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	2 ms	3576 KB	Output is correct
4	Runtime error	454 ms	1048576 KB	Execution killed with signal 9
5	Halted	0 ms	0 KB	-

Subtask #3

0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	860 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	5 ms	8168 KB	Output is correct
10	Correct	5 ms	8376 KB	Output is correct
11	Correct	5 ms	8284 KB	Output is correct
12	Correct	5 ms	8284 KB	Output is correct
13	Correct	6 ms	8284 KB	Output is correct
14	Correct	5 ms	8284 KB	Output is correct
15	Correct	6 ms	8284 KB	Output is correct
16	Correct	8 ms	8308 KB	Output is correct
17	Correct	5 ms	8284 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 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	460 KB	Output is correct
23	Correct	1 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	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	2 ms	3576 KB	Output is correct
32	Runtime error	454 ms	1048576 KB	Execution killed with signal 9
33	Halted	0 ms	0 KB	-