-
Notifications
You must be signed in to change notification settings - Fork 0
/
C. Seat Arrangements.cpp
79 lines (58 loc) · 1.55 KB
/
C. Seat Arrangements.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
#include <bits/stdc++.h>
using namespace std;
#define _ ios_base::sync_with_stdio(0); cin.tie(0);
int main() { _
int n, m, k;
cin >> n >> m >> k;
vector<vector<char>> classroom(n, vector<char>(m));
int occupied = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
{
cin >> classroom[i][j];
if (classroom[i][j] == '*') occupied++;
}
int sum = 0, left, right;
if (k == 1)
sum += (n * m) - occupied;
else
{
for (int i = 0; i < n; i++)
{
left = 0; right = 0;
while (true)
{
if (right >= m)
{
sum += max(right - left - k + 1, 0);
break;
}
else if (classroom[i][right] == '*')
{
sum += max(right - left - k + 1, 0);
left = ++right;
}
else right++;
}
}
for (int i = 0; i < m; i++)
{
left = 0; right = 0;
while (true)
{
if (right >= n)
{
sum += max(right - left - k + 1, 0);
break;
}
else if (classroom[right][i] == '*')
{
sum += max(right - left - k + 1, 0);
left = ++right;
}
else right++;
}
}
}
cout << sum << '\n';
}