-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathaoc2208.cc
137 lines (125 loc) Β· 1.69 KB
/
aoc2208.cc
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
#include "iostream"
#include "vector"
#include "sstream"
using namespace std;
int main()
{
vector<vector<int>> a;
string s;
while (cin >> s)
{
stringstream ss(s);
vector<int> t;
char c;
while (ss >> c)
t.push_back(c - '0');
a.push_back(t);
}
int R = (int) a.size(), C = (int) a[0].size();
int i, j, r, c;
int peri = R * 2 + C * 2 - 4;
int res = peri;
// part 2
long long res2 = 0, scen;
int u, d, l, rr;
r = 0;
while (++r < R - 1)
{
c = 0;
while (++c < C - 1)
{
int n = a[r][c];
bool ok;
i = -1; // up
ok = true;
while (++i < r)
{
if (a[i][c] >= n)
ok = false;
}
if (ok)
{
res++;
continue ;
}
i = r; // down
ok = true;
while (++i < R)
{
if (a[i][c] >= n)
ok = false;
}
if (ok)
{
res++;
continue ;
}
ok = true;
i = -1; // left
while (++i < c)
{
if (a[r][i] >= n)
ok = false;
}
if (ok)
{
res++;
continue ;
}
ok = true;
i = c; // right
while (++i < C)
{
if (a[r][i] >= n)
ok = false;
}
if (ok)
{
res++;
continue ;
}
}
// part 2
c = 0;
while (++c < C - 1)
{
int n = a[r][c];
u = 0;
i = r;
while (--i > -1)
{
u++;
if (a[i][c]>=n)
break;
}
d = 0;
i = r;
while (++i < R)
{
d++;
if (a[i][c]>=n)
break;
}
l = 0;
i = c;
while (--i > -1)
{
l++;
if (a[r][i]>=n)
break;
}
rr = 0;
i = c;
while (++i < C)
{
rr++;
if (a[r][i]>=n)
break ;
}
scen = u * d * l * rr;
res2 = res2 > scen ? res2 : scen;
}
}
cout << "Star 1: " << res << endl;
cout << "Star 2: " << res2 << endl;
}