結果
問題 | No.755 Zero-Sum Rectangle |
ユーザー | AEn |
提出日時 | 2022-08-30 17:01:45 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,839 ms / 2,000 ms |
コード長 | 2,215 bytes |
コンパイル時間 | 151 ms |
コンパイル使用メモリ | 82,368 KB |
実行使用メモリ | 77,288 KB |
最終ジャッジ日時 | 2024-11-07 11:15:38 |
合計ジャッジ時間 | 18,801 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
52,608 KB |
testcase_01 | AC | 51 ms
64,896 KB |
testcase_02 | AC | 1,839 ms
76,932 KB |
testcase_03 | AC | 1,802 ms
77,032 KB |
testcase_04 | AC | 1,791 ms
77,288 KB |
testcase_05 | AC | 1,778 ms
77,036 KB |
testcase_06 | AC | 1,777 ms
76,960 KB |
testcase_07 | AC | 1,753 ms
76,628 KB |
testcase_08 | AC | 1,783 ms
76,724 KB |
testcase_09 | AC | 1,757 ms
76,936 KB |
testcase_10 | AC | 1,753 ms
76,712 KB |
testcase_11 | AC | 50 ms
62,080 KB |
evil_1 | AC | 1,847 ms
77,248 KB |
ソースコード
def main(): import sys input = sys.stdin.readline N, M = map(int, input().split()) A = [list(map(int, input().split())) for _ in range(M)] ac = [[0]*(M+1) for _ in range(M+1)] z = 0 for i in range(M): for j in range(M): ac[i][j] += A[i][j] ac[-1][-1] += A[i][j] ac[-1][j] -= A[i][j] ac[i][-1] -= A[i][j] if A[i][j] == 0: z += 1 if z==M*M: for i in range(N): x, y = map(int, input().split()) print(x*y*(M-x+1)*(M-y+1)) exit() for i in range(M+1): for j in range(1, M+1): ac[i][j] += ac[i][j-1] for i in range(1, M+1): for j in range(M+1): ac[i][j] += ac[i-1][j] res = [[0]*(M+1) for _ in range(M+1)] for i in range(M): for j in range(M): num = A[i][j] for x in range(i, M): for y in range(j, M): if i==0 and j==0 and ac[x][y]==0: res[i][j] += 1 res[x+1][y+1] += 1 res[i][y+1] -= 1 res[x+1][j] -= 1 elif i==0 and ac[x][y]-ac[x][j-1]==0: res[i][j] += 1 res[x+1][y+1] += 1 res[i][y+1] -= 1 res[x+1][j] -= 1 elif j==0 and ac[x][y]-ac[i-1][y]==0: res[i][j] += 1 res[x+1][y+1] += 1 res[i][y+1] -= 1 res[x+1][j] -= 1 else: if ac[x][y]-ac[i-1][y]-ac[x][j-1]+ac[i-1][j-1]==0: res[i][j] += 1 res[x+1][y+1] += 1 res[i][y+1] -= 1 res[x+1][j] -= 1 for i in range(M+1): for j in range(1, M+1): res[i][j] += res[i][j-1] for i in range(1, M+1): for j in range(M+1): res[i][j] += res[i-1][j] for i in range(N): x, y = map(int,input().split()) print(res[x-1][y-1]) if __name__=='__main__': main()