Submission #409104
Source Code Expand
R, C, K = map(int, raw_input().split()) N = input() ci = [0]*R cj = [0]*C r = [0]*N c = [0]*N for i in xrange(N): r[i], c[i] = map(int, raw_input().split()) r[i] -= 1; c[i] -= 1 ci[r[i]] += 1 cj[c[i]] += 1 cai = [0]*(N+1) caj = [0]*(N+1) for i in xrange(R): cai[ci[i]] += 1 for i in xrange(C): caj[cj[i]] += 1 ans = 0 for i in xrange(K+1): ans += cai[i]*caj[K-i] for i in xrange(N): count = ci[r[i]]+cj[c[i]] if count==K: ans -= 1 elif count==K+1: ans += 1 print ans
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | yaketake08 |
Language | Python (2.7.3) |
Score | 100 |
Code Size | 548 Byte |
Status | AC |
Exec Time | 807 ms |
Memory | 13020 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
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 | 60 ms | 3484 KB |
subtask0-sample02.txt | AC | 60 ms | 3548 KB |
subtask0-sample03.txt | AC | 59 ms | 3548 KB |
subtask1-01.txt | AC | 59 ms | 3552 KB |
subtask1-02.txt | AC | 59 ms | 3544 KB |
subtask1-03.txt | AC | 59 ms | 3552 KB |
subtask1-04.txt | AC | 59 ms | 3548 KB |
subtask1-05.txt | AC | 61 ms | 3548 KB |
subtask1-06.txt | AC | 59 ms | 3548 KB |
subtask1-07.txt | AC | 60 ms | 3484 KB |
subtask1-08.txt | AC | 60 ms | 3544 KB |
subtask1-09.txt | AC | 60 ms | 3552 KB |
subtask1-10.txt | AC | 60 ms | 3544 KB |
subtask1-11.txt | AC | 61 ms | 3552 KB |
subtask1-12.txt | AC | 61 ms | 3540 KB |
subtask1-13.txt | AC | 59 ms | 3552 KB |
subtask1-14.txt | AC | 61 ms | 3544 KB |
subtask1-15.txt | AC | 60 ms | 3548 KB |
subtask2-01.txt | AC | 65 ms | 3540 KB |
subtask2-02.txt | AC | 79 ms | 3672 KB |
subtask2-03.txt | AC | 252 ms | 5332 KB |
subtask2-04.txt | AC | 745 ms | 9812 KB |
subtask2-05.txt | AC | 746 ms | 10708 KB |
subtask2-06.txt | AC | 807 ms | 13016 KB |
subtask2-07.txt | AC | 684 ms | 7888 KB |
subtask2-08.txt | AC | 763 ms | 13016 KB |
subtask2-09.txt | AC | 772 ms | 13016 KB |
subtask2-10.txt | AC | 770 ms | 13012 KB |
subtask2-11.txt | AC | 767 ms | 13008 KB |
subtask2-12.txt | AC | 757 ms | 13020 KB |
subtask2-13.txt | AC | 795 ms | 13016 KB |
subtask2-14.txt | AC | 776 ms | 13008 KB |
subtask2-15.txt | AC | 764 ms | 12952 KB |