結果

問題 No.2641 draw X
ユーザー LyricalMaestro
提出日時 2025-06-29 03:27:49
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,696 ms / 2,000 ms
コード長 5,581 bytes
コンパイル時間 377 ms
コンパイル使用メモリ 82,428 KB
実行使用メモリ 243,164 KB
最終ジャッジ日時 2025-06-29 03:28:10
合計ジャッジ時間 17,936 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff # 

DIR = ((1, 1), (1, -1), (-1, 1), (- 1, -1))

MAX_INT = 10 ** 18

def solve(ar, ar_range, i, mid):
    high_i = i + mid
    low_i = i - mid

    if not (ar_range[0] <= low_i and ar_range[1] >= high_i):
        return False

    high_i -= ar_range[0]
    low_i -= ar_range[0]

    if low_i == 0:    
        x = ar[high_i]
        return x == 1 + 2 * mid
    else:
        x = ar[high_i]
        x1 = ar[low_i - 1]
        return (x - x1) == 1 + 2 * mid
                    
def main():
    H, W = map(int, input().split())
    S = []
    for _ in range(H):
        S.append(input())

    # #の累積を取る
    i_j1 = {}
    i_j2 = {}
    for i in range(H):
        for j in range(W):
            x = i + j
            y = i - j
            if x not in i_j1:
                i_j1[x] = [MAX_INT, - MAX_INT]
            i_j1[x][0] = min(i_j1[x][0], i)
            i_j1[x][1] = max(i_j1[x][1], i)
            if y not in i_j2:
                i_j2[y] = [MAX_INT, - MAX_INT]
            i_j2[y][0] = min(i_j2[y][0], i)
            i_j2[y][1] = max(i_j2[y][1], i)
    
    # #の累積和を計算
    i_j1_cums = {}
    for key, ranges in i_j1.items():
        c = 0

        array = [0] * (ranges[1] - ranges[0] + 1)
        on = -1

        for i in range(ranges[0], ranges[1] + 1):
            j = key - i
            if S[i][j] == "#" and on == -1:
                on = i
            elif on >= 0 and S[i][j] == ".":
                for i0 in range(on, i):
                    len1 = i0 - on
                    len2 = i - 1 - i0
                    len0 = min(len1, len2)
                    if len0 > 0:
                        array[i0 - ranges[0]] = len0
                on = -1
        if on >= 0:
            for i0 in range(on, ranges[1] + 1):
                len1 = i0 - on
                len2 = ranges[1] - i0
                len0 = min(len1, len2)
                if len0 > 0:
                    array[i0 - ranges[0]] = len0
        
        i_j1_cums[key] = array
        
    i_j2_cums = {}
    for key, ranges in i_j2.items():
        c = 0

        array = [0] * (ranges[1] - ranges[0] + 1)
        on = -1

        for i in range(ranges[0], ranges[1] + 1):
            j = i - key
            if S[i][j] == "#" and on == -1:
                on = i
            elif on >= 0 and S[i][j] == ".":
                for i0 in range(on, i):
                    len1 = i0 - on
                    len2 = i - 1 - i0
                    len0 = min(len1, len2)
                    if len0 > 0:
                        array[i0 - ranges[0]] = len0
                on = -1
        if on >= 0:
            for i0 in range(on, ranges[1] + 1):
                len1 = i0 - on
                len2 = ranges[1] - i0
                len0 = min(len1, len2)
                if len0 > 0:
                    array[i0 - ranges[0]] = len0
        
        i_j2_cums[key] = array

    i_j1_imos= {}
    i_j2_imos= {}    
    for i in range(H):
        for j in range(W):
            if S[i][j] == "#":
                key = i + j
                ar_range = i_j1[key]
                i0 = i - ar_range[0]
                a1 = i_j1_cums[key][i0]

                key = i - j
                ar_range = i_j2[key]
                i0 = i - ar_range[0]
                a2 = i_j2_cums[key][i0]

                ans = min(a1, a2)
                if ans < 1:
                    continue



                key = i + j
                if key not in i_j1_imos:
                    i_j1_imos[key] = {}
                imos_array1 = i_j1_imos[key]
                min_i = i - ans
                max_i = i + ans + 1
                if min_i not in imos_array1:
                    imos_array1[min_i] = 0
                imos_array1[min_i] += 1
                if max_i not in imos_array1:
                    imos_array1[max_i] = 0
                imos_array1[max_i] -= 1

                key = i - j
                if key not in i_j2_imos:
                    i_j2_imos[key] = {}
                min_i = i - ans
                max_i = i + ans + 1
                imos_array2 = i_j2_imos[key]
                if min_i not in imos_array2:
                    imos_array2[min_i] = 0
                imos_array2[min_i] += 1
                if max_i not in imos_array2:
                    imos_array2[max_i] = 0
                imos_array2[max_i] -= 1
    
    passed = [[0] * W for _ in range(H)]
    for key, values_map in i_j1_imos.items():
        min_i = MAX_INT
        max_i = - MAX_INT
        for k in values_map.keys():
            min_i = min(k, min_i)
            max_i = max(k, max_i)

        c = 0
        for i in range(max_i - min_i):
            i0 = min_i + i
            if i0 in values_map:
                c += values_map[i0]
            
            j0 = key - i0
            passed[i0][j0] += c

    for key, values_map in i_j2_imos.items():
        min_i = MAX_INT
        max_i = - MAX_INT
        for k in values_map.keys():
            min_i = min(k, min_i)
            max_i = max(k, max_i)

        c = 0
        for i in range(max_i - min_i):
            i0 = min_i + i
            if i0 in values_map:
                c += values_map[i0]
            
            j0 = i0 - key
            passed[i0][j0] += c

    is_ok = True
    for i in range(H):
        for j in range(W):
            if passed[i][j] > 0 and S[i][j] == ".":
                is_ok = False
            elif passed[i][j] == 0 and S[i][j] == "#":
                is_ok = False
    if is_ok:
        print("Yes")
    else:
        print("No")
            











if __name__ == "__main__":
    main()
0