Submission #3815655


Source Code Expand

(r, c, K) = map(int, input().split())
n = int(input())
rs = {}
rc = {}
cs = {}
cc = {}
for i in range(n):
    (tr, tc) = map(int, input().split())
    if tr in rs:
        rc[tr] += 1
        rs[tr] += [tc]
    else:
        rc[tr] = 1
        rs[tr] = [tc]
    if tc in cs:
        cc[tc] += 1
        cs[tc] += [tr]
    else:
        cc[tc] = 1
        cs[tc] = [tr]
rclist = {}
cclist = {}
for i in rc:
    if rc[i] in rclist:
        rclist[rc[i]] += [i]
    else:
        rclist[rc[i]] = [i]
for i in cc:
    if cc[i] in cclist:
        cclist[cc[i]] += [i]
    else:
        cclist[cc[i]] = [i]
count = 0
for i in rclist:
    parts = K - i
    if parts in cclist:
        for j in rclist[i]:
            for k in cclist[parts]:
                if k not in rs[j]:
                    count += 1
    if parts + 1 in cclist:
        for j in rclist[i]:
            for k in cclist[parts + 1]:
                if k in rs[j]:
                    count += 1
print(count)

Submission Info

Submission Time
Task C - 収集王
User mashinosatoshi
Language Python (3.4.3)
Score 0
Code Size 1015 Byte
Status WA
Exec Time 2106 ms
Memory 37696 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 3
AC × 6
WA × 12
AC × 11
WA × 13
TLE × 9
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 17 ms 3064 KB
subtask0-sample02.txt AC 17 ms 3064 KB
subtask0-sample03.txt AC 17 ms 3064 KB
subtask1-01.txt WA 17 ms 3064 KB
subtask1-02.txt WA 17 ms 3064 KB
subtask1-03.txt WA 18 ms 3064 KB
subtask1-04.txt WA 17 ms 3064 KB
subtask1-05.txt WA 17 ms 3064 KB
subtask1-06.txt AC 17 ms 3064 KB
subtask1-07.txt AC 17 ms 3064 KB
subtask1-08.txt WA 17 ms 3064 KB
subtask1-09.txt WA 17 ms 3064 KB
subtask1-10.txt WA 17 ms 3064 KB
subtask1-11.txt WA 17 ms 3064 KB
subtask1-12.txt AC 17 ms 3064 KB
subtask1-13.txt WA 17 ms 3064 KB
subtask1-14.txt WA 17 ms 3064 KB
subtask1-15.txt WA 17 ms 3064 KB
subtask2-01.txt AC 22 ms 3188 KB
subtask2-02.txt WA 30 ms 3316 KB
subtask2-03.txt AC 147 ms 6236 KB
subtask2-04.txt TLE 2105 ms 30176 KB
subtask2-05.txt AC 491 ms 21744 KB
subtask2-06.txt TLE 2106 ms 35752 KB
subtask2-07.txt AC 397 ms 7012 KB
subtask2-08.txt TLE 2105 ms 35744 KB
subtask2-09.txt TLE 2105 ms 35928 KB
subtask2-10.txt TLE 2105 ms 35816 KB
subtask2-11.txt TLE 2105 ms 37696 KB
subtask2-12.txt TLE 2105 ms 35832 KB
subtask2-13.txt AC 568 ms 35908 KB
subtask2-14.txt TLE 2105 ms 36036 KB
subtask2-15.txt TLE 2105 ms 35800 KB