-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path11.cpp
88 lines (77 loc) · 2.37 KB
/
11.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include "utils.h"
using Grid = std::vector<std::vector<std::uint32_t>>;
std::vector<std::uint32_t> process_line(const std::string &s) {
std::vector<std::uint32_t> row;
int i = 0;
while (i < s.size()) {
row.push_back(std::stoi(s.substr(i, 2)));
i += 3;
}
return row;
}
std::uint32_t check_row(const Grid &grid) {
std::uint32_t best = 0;
size_t size = grid.size();
for (size_t i = 0; i < size; ++i) {
for (size_t j = 0; j < size - 3; ++j) {
best = std::max(best, grid[i][j]
* grid[i][j + 1]
* grid[i][j + 2]
* grid[i][j + 3]);
}
}
return best;
}
std::uint32_t check_col(const Grid &grid) {
std::uint32_t best = 0;
size_t size = grid.size();
for (size_t j = 0; j < size; ++j) {
for (size_t i = 0; i < size - 3; ++i) {
best = std::max(best, grid[i][j]
* grid[i + 1][j]
* grid[i + 2][j]
* grid[i + 3][j]);
}
}
return best;
}
std::uint32_t check_dia(const Grid &grid) {
std::uint32_t best = 0;
size_t size = grid.size();
// tl -> br
for (size_t j = 0; j < size - 3; ++j) {
for (size_t i = 0; i < size - 3; ++i) {
best = std::max(best, grid[i][j]
* grid[i + 1][j + 1]
* grid[i + 2][j + 2]
* grid[i + 3][j + 3]);
}
}
// tr -> bl
for (size_t j = 3; j < size; ++j) {
for (size_t i = 0; i < size - 3; ++i) {
best = std::max(best, grid[i][j]
* grid[i + 1][j - 1]
* grid[i + 2][j - 2]
* grid[i + 3][j - 3]);
}
}
return best;
}
int main(int argc, char const *argv[]) {
std::ifstream f("11.txt");
std::string line;
Grid grid;
while (std::getline(f, line)) grid.push_back(process_line(line));
f.close();
std::uint32_t best = 0;
best = std::max(best, check_row(grid));
best = std::max(best, check_col(grid));
best = std::max(best, check_dia(grid));
std::cout << best << std::endl;
return 0;
}