Last active
July 28, 2019 13:31
-
-
Save Elnee/800b4c5027a69c8909b9bdf5297dce40 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // LINK TO EXERCISE: https://www.hackerrank.com/challenges/2d-array/problem | |
| #include <bits/stdc++.h> | |
| using namespace std; | |
| // Complete the hourglassSum function below. | |
| int hourglassSum(vector<vector<int>> arr) { | |
| if (arr.size() < 3 || arr[0].size() < 3) return 0; | |
| int maxHourglassSum = numeric_limits<int>::min(); | |
| int iterationsRight = arr[0].size() - 2; | |
| int iterationsDown = arr.size() - 2; | |
| vector<pair<int, int>> indexes {{0, 0}, {0, 1}, {0, 2}, | |
| {1, 1}, | |
| {2, 0}, {2, 1}, {2, 2}}; | |
| auto movePatternRight = [](pair<int, int>& p) { | |
| get<1>(p) += 1; | |
| }; | |
| auto movePatternDownAndLeft = [](pair<int, int>& p) { | |
| get<1>(p) -= 3; | |
| get<0>(p) += 1; | |
| }; | |
| for (int i = 0; i < iterationsDown; ++i) { | |
| for (int j = 0; j < iterationsRight; ++j) { | |
| // Calculating sum of hourglasses | |
| int sum = accumulate(indexes.cbegin(), indexes.cend(), 0, | |
| [&arr](int res, pair<int, int> p){ | |
| return move(res) + arr[get<0>(p)][get<1>(p)]; | |
| }); | |
| if (maxHourglassSum < sum) maxHourglassSum = sum; | |
| if (j == iterationsRight - 1) break; // Don't move last time | |
| for_each(indexes.begin(), indexes.end(), movePatternRight); | |
| } | |
| for_each(indexes.begin(), indexes.end(), movePatternDownAndLeft); | |
| } | |
| return maxHourglassSum; | |
| } | |
| int main() | |
| { | |
| ofstream fout(getenv("OUTPUT_PATH")); | |
| vector<vector<int>> arr(6); | |
| for (int i = 0; i < 6; i++) { | |
| arr[i].resize(6); | |
| for (int j = 0; j < 6; j++) { | |
| cin >> arr[i][j]; | |
| } | |
| cin.ignore(numeric_limits<streamsize>::max(), '\n'); | |
| } | |
| int result = hourglassSum(arr); | |
| fout << result << "\n"; | |
| fout.close(); | |
| return 0; | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment