1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T421,from collections import deque from functools import reduce """ antic (1 << ord("a") - ord("a")) | (1 << ord("n") - ord("a")) | (1 << ord("t") - ord("a")) | (1 << ord("i") - ord("a")) | (1 << ord("c") - ord("a")) = 532741 """ N, K = map(int, input().split()) words = [0 for i in range(N)] if K < 5: print(0) exit() for i in range(N): word = input() for char in word: words[i] |= (1 << (ord(char) - ord('a'))) available_alphabet = reduce(lambda acc, curr: acc | curr, words) stack = deque([(i, 532741 | (1 << i)) for i in range(26) if available_alphabet & (1 << i)]) max_word_cnt = 0 while stack: curr, selected = stack.pop() if bin(selected).count("1") == K or selected == available_alphabet: word_cnt = 0 for word in words: if word & selected == word: word_cnt += 1 max_word_cnt = max(max_word_cnt, word_cnt) continue for i in range(curr + 1, 26): if 532741 & (1 << i): continue if avail

제출 #30439

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: