提出 13996be0-1e01-40cf-9179-546176cfa798

コード

import math
import bisect
import collections
def main():
    n,t = map(int,input().split())
    A = [list(map(int,input().split())) for _ in range(n)]
    B = [list(map(int,input().split())) for _ in range(n)]
    O = [list(map(int,input().split())) for _ in range(t)]
    ans = []
    time = [0]*t
    for _ in range(3):
        for m,o in enumerate(O):
            if time[m] >= 3:
                continue
            H,W,a,b = o
            score = 0
            for i in range(H):
                for j in range(W):
                    if A[i][j] == a:
                        score += abs(a-B[i][j]) - abs(b-B[i][j])
            if score > 0:
                ans.append([m,0,0])
                for i in range(H):
                    for j in range(W):
                        if A[i][j] == a:
                            A[i][j] = b
                time[m] += 1
        for m,o in enumerate(O):
            if time[m] >= 3:
                continue
            H,W,a,b = o
            score = 0
            for i in range(n-1,n-H-1,-1):
                for j in range(n-1,n-W-1,-1):
                    if A[i][j] == a:
                        score += abs(a-B[i][j]) - abs(b-B[i][j])
            if score > 0:
                ans.append([m,n-H,n-W])
                for i in range(n-1,n-H-1,-1):
                    for j in range(n-1,n-W-1,-1):
                        if A[i][j] == a:
                            A[i][j] = b
                time[m] += 1
    print(len(ans))
    for vec in ans:
        print(*vec)
    return
main()

結果

問題	点数	言語	結果	実行時間	メモリ
A - Replace() は Replace() されました	7658863	Python3	AC	411 ms	10996 KiB