提出詳細
ソースコード
for t in range(int(input())):
W, H = map(int, input().split())
P = [input() for i in range(H)]
b_max = 0
w_max = 0
for h in range(H):
for w in range(W):
if P[h][w] == "B":
for i in range(h + 1, H):
if P[i][w] == "B":
for j in range(w + 1, W):
if P[h][j] == "B" and P[i][j] == "B":
count = 0
for k in range(h + 1, i):
for l in range(w + 1, j):
if P[k][l] == "W":
count += 1
if b_max < count:
b_max = count
for h in range(H):
for w in range(W):
if P[h][w] == "W":
for i in range(h + 1, H):
if P[i][w] == "W":
for j in range(w + 1, W):
if P[h][j] == "W" and P[i][j] == "W":
count = 0
for k in range(h + 1, i):
for l in range(w + 1, j):
if P[k][l] == "B":
count += 1
if w_max < count:
w_max = count
print("Case #" + str(t + 1) + ":")
if w_max == b_max:
print("DRAW")
elif w_max < b_max:
print("B", b_max)
else:
print("W", w_max)
提出情報
提出出力結果
テストケース情報