提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
114898	2023-10-24 11:05:12	U_S	F	python	18/18	AC	66

# import sys
# sys.setrecursionlimit(10**7)
# input = sys.stdin.readline
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
def mp():return map(int,input().split())
def lmp():return list(map(str,input().split()))
def lm1(LIST): return list(map(lambda x:x-1, LIST))
def mps(A):return [tuple(map(int, input().split())) for _ in range(A)]
def stoi(LIST):return list(map(int,LIST))
def itos(LIST):return list(map(str,LIST))
def atoi(LIST): return [ord(i)-ord("a") for i in LIST]
def Atoi(LIST): return [ord(i)-ord("A") for i in LIST]
def bitA(X,A):return X & 1<<A == 1<<A
import math
import bisect
import heapq
import time
from copy import copy as cc
from copy import deepcopy as dc
from itertools import accumulate, product
from collections import Counter, defaultdict, deque
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = (1<<63)-1
mod = 998244353

Q = int(input())
dq = deque([])
for i in range(Q):
    q = lmp()
    if q[0] == "1":
        dq.append(q[1])
    else:
        if len(dq) == 0:
            print("何もなくてごめんね")
        elif len(dq) == 1:
            u = dq.popleft()
            print(u+"しかなかったんだけどいいかな")
        else:
            u = dq.popleft()
            print(u+"だけどいいかな")
print(len(dq))

sample1.txt AC 18
sample2.txt AC 25
sample3.txt AC 33
case1.txt AC 32
case2.txt AC 18
case3.txt AC 52
case4.txt AC 38
case5.txt AC 42
case6.txt AC 39
case7.txt AC 66
case8.txt AC 24
case9.txt AC 46
case10.txt AC 36
case11.txt AC 31
case12.txt AC 46
case13.txt AC 33
case14.txt AC 40
case15.txt AC 46
66 AC