이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
from itertools import permutations
n = int(input())
words = [input() for _ in range(n)]
best = []
for per in permutations(words):
m = []
printer = ''
for i in per:
r = len(printer)
for j in range(len(printer)):
if j > len(i) or printer[j] != i[j]:
r = len(printer) - j
break
m.extend(['-'] * r)
m.extend([j for j in i[-(len(i) - (len(printer) - r)):]])
printer = i
m.append('P')
if len(best) == 0 or len(m) < len(best):
best = m
print(len(best))
for i in best:
print(i)
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |