提出 #6043946

---

ソースコード 拡げる

import numpy as np
import sys
input = sys.stdin.readline
R,C,K = map(int,input().split())

N = int(input())
XY = np.array([[int(x) for x in input().split()] for _ in range(N)], dtype=np.int32)
X = XY[:,0]
Y = XY[:,1]

row_candy = np.bincount(X, minlength = R+1)
col_candy = np.bincount(Y, minlength = C+1)

# x個ある行がy個ある
row_candy_hist = np.bincount(row_candy[1:], minlength = N+1)
col_candy_hist = np.bincount(col_candy[1:], minlength = N+1)

answer = (row_candy_hist[:K+1] * col_candy_hist[K::-1]).sum()

# ちょうどのところの補正
x = row_candy[X] + col_candy[Y]
answer -= (x == K).sum()
answer += (x == K+1).sum()

print(answer)

提出情報

ジャッジ結果