提出 #43178902

---

ソースコード 拡げる

from itertools import combinations
from collections import defaultdict, deque
 
N, M = map(int, input().split())
 
S = [input() for _ in range(N)]
 
edge = defaultdict(list)
for i, j in combinations(range(N), 2):
  cnt = sum(1 for c1, c2 in zip(S[i], S[j]) if c1 != c2)
  if cnt == 1:
    edge[i].append(j)
    edge[j].append(i)
    
for start in range(N):
  q = deque([start])
  remaind = set(range(N))
  remaind.remove(start) 
  while q:
    now = q.popleft()
    for nxt in edge[now]:
      if nxt not in remaind: continue
      q.append(nxt)
      remaind.remove(nxt)
  if not remaind:
    print("Yes")
    exit()
    
print("No")

提出情報

ジャッジ結果