Submission #631576

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
631576	2022-08-18T08:59:34 Z	alvingogo	Sightseeing in Kyoto (JOI22_kyoto)	C++14	10 / 100	400 ms	1048576 KB

kyoto

#include <bits/stdc++.h>
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define cd complex<double>
#define p_q priority_queue
#define int long long
using namespace std;

signed main(){
	AquA;
	int h,w;
	cin >> h >> w;
	vector<int> v(h),a(w);
	for(int i=0;i<h;i++){
		cin >> v[i];
	}
	for(int j=0;j<w;j++){
		cin >> a[j];
	}
	vector<vector<int> > dp(h,vector<int>(w,1e18));
	dp[0][0]=0;
	for(int i=0;i<h;i++){
		for(int j=0;j<w;j++){
			if(i){
				dp[i][j]=min(dp[i][j],dp[i-1][j]+a[j]);
			}
			if(j){
				dp[i][j]=min(dp[i][j],dp[i][j-1]+v[i]);
			}
		}
	}
	cout << dp[h-1][w-1] << "\n"; 
	return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	724 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	10 ms	8200 KB	Output is correct
10	Correct	10 ms	8148 KB	Output is correct
11	Correct	10 ms	8148 KB	Output is correct
12	Correct	10 ms	8208 KB	Output is correct
13	Correct	11 ms	8148 KB	Output is correct
14	Correct	10 ms	8148 KB	Output is correct
15	Correct	10 ms	8148 KB	Output is correct
16	Correct	10 ms	8148 KB	Output is correct
17	Correct	10 ms	8148 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 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	0 ms	212 KB	Output is correct
3	Correct	5 ms	3412 KB	Output is correct
4	Runtime error	400 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	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	724 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	10 ms	8200 KB	Output is correct
10	Correct	10 ms	8148 KB	Output is correct
11	Correct	10 ms	8148 KB	Output is correct
12	Correct	10 ms	8208 KB	Output is correct
13	Correct	11 ms	8148 KB	Output is correct
14	Correct	10 ms	8148 KB	Output is correct
15	Correct	10 ms	8148 KB	Output is correct
16	Correct	10 ms	8148 KB	Output is correct
17	Correct	10 ms	8148 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	5 ms	3412 KB	Output is correct
32	Runtime error	400 ms	1048576 KB	Execution killed with signal 9
33	Halted	0 ms	0 KB	-