[백준 바킹독] 0x09 - BFS 토마토(7576)
Introduction
Binary Search
Introduction
https://www.acmicpc.net/step/29
랜선 자르기
import sys
input = sys.stdin.readline
K, N = map(int,input().split())
lan = []
for _ in range(K):
lan.append(int(input()))
lan.sort()
def binary_search(in_arr, answer, start, end, target):
# 연산 부분
# 어떤 값 x 범위 (0,max(in_arr))
# 조건: sum([length//x for length in in_arr]) == target
if start > end:
return answer
x = (start+end)//2
# Zero Division Error 처리.
# start와 end가 0이라는 것은 선의 길이가 1인 것과 같음
if x == 0:
return 1
# 그 외
else:
val = sum([length//x for length in in_arr])
if val >= target:
answer = x
return binary_search(in_arr, answer, x+1, end, target)
else:
return binary_search(in_arr, answer, start, x-1, target)
print(binary_search(lan,0,0,lan[-1],N))나무 자르기
python3로 실행하면 시간 초과가 발생한다.
pypy3로 실행해야 한다.
import sys
input = sys.stdin.readline
N, M = map(int,input().split())
tree = list(map(int,input().split()))
tree.sort()
def binary_search(in_arr, answer, start, end, target):
# 연산 부분
# 어떤 값 x 범위 (0,max(in_arr))
# 조건: sum([max(0,length-x) for length in in_arr]) == target
if start > end:
return answer
x = (start+end)//2
# 탐색 부분
val = sum([max(0,length-x) for length in in_arr])
if val >= target:
answer = x
return binary_search(in_arr, answer, x+1, end, target)
else:
return binary_search(in_arr, answer, start, x-1, target)
print(binary_search(tree,0,0,tree[-1],M))공유기 설치
K번째 수
2022
[백준 바킹독] 0x09 - BFS 미로 탐색
Introduction
[백준 바킹독] 0x09 - BFS 그림
Introduction
[백준 바킹독] 0x09 - BFS Overview
Introduction
[백준 code.plus] 500 - 브루트 포스, 카잉달력
Introduction
[백준 code.plus] 500 - 브루트 포스, 수 이어 쓰기 1
Introduction
[백준 code.plus] 500 - 브루트 포스, 날짜계산
Introduction
[백준시리즈] N과 M 4
Introduction
[백준 code.plus] 500 - 브루트 포스, 일곱난쟁이
Introduction
[백준 code.plus] 500 - 브루트 포스 Overview
Introduction
[백준시리즈] N과 M 3
Introduction
[백준시리즈] N과 M 2
Introduction
[백준시리즈] N과 M 1
Introduction
[백준시리즈] Simulation: 아기 상어
Introduction
[백준시리즈] Simulation Overview
Introduction
[백준시리즈] N과 M 1
Introduction
[백준시리즈] N과 M 1
Introduction
[백준시리즈] N과 M 1
Introduction
[백준시리즈] N과 M 1
Introduction
[백준시리즈] N과 M 1
Introduction
[백준시리즈] N과 M 1
Introduction
[백준시리즈] N과 M 1
Introduction
[백준시리즈] N과 M 1
Introduction
[백준시리즈] N과 M Overview
Introduction
Simulation
Introduction
백준시리즈: N과 M
Introduction
백준시리즈: 1, 2, 3 더하기
Introduction
solved.ac: CLASS 5
Introduction
knapsack
Introduction
Sliding Window & Two Pointer
Introduction
Floyd-Warshall
Introduction
Union-Find
Introduction
스패닝트리 Kruskal
Introduction
가장 긴 증가하는 부분 수열 LIS
Introduction
Backtracking
Introduction
Divide Conquer
Introduction
Dynamic Programming 1
Introduction
Stack
Introduction
Divide Conquer
Introduction
Binary Search
Introduction
Stack
Introduction
Queue / Deque
Introduction
정수론과 조합론
Introduction
solved.ac: CLASS 4, 트리의 지름
1167 트리의 지름
Note: solved.ac 백준 티어
Introduction
Basic Math 2
Introduction
Backjoon Algorithm 2-1: Greedy
Introduction
Backjoon Algorithm 1-2: Graph1
Introduction
BFS / DFS
Introduction
Backjoon Algorithm 1-2: Graph1
Introduction
solved.ac: CLASS 4
Introduction
solved.ac: CLASS 3
Introduction
solved.ac: CLASS 2
Introduction
Backjoon Algorithm 1-1: Summary
Introduction
Backjoon Algorithm 1-1: Math1
Introduction
Backjoon Algorithm 1-1: Dynamic Programming 1
Introduction
Backjoon Algorithm 1-1: Data structure
Introduction
Backjoon Algorithm 1-1: Data structure
Introduction
Download-only-one-directory
Git 명령어를 사용한 하위 디렉토리 다운로드 Clone 할 로컬 저장소 생성
Basic Math 1
Introduction
How to convert submodule to regular folder
# Fetch the submodule commits into the main repository git remote add submodule_origin git://url/to/submodule/origin git fetch submodule_origin
코드업 5-3
Introduction
코드업 5-2
Introduction
코드업 Python 100제
Introduction
2020 KAKAO Blind Recruitment
Introduction
2020 KAKAO Blind Recruitment
Introduction
Sort
Introduction
Graph
Graph
Tree
Introduction
Shortest Path
Introduction
Binary Search
Introduction
Set / Map
Introduction
Brute Force
Introduction
알고리즘 수업
Introduction
Priority Queue
Introduction
what is spring
Spring Project
this is java
the page for java
How to Reduce Docekr Image Size
가벼운 Base image를 사용
Using C++ in Cython: simple tutorial
version: 3.0.0a10
github-blog: Layout
WIDTH
Calling C function and Using C libraies
version: 3.0.0a10
Mutex library on C++
#include <iostream> #include <thread> #include <chrono> #include <mutex> #include <atomic> #include <string.h>
Introduction to Cython
version: 3.0.0a10
Future library on C++
https://cplusplus.com/reference/future/
Thread library on C++
Multithreading support was introduced in C++11.
TODO
how to costom github blog using jekyll
Welcome to Jekyll!
You’ll find this post in your _posts directory. Go ahead and edit it and re-build the site to see your changes. You can rebuild the site in many different wa...