advent-of-code/2023/11/main-2.cpp
2023-12-10 21:33:30 -08:00

66 lines
1.3 KiB
C++

#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
vector<string> lines;
string line;
while (getline(cin, line) && !line.empty()) {
lines.push_back(line);
}
vector<int> erows, ecols;
for (unsigned int row = 0; row < lines.size(); row++) {
for (char c : lines[row]) {
if (c != '.') {
goto next1;
}
}
erows.push_back(row);
next1:;
}
for (unsigned int col = 0; col < lines[0].size(); col++) {
for (unsigned int row = 0; row < lines.size(); row++) {
if (lines[row][col] != '.') {
goto next2;
}
}
ecols.push_back(col);
next2:;
}
vector<pair<int, int>> gs;
for (unsigned int row = 0; row < lines.size(); row++) {
for (unsigned int col = 0; col < lines[row].size(); col++) {
if (lines[row][col] == '#') {
gs.push_back(make_pair(row, col));
}
}
}
long ret = 0;
for (unsigned int i = 0; i < gs.size() - 1; i++) {
auto& gi = gs[i];
for (unsigned int j = i + 1; j < gs.size(); j++) {
auto& gj = gs[j];
ret += abs(gi.first - gj.first) + abs(gi.second - gj.second);
for (int erow : erows) {
if ((erow - gi.first) * (erow - gj.first) < 0) {
ret += 999'999;
}
}
for (int ecol : ecols) {
if ((ecol - gi.second) * (ecol - gj.second) < 0) {
ret += 999'999;
}
}
}
}
cout << ret << '\n';
}