Submission #2668544


Source Code Expand

R, C, K = map(int, input().split())
N = int(input())

row_to_candy = [0] * (10**5+1)
col_to_candy = [0] * (10**5+1)
candy = []
for i in range(N):
    r, c = map(int, input().split())
    row_to_candy[r] += 1
    col_to_candy[c] += 1
    candy.append([r, c])

candy_to_row = [0] * (10**5+1)
candy_to_col = [0] * (10**5+1)

for i in range(1, R+1):
    candy_to_row[row_to_candy[i]] += 1
for i in range(1, C+1):
    candy_to_col[col_to_candy[i]] += 1

ans = 0
for k in range(N+1):
    ans += candy_to_row[k] * candy_to_col[K-k]

for r, c in candy:
    if row_to_candy[r] + col_to_candy[c] == K:
        ans -= 1
    if row_to_candy[r] + col_to_candy[c] == K+1:
        ans += 1

print(ans)

Submission Info

Submission Time
Task C - 収集王
User AT274
Language Python (3.4.3)
Score 100
Code Size 718 Byte
Status AC
Exec Time 489 ms
Memory 22700 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 18
AC × 33
Set Name Test Cases
Sample subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt
Subtask1 subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt
Subtask2 subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt
Case Name Status Exec Time Memory
subtask0-sample01.txt AC 21 ms 6132 KB
subtask0-sample02.txt AC 22 ms 6132 KB
subtask0-sample03.txt AC 22 ms 6132 KB
subtask1-01.txt AC 22 ms 6132 KB
subtask1-02.txt AC 22 ms 6132 KB
subtask1-03.txt AC 22 ms 6132 KB
subtask1-04.txt AC 22 ms 6132 KB
subtask1-05.txt AC 21 ms 6132 KB
subtask1-06.txt AC 21 ms 6132 KB
subtask1-07.txt AC 21 ms 6132 KB
subtask1-08.txt AC 21 ms 6132 KB
subtask1-09.txt AC 21 ms 6132 KB
subtask1-10.txt AC 21 ms 6132 KB
subtask1-11.txt AC 21 ms 6132 KB
subtask1-12.txt AC 21 ms 6132 KB
subtask1-13.txt AC 22 ms 6132 KB
subtask1-14.txt AC 22 ms 6132 KB
subtask1-15.txt AC 22 ms 6132 KB
subtask2-01.txt AC 26 ms 6260 KB
subtask2-02.txt AC 36 ms 6512 KB
subtask2-03.txt AC 142 ms 10200 KB
subtask2-04.txt AC 436 ms 19484 KB
subtask2-05.txt AC 428 ms 20628 KB
subtask2-06.txt AC 468 ms 22684 KB
subtask2-07.txt AC 445 ms 18028 KB
subtask2-08.txt AC 489 ms 22688 KB
subtask2-09.txt AC 453 ms 22700 KB
subtask2-10.txt AC 460 ms 22692 KB
subtask2-11.txt AC 467 ms 22692 KB
subtask2-12.txt AC 468 ms 22696 KB
subtask2-13.txt AC 472 ms 22696 KB
subtask2-14.txt AC 460 ms 22680 KB
subtask2-15.txt AC 455 ms 22696 KB