Submission #401351


Source Code Expand

import sys

#sys.stdin = open('pro3_3.txt', 'r')
r, c, k = map(int, raw_input().split())
n = int(raw_input())
table = {}
xlist = {}
ylist = {}
count = 0

for _ in range(n):
	x, y = map(int, raw_input().split())
	if not (x in xlist):
		xlist[x] = 1
	else:
		xlist[x] += 1
	if not (y in ylist):
		ylist[y] = 1
	else:
		ylist[y] += 1
	table[(x, y)] = 1


for x in xlist.keys():
	xnum = xlist[x]
	for y in ylist.keys():
		ynum = ylist[y]
		if ((xnum+ynum) == k+1 and (x,y) in table): count += 1
		if ((xnum+ynum) == k and (not (x,y) in table)): count +=1

print str(count)


Submission Info

Submission Time
Task C - 収集王
User patariro1000
Language Python (2.7.3)
Score 0
Code Size 604 Byte
Status WA
Exec Time 2039 ms
Memory 32408 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 × 10
WA × 13
TLE × 10
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 59 ms 3384 KB
subtask0-sample02.txt AC 54 ms 3388 KB
subtask0-sample03.txt AC 56 ms 3388 KB
subtask1-01.txt WA 56 ms 3380 KB
subtask1-02.txt WA 56 ms 3380 KB
subtask1-03.txt WA 56 ms 3384 KB
subtask1-04.txt WA 56 ms 3380 KB
subtask1-05.txt WA 56 ms 3376 KB
subtask1-06.txt AC 55 ms 3376 KB
subtask1-07.txt AC 57 ms 3324 KB
subtask1-08.txt WA 57 ms 3376 KB
subtask1-09.txt WA 57 ms 3324 KB
subtask1-10.txt WA 57 ms 3380 KB
subtask1-11.txt WA 54 ms 3384 KB
subtask1-12.txt AC 57 ms 3384 KB
subtask1-13.txt WA 57 ms 3384 KB
subtask1-14.txt WA 57 ms 3384 KB
subtask1-15.txt WA 58 ms 3384 KB
subtask2-01.txt AC 169 ms 3612 KB
subtask2-02.txt WA 249 ms 3996 KB
subtask2-03.txt AC 1468 ms 11036 KB
subtask2-04.txt AC 813 ms 30348 KB
subtask2-05.txt TLE 2038 ms 28060 KB
subtask2-06.txt TLE 2038 ms 32396 KB
subtask2-07.txt AC 816 ms 23320 KB
subtask2-08.txt TLE 2037 ms 32400 KB
subtask2-09.txt TLE 2039 ms 32316 KB
subtask2-10.txt TLE 2038 ms 32388 KB
subtask2-11.txt TLE 2038 ms 32400 KB
subtask2-12.txt TLE 2038 ms 32396 KB
subtask2-13.txt TLE 2038 ms 32288 KB
subtask2-14.txt TLE 2038 ms 32408 KB
subtask2-15.txt TLE 2039 ms 32400 KB