seyeonHello

구간합 알고리즘 import sys input=sys.stdin.readline n, h = map(int, input().split(" ")) down = [0] * h # 석순 up = [0] * h # 종유석 for i in range(n): end=int(input())-1 if i%2==0: down[end]+=1 else: up[end]+=1 for i in range(h - 2, -1, -1): down[i] += down[i + 1] up[i] += up[i + 1] down.reverse() result=[] for j in range(len(down)): result.append(down[j]+up[j]) # 각 높이마다 장애물 합 mins=min(result) cnt=result.co..

시뮬레이션 유형 import sys from collections import deque input=sys.stdin.readline N=int(input()) K=int(input()) dirs=[(0,1),(1,0),(0,-1),(-1,0)] board=[[0]*N for _ in range(N)] for _ in range(K): r,c=map(int,input().split()) board[r-1][c-1]='*' num=int(input()) moves=deque() for _ in range(num): time,move=input().split() moves.append((int(time),move)) idx=0 board[0][0]=1 cur_x,cur_y=0,0 tail=deque() fo..

cmake는 빌드 파일(Makefile)을 생성해주는 프로그램 입니다. CMakeLists.txt ---(cmake)---> Makefile ---(make)--->실행파일 //main.cpp #include #include "myhead.h" int main(void) { int result = sum(1,2); printf("answer is %d \n", result); return 0; } //myhead.h int sum(int a, int b); //myhead.cpp int sum(int a, int b) { return (a+b); } 상위 디렉토리에 CMakeLists.txt 파일 생성 후 작성 cmake_minimum_required(VERSION 3.10) # 프로젝트 정보 proje..

2018 KAKAO BLIND RECRUITMENT def solution(n, t, m, p): answer = '' for num in range(1, t*m): res='' while num>0: num,mod=divmod(num,n) if 10

2018 KAKAO BLIND RECRUITMENT - queue와 list사용 from collections import deque def solution(msg): answer = [] dics = [] que=deque(msg) dics=[chr(i) for i in range(ord('A'),ord('Z')+1)] #A:0,B:1,.. tmp='' while len(que)>0: tmp='' for _ in range(0,len(que)): tmp+=que[0] if tmp in dics: que.popleft() else: #사전에 포함이 안될 때 answer.append(dics.index(tmp[:-1])+1) #사전에 포함안되는 문자는 빼기 dics.append(tmp) break answ..

2018 KAKAO BLIND RECRUITMENT - 문자열 치환 아이디어 참고 def change(song): song=song.replace('A#','a').replace('C#', 'c').replace('D#', 'd').replace('F#', 'f').replace('G#', 'g') return song def solution(m, musicinfos): answer = '' m=change(m) max_diff=0 for info in musicinfos: start,end,title,song=info.split(',') song=change(song) ends=list(map(int,end.split(':'))) starts=list(map(int,start.split(':'))) d..

2019 카카오 개발자 겨울 인턴십 - 스택 사용 def solution(board, moves): answer = 0 stack=[] for move in moves: for i in range(0, len(board)): if board[i][move-1]!=0: if len(stack)>0 and stack[-1]==board[i][move-1]: answer+=2 stack.pop() else: stack.append(board[i][move-1]) board[i][move-1]=0 break return answer

시뮬레이션 문제 python deque의 rotate함수 활용 정답코드 import sys input=sys.stdin.readline from collections import deque testcase=int(input()) dir=deque([[-1,0],[0,1],[1,0],[0,-1]]) for _ in range(testcase): test=input().strip() max_x,max_y,min_x,min_y=0,0,0,0 x,y=0,0 for c in test: if c=='L': dir.rotate(1) if c=='R': dir.rotate(-1) if c=='F': x=x+dir[0][0] y=y+dir[0][1] if c=='B': x=x-dir[0][0] y=y-dir[0][1] ..

위상정렬 알고리즘 예제 입력 1 3 2 1 3 2 3 정답코드 import sys from collections import deque input=sys.stdin.readline def solve(): N,M=map(int,input().split()) arr=[[] for _ in range(N+1)] count=[0]*(N+1) queue=deque() for _ in range(M): A,B=map(int,input().split()) count[B]+=1 arr[A].append(B) for i in range(1,N+1): if count[i]==0: queue.append(i) while queue: now=queue.popleft() for num in arr[now]: count[num]..

최단거리 - bfs 알고리즘 정답코드 import sys input=sys.stdin.readline from collections import deque dirx=[1,0,-1,0] diry=[0,1,0,-1] def bfs(y,x): visited=[[-1]*N for _ in range(N)] queue=deque() queue.append((y,x)) visited[y][x]=0 while queue: cur=queue.popleft() for i in range(4): ny=cur[0]+diry[i] nx=cur[1]+dirx[i] if 0