Submission #2660069
Source Code Expand
from collections import Counter, defaultdict r, c, k = map(int, input().split()) n = int(input()) rcs = [tuple(int(x) for x in input().split()) for _ in range(n)] rows = {i+1:set() for i in range(r)} for r,c in rcs: rows[r].add(c) colcounts = Counter(c for r,c in rcs) countcols = defaultdict(set) for i in range(c): countcols[colcounts[i+1]].add(i+1) total = 0 for v in rows.values(): total += len(countcols[k-len(v)].difference(v)) total += len(countcols[k-len(v)+1].intersection(v)) print(total)
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | zehnpaard |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 536 Byte |
Status | WA |
Exec Time | 2107 ms |
Memory | 62676 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | 24 ms | 3444 KB |
subtask0-sample02.txt | AC | 20 ms | 3316 KB |
subtask0-sample03.txt | AC | 21 ms | 3316 KB |
subtask1-01.txt | AC | 20 ms | 3316 KB |
subtask1-02.txt | WA | 21 ms | 3316 KB |
subtask1-03.txt | WA | 21 ms | 3316 KB |
subtask1-04.txt | WA | 20 ms | 3316 KB |
subtask1-05.txt | WA | 20 ms | 3316 KB |
subtask1-06.txt | AC | 20 ms | 3316 KB |
subtask1-07.txt | WA | 21 ms | 3316 KB |
subtask1-08.txt | WA | 21 ms | 3316 KB |
subtask1-09.txt | AC | 20 ms | 3316 KB |
subtask1-10.txt | WA | 21 ms | 3316 KB |
subtask1-11.txt | WA | 21 ms | 3316 KB |
subtask1-12.txt | WA | 21 ms | 3316 KB |
subtask1-13.txt | WA | 21 ms | 3316 KB |
subtask1-14.txt | WA | 21 ms | 3316 KB |
subtask1-15.txt | WA | 21 ms | 3316 KB |
subtask2-01.txt | WA | 25 ms | 3572 KB |
subtask2-02.txt | WA | 32 ms | 3952 KB |
subtask2-03.txt | AC | 134 ms | 9840 KB |
subtask2-04.txt | AC | 422 ms | 38288 KB |
subtask2-05.txt | AC | 434 ms | 30400 KB |
subtask2-06.txt | TLE | 2107 ms | 55324 KB |
subtask2-07.txt | AC | 384 ms | 15220 KB |
subtask2-08.txt | TLE | 2106 ms | 55496 KB |
subtask2-09.txt | WA | 1547 ms | 54844 KB |
subtask2-10.txt | TLE | 2107 ms | 60996 KB |
subtask2-11.txt | TLE | 2106 ms | 57760 KB |
subtask2-12.txt | WA | 615 ms | 54860 KB |
subtask2-13.txt | AC | 582 ms | 55196 KB |
subtask2-14.txt | TLE | 2106 ms | 62676 KB |
subtask2-15.txt | WA | 675 ms | 54828 KB |