Carpe Diem Carpe Diem

첫번째 시도 (시간초과) - reverse를 매번 해줘서 타임아웃 from collections import deque import sys t=int(sys.stdin.readline()) for i in range(t): p=sys.stdin.readline() n=int(sys.stdin.readline()) x=deque(sys.stdin.readline().rstrip()[1:-1].split(',')) for i in range(n): x[i]=int(x[i]) if n==0: print('error') else: for j in p: if j=='R': x.reverse() elif j=='D': if x: x.popleft() else: print("error") print(list(x)) ..

import math t=int(input()) for i in range(t): x1,y1,r1,x2,y2,r2=map(int,input().split()) distance=math.sqrt((x1-x2)**2+(y1-y2)**2) #두 원 사이의 거리 if x1==x2 and y1==y2 and r1==r2: #두 원이 일치하는 경우 print(-1) elif r1+r2==distance or abs(r1-r2)==distance: #두원이 한점에서 만나는 경우 print(1) elif r1+r2>distance and abs(r1-r2)

from string import ascii_uppercase def solution(msg): answer=[] alphabet = {} for i in range(len(ascii_uppercase)): alphabet[ascii_uppercase[i]] = i+1 #알파벳 만들기 k=0 #start i=len(msg) #end while True: if msg[k:i] in alphabet: answer.append(alphabet[msg[k:i]]) if i>=len(msg): return answer # while 문 종료 alphabet[msg[k:i+1]]=len(alphabet)+1 k+=len(msg[k:i]) i=len(msg) else: #이미 알파벳에 있으면 i-=1 #end 길이 -1

import heapq def solution(scoville, K): count=0 heapq.heapify(scoville) #이부분을 안해줘서 계속 오류가 남 while scoville[0]

def solution(elements): answer = [] elements+=elements #두개 이어붙이기 for i in range(1,len(elements)//2+1): for j in range(len(elements)//2): answer.append(sum(elements[j:j+i])) return len(set(answer))

def solution(n): dp=[0]*(n+2) dp[2]=3 for i in range(4,n+1,2): dp[i]+=(dp[i-2]*3)+2 for j in range(2,i-2,2): dp[i]+=dp[j]*2 dp[i]=dp[i]%1000000007 return dp[n] #0:0 #2:3=3 #4:11=9+2 #6:41=33+6+2 #8:153=123+22+6+2=dp[6]*3+dp[4]*2+dp[2]*2+2

from collections import Counter anum,bnum=map(int,input().split()) a=list(map(int,input().split())) b=list(map(int,input().split())) count1=Counter(a) count2=Counter(b) print(len(list((count1-count2).elements()))+len(list((count2-count1).elements())))

import math def solution(progresses, speeds): days=[] for i in range(len(speeds)): days.append(math.ceil((100-progresses[i])/speeds[i])) #처리 기간 answer=[] cnt=1 M=days[0] for i in range(1,len(days)): if days[i]