-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAlphabetCake.py
62 lines (57 loc) · 1.79 KB
/
AlphabetCake.py
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
T = int(input())
for i in range(1, T + 1):
[R, C] = [int(i) for i in input().split()]
cake = []
for j in range(R):
cake.append(list(input()))
new_cake = []
for row in cake:
if row != "?" * C:
last_ch = None
new_row = ""
for k, ch in enumerate(row):
if ch == "?":
if last_ch is None:
new_row += "?"
else:
new_row += last_ch
else:
last_ch = ch
new_row += ch
new_cake.append(list(new_row))
cake = new_cake.copy()
new_cake = []
for row in list(reversed(cake)):
if row != "?" * C:
last_ch = None
new_row = ""
for ch in list(reversed(row)):
if ch == "?":
if last_ch is None:
new_row += "?"
else:
new_row += last_ch
else:
last_ch = ch
new_row += ch
new_cake.append(list(reversed(new_row)))
cake = list(reversed(new_cake))
first_normal_row = False
first_normal_row_idx = -1
new_cake = []
for j, row in enumerate(cake):
if row == list("?" * C):
if first_normal_row:
new_cake.append(new_cake[j - 1])
else:
new_cake.append(row)
else:
new_cake.append(row)
if not first_normal_row:
first_normal_row = True
first_normal_row_idx = j
cake = new_cake
cake[0:first_normal_row_idx] = [cake[first_normal_row_idx]]*first_normal_row_idx
print("Case #{}:".format(i))
for row in cake:
print(''.join(row))