Submission #43841361

---

Source Code Expand

#!/usr/bin/env python3
from typing import *


def solve(N: int, D: int, S: List[str]) -> int:
    free_days = [True for x in range(D)]
    for n_index in range(N):
        not_free_days = [index for index, value in enumerate(S[n_index]) if value == 'x']
        for not_free in not_free_days:
            free_days[not_free] = False

    results = [0]
    counting_num = 0
    is_counting = False
    for free in free_days:
        if is_counting:
            if free:
                counting_num += 1
            else:
                is_counting = False
                results.append(counting_num)
                counting_num = 0
        else:
            if free:
                is_counting = True
                counting_num = 1
            else:
                continue
    results.append(counting_num)
    return max(results)


# generated by oj-template v4.8.1 (https://github.com/online-judge-tools/template-generator)
def main():
    N, D = map(int, input().split())
    S = [None for _ in range(N)]
    for i in range(N):
        S[i] = input()
    a = solve(N, D, S)
    print(a)


if __name__ == '__main__':
    main()

Submission Info

Judge Result