일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
- 논문 구현
- 딥러닝
- OpenCV
- 알고리즘
- attention
- Computer Vision
- reconstruction
- transformer
- cv2
- 프로그래머스
- Knowledge Distillation
- Python
- center loss
- NLP
- flame
- Deeplearning
- 자료구조
- Object Detection
- Threshold
- 파이썬
- level2
- 스택
- 큐
- 임계처리
- deep learning
- 3D
- numpy
- point cloud
- Object Tracking
- re-identification
- Today
- Total
목록level2 (2)
공돌이 공룡의 서재
from math import ceil def solution(progresses, speeds): answer = [] #1 period = [ceil((100-progresses[i])/speeds[i]) for i in range(len(progresses)-1, -1, -1)] #2 release = [] elapse = period.pop() release.append(elapse) #3 while len(period) > 0: work = period.pop() if elapse < work: answer.append(len(release)) release = [] period.append(work) elapse = work else: release.append(work) answer.appe..
def solution(bridge_length, weight, truck_weights): time = 0 truck = truck_weights[::-1]# (1) bridge = [] input = [] while not (len(bridge) == 0 and len(truck) == 0):# (2) time += 1 # print(time, 'AM: ', bridge, input) if len(input) > 0: if time - input[0] == bridge_length: bridge.pop(0) input.pop(0) if len(truck) != 0: go = truck.pop() if (len(bridge) + 1 다리 안에 있는 트럭에서 pop을 하는 횟수 라고 생각하여서 효율성에 ..