#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int R, C;
cin >> R >> C;
int D = R + C - 1;
vector<int> main_diag(D); // ↘ (за d = r - c), індексуємо як r - c + (C - 1)
vector<int> anti_diag(D); // ↙ (за d = r + c)
for (int i = 0; i < D; ++i)
cin >> main_diag[i];
for (int i = 0; i < D; ++i)
cin >> anti_diag[i];
long long total_cost = 0;
for (int r = 0; r < R; ++r) {
for (int c = 0; c < C; ++c) {
int main_index = r - c + (C - 1); // ↘
int anti_index = r + c; // ↙
total_cost += min(main_diag[main_index], anti_diag[anti_index]);
}
}
cout << total_cost << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |