소개
APSwBT(Algorithm Problem Solving with Beakjoon Tag)는 백준과 솔브드의 모든 태그의 카테고리를 분류하고 난이도 별로 정리한 블로그입니다.
graph LR home --> paradigm home --> data_structure home --> algorithm algorithm --> sorting_search algorithm --> trees algorithm --> graphs algorithm --> strings algorithm --> math algorithm --> dp algorithm --> others math --> number_theory math --> geometry subgraph Navigation home posts tags end home(["fa:fa-code Home"]):::tier1 posts(["fa:fa-code Posts"]):::tier1 tags(["fa:fa-code Tags"]):::tier1 paradigm(["fa:fa-code 패러다임"]):::tier2 data_structure(["fa:fa-code 자료구조"]):::tier2 algorithm(["fa:fa-code 알고리즘"]):::tier2 sorting_search(["fa:fa-code 정렬과 탐색"]):::tier3 trees(["fa:fa-code 트리"]):::tier3 graphs(["fa:fa-code 그래프"]):::tier3 strings(["fa:fa-code 문자열"]):::tier3 math(["fa:fa-code 수학"]):::tier3 dp(["fa:fa-code 동적계획법"]):::tier3 others(["fa:fa-code 기타"]):::tier3 number_theory(["fa:fa-code 정수론"]):::tier3 geometry(["fa:fa-code 기하"]):::tier3 classDef tier1 fill:#435f7a, color:#fff, stroke:#0000 classDef tier2 fill:#ec9a00, color:#fff, stroke:#0000 classDef tier3 fill:#27e2a4, color:#fff, stroke:#0000
빨간색 배지가 있는 태그를 클릭하시면 관련 포스트로 이동하실 수 있습니다.
graph LR bronze --> silver --> gold --> platinum --> diamond --> ruby subgraph 쉬움 bronze silver end subgraph 어려움 diamond ruby end bronze([Bronze]):::tier0 silver([Silver]):::tier1 gold([Gold]):::tier2 platinum([Platinum]):::tier3 diamond([Diamond]):::tier4 ruby([Ruby]):::tier5 classDef tier0 fill:#ad5600, color:#fff, stroke:#0000 classDef tier1 fill:#435f7a, color:#fff, stroke:#0000 classDef tier2 fill:#ec9a00, color:#fff, stroke:#0000 classDef tier3 fill:#27e2a4, color:#fff, stroke:#0000 classDef tier4 fill:#00b4fc, color:#fff, stroke:#0000 classDef tier5 fill:#ff0062, color:#fff, stroke:#0000
각 태그의 색깔은 해당 태그가 사용된 백준 문제의 평균 솔브드 티어입니다.
플랫폼 | 아이디 |
---|---|
GitHub | CHOYUNSIG |
Baekjoon Online Judge | asdfghjkl46 |
solved.ac | asdfghjkl46 |
블로그의 모든 글은 조윤식이 작성하였습니다. 오타 및 내용 상의 오류나 개선 사항이 있을 경우 의견을 보내주세요.
패러다임
graph LR #divide_and_conquer #dp #bruteforcing --> #backtracking #greedy #heuristics
자료구조
graph LR #data_structures --> #stack #data_structures --> #queue #data_structures --> #string #queue --> #deque #data_structures --> #linked_list #data_structures --> #graphs #data_structures --> #trees #trees --> #priority_queue #trees --> #tree_set #trees --> #segtree #data_structures --> #hash_set #graphs --> #graph_traversal #graph_traversal --> #dfs #graph_traversal --> #bfs #recursion --> #dfs #hashing --> #hash_set subgraph 선형 #stack #queue #string #deque end subgraph 비선형 #graphs #segtree #priority_queue #trees #tree_set end
알고리즘
정렬과 탐색
graph LR #sorting --> #binary_search #binary_search --> #parametric_search #parametric_search --> #pbs
트리
graph LR #trees --> #tree_set #trees --> #priority_queue #trees --> #segtree #trees --> #disjoint_set #trees --> #euler_tour_technique #trees --> #centroid #trees --> #tree_compression #trees --> #tree_decomposition #trees --> #smaller_to_larger #tree_set --> #splay_tree #tree_set --> #rb_tree #priority_queue --> #cartesian_tree #lca --> #link_cut_tree #lca --> #hld #centroid --> #centroid_decomposition #centroid --> #tree_isomorphism #splay_tree --> #link_cut_tree #link_cut_tree --> #top_tree #segtree --> #merge_sort_tree #segtree --> #lazyprop #segtree --> #pst #segtree --> #multi_segtree #segtree --> #offline_dynamic_connectivity #segtree --> #hld #euler_tour_technique --> #lca #lazyprop --> #link_cut_tree #disjoint_set --> #offline_dynamic_connectivity subgraph 기법 #tree_compression #tree_decomposition #smaller_to_larger end
그래프
graph LR #graphs --> #shortest_path #graphs --> #flow #graphs --> #bipartite_graph #graphs --> #general_matching #graphs --> #scc #graphs --> #functional_graph #graphs --> #articulation #graphs --> #mst #graphs --> #tsp #graphs --> #dag #graphs --> #chordal_graph #graphs --> #degree_sequence #graphs --> #dual_graph #graphs --> #flood_fill #graphs --> #eulerian_path #general_matching --> #bipartite_matching #articulation --> #biconnected_component #articulation --> #cactus #articulation --> #dominator_tree #shortest_path --> #dijkstra #shortest_path --> #bellman_ford #shortest_path --> #floyd_warshall #flow --> #circulation #flow --> #stoer_wagner #flow --> #mcmf #flow --> #mfmc #flow --> #bipartite_matching #bipartite_graph --> #bipartite_matching #bipartite_matching --> #hall #bipartite_matching --> #hungarian #bipartite_matching --> #stable_marriage #mst --> #directed_mst #scc --> #2_sat #scc --> #permutation_cycle_decomposition #functional_graph --> #permutation_cycle_decomposition #dijkstra --> #0_1_bfs #dijkstra --> #a_star #dag --> #topological_sorting #dag --> #lgv
문자열
graph LR #string --> #utf8 #string --> #manacher #string --> #palindrome_tree #string --> #rope #string --> #parsing #string --> #trie #string --> #kmp #string --> #rabin_karp #string --> #suffix_array #string --> #z #parsing --> #regex #trie --> #aho_corasick #trie --> #suffix_tree subgraph 회문 #manacher #palindrome_tree end subgraph 패턴 매칭 #aho_corasick #kmp #rabin_karp #suffix_array #suffix_tree #z end
수학
graph LR #math --> #number_theory #math --> #geometry #math --> #linear_algebra #math --> #combinatorics #math --> #game_theory #math --> #calculus #math --> #probability #math --> #pigeonhole_principle #math --> #statistics #math --> #physics #math --> #arithmetic #math --> #duality #linear_algebra --> #gaussian_elimination #linear_algebra --> #sparse_table #linear_algebra --> #matroid #game_theory --> #sprague_grundy #sprague_grundy --> #hackenbush #calculus --> #fft #calculus --> #gradient_descent #calculus --> #ternary_search #calculus --> #green #calculus --> #numerical_analysis #fft --> #multipoint_evaluation #combinatorics --> #matroid #combinatorics --> #inclusion_and_exclusion #combinatorics --> #lucas #combinatorics --> #burnside #combinatorics --> #generating_function #probability --> #bayes #probability --> #linearity_of_expectation #probability --> #randomization #probability --> #differential_cryptanalysis #probability --> #birthday #numerical_analysis --> #linear_programming #numerical_analysis --> #polynomial_interpolation #arithmetic --> #arbitrary_precision #arithmetic --> #discrete_kth_root #arithmetic --> #discrete_log #arithmetic --> #discrete_sqrt #arithmetic --> #exponentiation_by_squaring #pigeonhole_principle --> #birthday
정수론
graph LR #number_theory --> #crt #number_theory --> #euler_phi #number_theory --> #euclidean #number_theory --> #flt #number_theory --> #primality_test #number_theory --> #mobius_inversion #number_theory --> #lte #primality_test --> #miller_rabin #primality_test --> #sieve #flt --> #miller_rabin #euclidean --> #extended_euclidean #euclidean --> #pollard_rho #miller_rabin --> #pollard_rho #extended_euclidean --> #modular_multiplicative_inverse
기하
graph LR #geometry --> #pythagoras #geometry --> #line_intersection #geometry --> #sweeping #geometry --> #coordinate_compression #geometry --> #delaunay #geometry --> #geometry_3d #geometry --> #euler_characteristic #geometry --> #polygon_area #geometry --> #min_enclosing_circle #geometry --> #geometric_boolean_operations #euler_characteristic --> #pick #euler_characteristic --> #planar_graph #delaunay <--> #voronoi #geometry_3d --> #geometry_hyper #line_intersection --> #convex_hull #line_intersection --> #point_in_non_convex_polygon #line_intersection --> #half_plane_intersection #convex_hull --> #rotating_calipers #convex_hull --> #point_in_convex_polygon
동적계획법
graph LR #dp --> #prefix_sum #dp --> #knapsack #dp --> #dp_deque #dp --> #dp_digit #dp --> #dp_tree #dp --> #dp_connection_profile #dp --> #dp_bitfield #dp --> #dp_sum_over_subsets #dp --> #slope_trick #dp --> #cht #dp --> #divide_and_conquer_optimization #dp --> #monotone_queue_optimization #dp --> #knuth #dp --> #kitamasa #dp --> #alien #dp --> #hirschberg #kitamasa --> #berlekamp_massey #dp_deque --> #deque_trick #bitmask --> #bitset #bitmask --> #dp_connection_profile #bitmask --> #dp_bitfield #bitmask --> #dp_sum_over_subsets subgraph 점화식 #alien #monotone_queue_optimization #berlekamp_massey #cht #divide_and_conquer_optimization #knuth #kitamasa #hirschberg end
기타
graph LR #two_pointer --> #sliding_window #two_pointer --> #mitm #two_pointer --> #sqrt_decomposition #two_pointer --> #mo #offline_queries --> #mo #mitm --> #bidirectional_search
graph LR #dancing_links --> #knuth_x
graph LR #implementation --> #case_work #implementation --> #simulation
graph LR #majority_vote #lis #simulated_annealing #constructive #ad_hoc #precomputation