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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
|
#include <iostream>
#include <cstdint>
#include <algorithm>
#include <string>
#include <string_view>
#include <vector>
#include <set>
using namespace std;
class Direction {
public:
const int U, R;
Direction(const int i, const int j) : U{ i }, R{ j } {}
Direction turnright() const {
return turn(-1, 0);
}
Direction turnleft() const {
return turn(1, 0);
}
bool operator<(const Direction& d) const { // For set<Direction>
return this->U < d.U || (this->U == d.U && this->R < d.R);
}
private:
Direction turn(int64_t sin, int64_t cos) const {
return Direction(cos * U - sin * R, sin * U + cos * R);
}
};
class Position {
public:
int64_t i, j;
Position(int64_t a, int64_t b) : i{a}, j{b} {}
Position step(const Direction d) const {
return Position(i+d.U, j+d.R);
}
};
const Direction all_directions[] = {
Direction(1, 0), Direction(-1, 0), Direction(0, 1), Direction(0, -1)
};
class Board {
public:
int64_t N, M;
vector<int64_t> region_area;
Board(const vector<string>& lines) :
N{static_cast<int64_t>(lines.size())},
M{static_cast<int64_t>(lines[0].size())},
region_area(M*N), cells(M*N), region(M*N), visited(M*N)
{
for (int64_t i = 0; i < N; i++) {
for (int64_t j = 0; j < M; j++) {
region[M*i+j] = -1;
cells[M*i+j] = lines[i][j];
}
}
}
char& operator[](const Position p) {
if (const auto c = coord(p); c == -1)
return out_of_bound;
else
return cells[c];
}
int64_t& reg(const Position p) {
if (const auto c = coord(p); c == -1)
return out_of_region;
else
return region[c];
}
void fill(const Position p, const int64_t r) {
reg(p) = r;
region_area[r]++;
for (const auto d : all_directions)
if (auto q = p.step(d);
(*this)[q] == (*this)[p] && reg(q) != r)
fill(q, r);
}
int64_t compute_perim(int64_t r) {
int count = 0;
for (Position p(0, 0); p.i < N; p.i++)
for (p.j = 0; p.j < M; p.j++)
for (Direction d : all_directions)
if (reg(p) == r && reg(p.step(d)) != r)
count += walk(p, d);
return count;
}
private:
char out_of_bound = '$';
int64_t out_of_region = -1;
vector<char> cells;
vector<int64_t> region;
vector<set<Direction>> visited;
int64_t coord(const Position p) const {
auto [i, j] = p;
return i >= N || i < 0 || j >= M || j < 0 ? -1 : M * i + j;
}
bool is_visited(const Position p, const Direction d) const {
if (auto c = coord(p); c == -1)
return false;
else
return visited[c].count(d) > 0;
}
void set_visited(const Position p, const Direction d) {
if (auto c = coord(p); c != -1)
visited[c].insert(d);
}
int64_t walk(const Position p, const Direction d) {
const auto r = reg(p);
for (auto q = p; reg(q) == r && reg(q.step(d)) != r;
q = q.step(d.turnleft())) {
if (is_visited(q, d))
return 0;
set_visited(q, d);
}
return 1;
}
};
int main() {
string line;
vector<string> lines;
while (getline(cin, line))
lines.push_back(line);
Board board(lines);
int64_t r = 0;
for (Position p(0, 0); p.i < board.N; p.i++)
for (p.j = 0; p.j < board.M; p.j++)
if (board.reg(p) == -1)
board.fill(p, r++);
int64_t tot = 0;
for (int64_t i = 0; i < r; i++)
tot += board.region_area[i] * board.compute_perim(i);
cout << tot << endl;
return 0;
}
|
