Submission #31180475

Source Code Expand

n,k=map(int,input().split())
s=[input() for i in range(n)]
ans=0

for i in range(1,2**n):
	cnt=[0]*26
	for j in range(n):
		if (i>>j)&1:
			for x in s[j]:
				cnt[ord(x)-ord("a")]+=1
	ans=max(ans,cnt.count(k))

print(ans)

Submission Info

Submission Time
Task C - Just K
User sangonana
Language PyPy3 (7.3.0)
Score 300
Code Size 233 Byte
Status AC
Exec Time 161 ms
Memory 73780 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 19
Set Name Test Cases
Sample example_00.txt, example_01.txt, example_02.txt
All example_00.txt, example_01.txt, example_02.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt
Case Name Status Exec Time Memory
example_00.txt AC 101 ms 61644 KiB
example_01.txt AC 52 ms 61436 KiB
example_02.txt AC 52 ms 61756 KiB
test_00.txt AC 54 ms 61744 KiB
test_01.txt AC 53 ms 61600 KiB
test_02.txt AC 53 ms 61652 KiB
test_03.txt AC 71 ms 73780 KiB
test_04.txt AC 122 ms 73720 KiB
test_05.txt AC 53 ms 61928 KiB
test_06.txt AC 50 ms 61720 KiB
test_07.txt AC 72 ms 73508 KiB
test_08.txt AC 62 ms 67780 KiB
test_09.txt AC 69 ms 73520 KiB
test_10.txt AC 146 ms 73732 KiB
test_11.txt AC 149 ms 73632 KiB
test_12.txt AC 161 ms 73732 KiB
test_13.txt AC 147 ms 73748 KiB
test_14.txt AC 150 ms 73764 KiB
test_15.txt AC 155 ms 73456 KiB