Submission #401367
Source Code Expand
h,w,k=map(int,input().split()) n=int(input()) rs = [0]*h cs = [0]*w co = [] for i in range(n): r,c=map(int,input().split()) co.append((r-1,c-1)) rs[r-1] += 1 cs[c-1] += 1 fc = [0]*(n+1) for c in cs: fc[c] += 1 ret = 0 for r in rs: if r <= k: ret += fc[k-r] for z in co: if rs[z[0]] + cs[z[1]] - 1 == k: ret += 1 if rs[z[0]] + cs[z[1]] == k: ret -= 1 print(ret)
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | uwi |
Language | Python (3.4.2) |
Score | 100 |
Code Size | 398 Byte |
Status | AC |
Exec Time | 1190 ms |
Memory | 22760 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 | 108 ms | 6760 KB |
subtask0-sample02.txt | AC | 106 ms | 6756 KB |
subtask0-sample03.txt | AC | 110 ms | 6888 KB |
subtask1-01.txt | AC | 120 ms | 6772 KB |
subtask1-02.txt | AC | 109 ms | 6764 KB |
subtask1-03.txt | AC | 106 ms | 6888 KB |
subtask1-04.txt | AC | 110 ms | 6760 KB |
subtask1-05.txt | AC | 110 ms | 6756 KB |
subtask1-06.txt | AC | 103 ms | 6760 KB |
subtask1-07.txt | AC | 104 ms | 6728 KB |
subtask1-08.txt | AC | 108 ms | 6888 KB |
subtask1-09.txt | AC | 108 ms | 6880 KB |
subtask1-10.txt | AC | 108 ms | 6872 KB |
subtask1-11.txt | AC | 110 ms | 6756 KB |
subtask1-12.txt | AC | 106 ms | 6760 KB |
subtask1-13.txt | AC | 102 ms | 6888 KB |
subtask1-14.txt | AC | 111 ms | 6744 KB |
subtask1-15.txt | AC | 103 ms | 6760 KB |
subtask2-01.txt | AC | 118 ms | 6760 KB |
subtask2-02.txt | AC | 133 ms | 7008 KB |
subtask2-03.txt | AC | 393 ms | 10232 KB |
subtask2-04.txt | AC | 1103 ms | 18616 KB |
subtask2-05.txt | AC | 1076 ms | 19884 KB |
subtask2-06.txt | AC | 1179 ms | 22684 KB |
subtask2-07.txt | AC | 1018 ms | 16456 KB |
subtask2-08.txt | AC | 1173 ms | 22740 KB |
subtask2-09.txt | AC | 1149 ms | 22692 KB |
subtask2-10.txt | AC | 1167 ms | 22760 KB |
subtask2-11.txt | AC | 1151 ms | 22628 KB |
subtask2-12.txt | AC | 1154 ms | 22604 KB |
subtask2-13.txt | AC | 1144 ms | 22628 KB |
subtask2-14.txt | AC | 1118 ms | 22652 KB |
subtask2-15.txt | AC | 1190 ms | 22716 KB |