Submission #401126
Source Code Expand
R, C, K = map(int, input().split()) N = int(input()) candies = [list(map(lambda x: int(x) - 1, input().split())) for _ in range(N)] rows = dict(zip(range(0, R), [0 for _ in range(R)])) cols = dict(zip(range(0, C), [0 for _ in range(C)])) for i in range(N): rows[candies[i][0]] += 1 cols[candies[i][1]] += 1 res = 0 for i in range(R): if rows[i] > K: continue for j in range(C): t = rows[i] + cols[j] t -= 1 if [i, j] in candies else 0 if t == K: res += 1 print(res)
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | yumechi |
Language | Python (3.4.2) |
Score | 30 |
Code Size | 548 Byte |
Status | TLE |
Exec Time | 2041 ms |
Memory | 56240 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 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 | 179 ms | 6728 KB |
subtask0-sample02.txt | AC | 91 ms | 6884 KB |
subtask0-sample03.txt | AC | 91 ms | 6888 KB |
subtask1-01.txt | AC | 90 ms | 6888 KB |
subtask1-02.txt | AC | 94 ms | 6756 KB |
subtask1-03.txt | AC | 89 ms | 6760 KB |
subtask1-04.txt | AC | 90 ms | 6760 KB |
subtask1-05.txt | AC | 89 ms | 6764 KB |
subtask1-06.txt | AC | 89 ms | 6760 KB |
subtask1-07.txt | AC | 94 ms | 6752 KB |
subtask1-08.txt | AC | 97 ms | 6752 KB |
subtask1-09.txt | AC | 91 ms | 6744 KB |
subtask1-10.txt | AC | 93 ms | 6756 KB |
subtask1-11.txt | AC | 94 ms | 6756 KB |
subtask1-12.txt | AC | 94 ms | 6756 KB |
subtask1-13.txt | AC | 97 ms | 6756 KB |
subtask1-14.txt | AC | 100 ms | 6756 KB |
subtask1-15.txt | AC | 102 ms | 6752 KB |
subtask2-01.txt | TLE | 2035 ms | 7120 KB |
subtask2-02.txt | TLE | 2033 ms | 7524 KB |
subtask2-03.txt | AC | 404 ms | 14088 KB |
subtask2-04.txt | TLE | 2038 ms | 40756 KB |
subtask2-05.txt | AC | 1204 ms | 41884 KB |
subtask2-06.txt | TLE | 2040 ms | 56160 KB |
subtask2-07.txt | TLE | 2037 ms | 26540 KB |
subtask2-08.txt | TLE | 2040 ms | 56240 KB |
subtask2-09.txt | TLE | 2039 ms | 56168 KB |
subtask2-10.txt | TLE | 2039 ms | 56168 KB |
subtask2-11.txt | TLE | 2041 ms | 56188 KB |
subtask2-12.txt | TLE | 2041 ms | 56188 KB |
subtask2-13.txt | TLE | 2038 ms | 56204 KB |
subtask2-14.txt | TLE | 2039 ms | 56228 KB |
subtask2-15.txt | TLE | 2041 ms | 56140 KB |