제출 #1243789

#제출 시각아이디문제언어결과실행 시간메모리
1243789Double_SlashStone Arranging 2 (JOI23_ho_t1)Pypy 3
100 / 100
288 ms92604 KiB
n = int(input()) s = set() l = [] for i in range(n): a = int(input()) if a in s: while l[-1][2] != a: s.remove(l[-1][2]) l.pop(-1) l[-1][1] = i else: l.append([i, i, a]) s.add(a) ans = [0] * n for x, y, v in l: for i in range(y - x + 1): print(v)

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 25%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...