oj.uz

Submission #602556

# Submission time Handle Problem Language Result Execution time Memory
602556 2022-07-23T08:24:29 Z Tigryonochekk Sightseeing in Kyoto (JOI22_kyoto) C++17
0 / 100
 1 ms 212 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <string>
using namespace std;
#define ll long long
#define pii pair<int, int>
const int N = 1002;
const ll inf = 1e18 + 49;

int h, w;
int a[N], b[N];
ll dp[N][N];

int main() {
	cin >> h >> w;
	for (int i = 1; i <= h; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= w; i++) {
		cin >> b[i];
	}
	dp[1][1] = 0;
	for (int i = 1; i <= h; i++) {
		for (int j = 1; j <= w; j++) {
			dp[i][j] = inf;
			if (i > 1)
				dp[i][j] = min(dp[i][j], dp[i - 1][j] + b[j]);
			if (j > 1)
				dp[i][j] = min(dp[i][j], dp[i][j - 1] + a[i]);
		}
	}
	cout << dp[h][w] << endl;
	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -