Submission #550296

#	Time	Username	Problem	Language	Result	Execution time	Memory
550296		beaconmc	Type Printer (IOI08_printer)	Pypy 3	100 / 100	648 ms	31832 KiB

printer

O='P'
N=dict
M=input
K=range
H=print
D=len
L=int(M())
def I(a,b):
	A=0
	for B in K(min(D(a),D(b))):
		if a[B]==b[B]:A+=1
		else:break
	return A
F=N()
for A in K(L):F[M()]=0
J=''
for A in F:
	if D(A)>D(J):J=A
P=N()
for A in F:F[A]=I(A,J)
B=[A for A in F]
B.sort(key=lambda x:(F[x],x))
G=1
C=[]
for A in K(D(B)-1):
	for E in B[A][D(C):]:C.append(E);G+=1
	G+=1
	for A in B[A][I(B[A],B[A+1]):][::-1]:G+=1;C.pop()
for E in B[-1][D(C):]:G+=1
H(G)
C=[]
for A in K(D(B)-1):
	for E in B[A][D(C):]:C.append(E);H(E)
	H(O)
	for A in B[A][I(B[A],B[A+1]):][::-1]:H('-');C.pop()
for E in B[-1][D(C):]:H(E)
H(O)

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10