{"id":13720984,"url":"https://github.com/justiceHui/Unknown-To-Wellknown","last_synced_at":"2025-05-07T13:31:14.713Z","repository":{"id":54605530,"uuid":"271322874","full_name":"justiceHui/Unknown-To-Wellknown","owner":"justiceHui","description":"여기에 있는 자료구조/알고리즘만 전부 알아도 solved.ac 마스터 보장!","archived":false,"fork":false,"pushed_at":"2023-04-21T19:41:57.000Z","size":54,"stargazers_count":579,"open_issues_count":0,"forks_count":15,"subscribers_count":11,"default_branch":"master","last_synced_at":"2024-08-04T01:14:05.938Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/justiceHui.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null}},"created_at":"2020-06-10T16:03:40.000Z","updated_at":"2024-08-02T16:47:33.000Z","dependencies_parsed_at":"2024-01-06T00:12:24.690Z","dependency_job_id":"f5507fa3-22d6-466c-982a-b91a4a2fcae6","html_url":"https://github.com/justiceHui/Unknown-To-Wellknown","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justiceHui%2FUnknown-To-Wellknown","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justiceHui%2FUnknown-To-Wellknown/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justiceHui%2FUnknown-To-Wellknown/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justiceHui%2FUnknown-To-Wellknown/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/justiceHui","download_url":"https://codeload.github.com/justiceHui/Unknown-To-Wellknown/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":224604651,"owners_count":17339176,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-08-03T01:01:10.789Z","updated_at":"2025-05-07T13:31:14.705Z","avatar_url":"https://github.com/justiceHui.png","language":"C++","funding_links":[],"categories":["C++"],"sub_categories":[],"readme":"# 나 빼고 다 아는 그들만의 웰노운 테크닉 모음\n\n## 목표\n\n* 고인물의 대화를 이해하자\n* 나도 아는 척해보자\n* 랭작 좀 해보자\n\n### TODO\n\n* 주제별 설명글 링크 달기\n* 주제별 설명 [내 블로그](https://justicehui.github.io)에 올리기\n* 연습 문제 풀이 올리기\n\n## 목차\n\n* 그들만의 웰노운 사전지식\n  * 동적 계획법 관련\n    * Berlekamp-Massey\n    * Aliens Trick\n    * Slope Trick\n  * 자료구조\n    * Segment Tree Beats\n    * Kinetic Segment Tree\n    * BBST(Splay Tree, Treap)\n    * Dynamic Tree(Link/Cut Tree, Euler Tour Tree, Top Tree)\n    * Stern-Brocot Tree\n    * Permutation Tree\n  * 그래프 이론\n    * Push Relabel Algorithm, Cost Scaling Algorithm\n    * Dual of Planar Graph\n    * Dominator Tree\n    * Directed MST\n    * Offline Incremental SCC, Offline Dynamic MST\n    * Chordal Graph\n    * Treewidth, Tree Decomposition\n    * General Graph Matching\n  * 문자열\n    * Palindrome Tree(A.K.A. eerTree)\n    * Suffix Automaton, Suffix Tree\n    * Run Enumerate\n  * 수학\n    * FFT, NTT\n    * Polynomial Division, Kitamasa\n    * FWHT\n    * Multipoint Evaluation\n    * Polynomial Interpolation\n    * Generating Function\n    * Mobius Function\n    * Young Tableau Diagram, RSK Correspondence\n    * Matroid\n    * LGV Theorem\n  * 기하\n    * Voronoi Diagram, Dulaunay Triangulation\n* 그들만의 웰노운 문제 유형\n  * 민코프스키 합 DP\n  * Regions Trick\n  * Bulldozer Trick\n  * 쿼리를 $\\sqrt N$ 또는 $\\sqrt Q$개씩 묶어서 처리하는 유형\n  * 세그먼트 트리를 이용해 그래프의 간선 개수를 줄이는 유형\n  * 볼록 다각형의 접선을 이용해 최적화하는 유형\n  * 트리 위에서 exchange argument\n* 그들만의 이상한 최적화\n  * Fast I/O\n  * Bitset을 이용한 최적화\n  * SIMD\n  * Barrett Reduction\n* 그들만의 이상한 밈\n\n## 그들만의 웰노운 사전지식\n\n### Berlekamp-Massey\n\n* 튜토리얼\n  * (한글) [koosaga](https://koosaga.com/231)\n* 연습 문제 - 점화식 계산\n  * [Library Checker - Find Linear Recurrence](https://judge.yosupo.jp/problem/find_linear_recurrence)\n  * [BOJ 12916 K-Path](https://www.acmicpc.net/problem/12916)\n  * [BOJ 14559 Protocol](https://www.acmicpc.net/problem/14559)\n  * [BOJ 12797 연금술](https://www.acmicpc.net/problem/12797)\n  * [BOJ 13727 5차원 구사과 초콜릿](https://www.acmicpc.net/problem/13727)\n* 연습 문제 - 최소 다항식\n  * [Library Checker - Determinant of Sparse Matrix](https://judge.yosupo.jp/problem/sparse_matrix_det)\n  * [BOJ 27071 크루스칼 알고리즘](https://www.acmicpc.net/problem/27071)\n\n### Aliens Trick\n\n* 튜토리얼\n  * (한글) [koosaga](https://koosaga.com/243)\n  * (영어) [robert1003](https://robert1003.github.io/2020/02/26/dp-opt-wqs-binary-search.html)\n  * (영어) [USACO Guide](https://usaco.guide/adv/lagrange)\n* 연습 문제 - 최적값 구하기\n  * [BOJ 19672 Feast](https://www.acmicpc.net/problem/19672)\n  * [Edu CF 79 F](https://codeforces.com/contest/1279/problem/F)\n  * [BOJ 20090 Aliens](https://www.acmicpc.net/problem/20090)\n  * [BOJ 14510 Blazing New Trails](https://www.acmicpc.net/problem/14510)\n  * [BOJ 17439 꽃집](https://www.acmicpc.net/problem/17439)\n* 연습 문제 - 역추적\n  * [BOJ 18456 Jealous Split](https://www.acmicpc.net/problem/18456)\n\n### Slope Trick\n\n* 튜토리얼\n  * (한글) [jwvg0425](https://jwvg0425-ps.tistory.com/98)\n  * (한글) [koosaga](https://koosaga.com/243)\n  * (영어) [USACO Guide](https://usaco.guide/adv/slope-trick)\n  * (한글) [lobo_prix](https://blog.tuxedcat.com/all/algorithm/doc/dp/slope%20trick%201.html)\n* 연습 문제\n  * [BOJ 13323 BOJ 수열 1](https://www.acmicpc.net/problem/13323)\n  * [BOJ 18720 Bookface](https://www.acmicpc.net/problem/18720)\n  * [BOJ 19693 Safety](https://www.acmicpc.net/problem/19693)\n  * [BOJ 12736 Fireworks](https://www.acmicpc.net/problem/12736)\n\n### Segment Tree Beats\n\n* 튜토리얼\n  * (영어) [jiry_2](https://codeforces.com/blog/entry/57319)\n  * (영어) [Errichto](https://youtu.be/wFqKgrW1IMQ)\n  * (한글) [rdd6584](https://github.com/infossm/infossm.github.io/blob/7571d3d0ac66f7dd60f35cc4e826d20995ca1875/_posts/2019-10-19-Segment-Tree-Beats.md)\n  * (한글) [koosaga](https://koosaga.com/307)\n* 연습 문제\n  * [BOJ 17474 수열과 쿼리 26](https://www.acmicpc.net/problem/17474)\n  * [BOJ 14899 수열과 쿼리 19](https://www.acmicpc.net/problem/14899)\n  * [BOJ 17476 수열과 쿼리 28](https://www.acmicpc.net/problem/17476)\n  * [BOJ 19277 ADD, DIV, MAX](https://www.acmicpc.net/problem/19277)\n  * [BOJ 17473 수열과 쿼리 25](https://www.acmicpc.net/problem/17473)\n  * [BOJ 17477 수열과 쿼리 29](https://www.acmicpc.net/problem/17477)\n  * [BOJ 17475 수열과 쿼리 27](https://www.acmicpc.net/problem/17475)\n\n### Kinetic Segment Tree\n\n* 튜토리얼\n  * (한글) [koosaga](https://koosaga.com/307)\n* 연습 문제\n  * [BOJ 2788 스타트업](https://www.acmicpc.net/problem/2788)\n  * [BOJ 26144 꺾이지 않는 마음 3](https://www.acmicpc.net/problem/26144)\n\n### BBST(Splay Tree, Treap)\n\n* 튜토리얼 - Splay Tree\n  * (한글) [cubelover](https://cubelover.tistory.com/10)\n  * (영어) [Zhtluo](https://zhtluo.com/cp/splay-tree-one-tree-to-rule-them-all.html) - 시간 복잡도 증명이 궁금하다면...\n* 튜토리얼 - Treap\n  * (영어) [SecondThread](https://codeforces.com/blog/entry/84017)\n* 연습 문제\n  * [BOJ 13159 배열](https://www.acmicpc.net/problem/13159)\n  * [BOJ 17607 수열과 쿼리 31](https://www.acmicpc.net/problem/17607)\n  * [BOJ 13543 수열과 쿼리 2](https://www.acmicpc.net/problem/13543)\n  * [BOJ 2844 자료 구조](https://www.acmicpc.net/problem/2844)\n  * [BOJ 19497 Subtract if Greater!](https://www.acmicpc.net/problem/19497)\n  * [BOJ 15389 Imelda’s Shopping Spree](https://www.acmicpc.net/problem/15389)\n* 연습 문제 - Persistent BBST\n  * [BOJ 17486 수열과 쿼리 30](https://www.acmicpc.net/problem/17486)\n\n### Dynamic Tree(Link/Cut Tree, Euler Tour Tree, Top Tree)\n\n* 튜토리얼 - Link/Cut Tree\n  * (한글) [imeimi](https://imeimi.tistory.com/27)\n* 튜토리얼 - Euler Tour Tree\n  * (영어) [PurpleCrayon](https://codeforces.com/blog/entry/102087)\n* 튜토리얼 - Top Tree\n  * (한글) [koosaga](https://github.com/infossm/infossm.github.io/blob/master/_posts/2021-03-21-toptree.md)\n* 연습 문제 - 공통\n  * [BOJ 13539 트리와 쿼리 11](https://www.acmicpc.net/problem/13539)\n* 연습 문제 - Link/Cut Tree\n  * [BOJ 21973 남극 탐험](https://www.acmicpc.net/problem/21973)\n  * [Library Checker - Dynamic Tree Vertex Add Path Sum](https://judge.yosupo.jp/problem/dynamic_tree_vertex_add_path_sum)\n  * [Library Checker - Dynamic Tree Vertex Set Path Composite](https://judge.yosupo.jp/problem/dynamic_tree_vertex_set_path_composite)\n  * [BOJ 10724 판게아 2](https://www.acmicpc.net/problem/10724)\n  * [BOJ 18861 가슴 속에 무엇인가](https://www.acmicpc.net/problem/18861)\n  * [BOJ 22906 장난감 오렌지 만들기](https://www.acmicpc.net/problem/22906)\n  * [BOJ 18374 함수의 맛](https://www.acmicpc.net/problem/18374)\n* 연습 문제 - Euler Tour Tree\n  * [Library Checker - Dynamic Tree Vertex Add Subtree Sum](https://judge.yosupo.jp/problem/dynamic_tree_vertex_add_subtree_sum)\n  * [Library Checker - Dynamic Tree Subtree Add Subtree Sum](https://judge.yosupo.jp/problem/dynamic_tree_subtree_add_subtree_sum)\n  * [BOJ 27974 트리와 쿼리 21](https://www.acmicpc.net/problem/27974)\n* 연습 문제 - Top Tree\n  * [BOJ 17936 트리와 쿼리 13](https://www.acmicpc.net/problem/17936)\n  * [BOJ 21728 트리와 2개의 지름](https://www.acmicpc.net/problem/21728)\n\n### Stern-Brocot Tree\n\n* 튜토리얼\n  * (한글) [myungwoo](https://blog.myungwoo.kr/126)\n* 연습 문제\n  * [BOJ 22662 Pi is Three](https://www.acmicpc.net/problem/22662)\n\n### Permutation Tree\n\n* 튜토리얼\n  * (영어) [errorgorn](https://codeforces.com/blog/entry/78898)\n  * (중국어) [OI-Wiki](https://oi-wiki.org/ds/divide-combine/)\n* 연습 문제\n  * [BOJ 25503 순열 뒤집기](https://www.acmicpc.net/problem/25503)\n  * [BOJ 23720 움얌얌](https://www.acmicpc.net/problem/23720)\n\n### Push Relabel Algorithm, Cost Scaling Algorithm\n\n* 튜토리얼 - Push Relabel Algorithm\n  * (한글) [koosaga](https://koosaga.com/287)\n* 튜토리얼 - Cost Scaling Algorithm\n  * (한글) [koosaga](https://koosaga.com/289)\n* 연습 문제 - Push Relabel Algorithm\n  * [LibreOJ 127](https://loj.ac/p/127)\n  * [BOJ 13161 분단의 슬픔](https://www.acmicpc.net/problem/13161)\n* 연습 문제 - Cost Scaling Algorithm\n  * [LiberOJ 102](https://loj.ac/p/102)\n  * [BOJ 19022 Flow](https://www.acmicpc.net/problem/19022)\n\n### Dual of Planar Graph\n\n* 튜토리얼\n  * (한글) [ahgus89](https://algoshitpo.github.io/2020/03/23/dual/)\n* 연습 문제\n  * [BOJ 13145 Masonry Bridge](https://www.acmicpc.net/problem/13145)\n  * [BOJ 17442 삼분 그래프](https://www.acmicpc.net/problem/17442)\n  * [BOJ 15308 비밀 요원](https://www.acmicpc.net/problem/15308)\n  * [BOJ 18941 평면그래프와 게임](https://www.acmicpc.net/problem/18941)\n\n### Dominator Tree\n\n* 튜토리얼\n  * (한글) [jinhan814](https://blog.naver.com/jinhan814/222636375208)\n  * (한글) [koosaga](https://koosaga.com/201)\n  * (한글) [mhy908](https://lunarhy.tistory.com/11) - DAG에서의 Dominator Tree\n  * (영어) [Baba](https://codeforces.com/blog/entry/22811) - $O((V+E) \\log V)$ 알고리즘이 궁금하다면...\n* 연습 문제 - DAG\n  * [BOJ 7777 병원](https://www.acmicpc.net/problem/7777)\n  * [BOJ 19335 Increasing Costs](https://www.acmicpc.net/problem/19335)\n* 연습 문제\n  * [Library Checker - Dominator Tree](https://judge.yosupo.jp/problem/dominatortree)\n  * [BOJ 20174 Ink Mix](https://www.acmicpc.net/problem/20174)\n  * [BOJ 25424 School Road](https://www.acmicpc.net/problem/25424)\n\n### Directed MST\n\n* 튜토리얼\n  * (한글) [gina0605](https://gina65.tistory.com/23) - $O(VE)$ 알고리즘\n  * (한글) [koosaga](https://koosaga.com/265) - $O((V+E) \\log E)$ 알고리즘\n* 연습 문제\n  * [Library Checker - Directed MST](https://judge.yosupo.jp/problem/directedmst)\n  * [BOJ 16127 미생물 키우기](https://www.acmicpc.net/problem/16127)\n  * [BOJ 19264 Hung Fu](https://www.acmicpc.net/problem/19264)\n  * [BOJ 9582 Dictionary](https://www.acmicpc.net/problem/9582)\n\n### Offline Incremental SCC, Offline Dynamic MST\n\n* 튜토리얼 - SCC\n  * (한글) [chootose](https://github.com/infossm/infossm.github.io/blob/master/_posts/2021-03-21-offline-incremental-SCC.md)\n* 튜토리얼 - MST\n  * (한글) [koosaga](https://koosaga.com/211)\n* 연습 문제 - SCC\n  * [BOJ 19028 Link Cut Diagraph](https://www.acmicpc.net/problem/19028)\n  * [BOJ 8496 Godzilla](https://www.acmicpc.net/problem/8496)\n* 연습 문제 - MST\n  * [BOJ 10724 판게아 2](https://www.acmicpc.net/problem/10724)\n\n### Chordal Graph\n\n* 튜토리얼\n  * (한글) [ainta](https://github.com/infossm/infossm.github.io/blob/master/_posts/2019-04-20-Finding%20perfect%20elimination%20ordering%20in%20choral%20graphs.md)\n* 연습 문제\n  * [Library Checker - Chordal Graph Recognition](https://judge.yosupo.jp/problem/chordal_graph_recognition)\n  * [BOJ 16003 자석 장난감](https://www.acmicpc.net/problem/16003)\n  * [BOJ 16365 Square Root](https://www.acmicpc.net/problem/16365)\n\n### Treewidth, Tree Decomposition\n\n* 튜토리얼\n  * (한글) [koosaga](https://koosaga.com/295)\n  * (영어) [Ignasi Sau](https://www.lirmm.fr/~sau/talks/tw-Ignasi-2021.pdf)\n* 연습 문제 - 트리 분할\n  * [BOJ 16183 Electronic Circuit](https://www.acmicpc.net/problem/16183) - 주어진 그래프가 Series-Parallel Graph인지 판별\n  * [Library Checker - Tree Decomposition (Width 2)](https://judge.yosupo.jp/problem/tree_decomposition_width_2) - Series-Parallel Graph의 Tree Decomposition을 구하는 문제\n  * [BOJ 26415 Ghost](https://www.acmicpc.net/problem/26415) - Halin Graph의 Tree Decomposition을 구하는 문제\n* 연습 문제 - DP\n  * [BOJ 22982 선인장의 독립집합](https://www.acmicpc.net/problem/22982)\n  * [BOJ 17824 아폴로니안 네트워크](https://www.acmicpc.net/problem/17824)\n  * [BOJ 19267 Kid's Nightmare](https://www.acmicpc.net/problem/19267)\n* 연습 문제 - 최단 경로 쿼리\n  * [BOJ 11738 Distance on Triangulation](https://www.acmicpc.net/problem/11738)\n  * [BOJ 17366 %](https://www.acmicpc.net/problem/17366)\n  * [BOJ 27814 Emacs++](https://www.acmicpc.net/problem/27814)\n  * [BOJ 17697 Railway Trip](https://www.acmicpc.net/problem/17697)\n  * [BOJ 24710 Station](https://www.acmicpc.net/problem/24710)\n  * [BOJ 25407](https://www.acmicpc.net/problem/25407)\n\n### General Graph Matching\n\n* 튜토리얼\n  * (한글) [koosaga](https://koosaga.com/258)\n* 연습 문제 - 무가중치\n  * [BOJ 15737 일반 그래프 매칭](https://www.acmicpc.net/problem/15737)\n  * [BOJ 21086 Smol Vertex Cover](https://www.acmicpc.net/problem/21086)\n  * [BOJ 16661 Bimatching](https://www.acmicpc.net/problem/16661)\n  * [BOJ 18447 Angle Beats](https://www.acmicpc.net/problem/18447)\n* 연습 문제 - 가중치\n  * [BOJ 15741 일반 그래프 최대 가중치 매칭](https://www.acmicpc.net/problem/15741)\n  * [BOJ 21639 Cooking](https://www.acmicpc.net/problem/21639)\n  * [BOJ 18519 Planar Max Cut](https://www.acmicpc.net/problem/18519)\n\n### Palindrome Tree (A.K.A. eerTree)\n\n* 튜토리얼\n  * (한글) [Karuna](https://algoshitpo.github.io/2020/03/23/eertree/)\n  * (영어) [Alessio Piergiacomi](https://medium.com/@alessiopiergiacomi/eertree-or-palindromic-tree-82453e75025b)\n* 연습 문제\n  * [BOJ 10066 팰린드롬](https://www.acmicpc.net/problem/10066)\n  * [BOJ 15893 가장 긴 공통부분 팰린드롬](https://www.acmicpc.net/problem/15893)\n  * [BOJ 18285 Jaki Jovsi](https://www.acmicpc.net/problem/18285)\n\n### Suffix Automaton, Suffix Tree\n\n* 튜토리얼\n  * (한글) [koosaga](https://koosaga.com/314)\n* 연습 문제\n  * [BOJ 11479 서로 다른 부분 문자열의 개수 2](https://www.acmicpc.net/problem/11479)\n  * [BOJ 16907 서로 다른 부분 문자열 쿼리 2](https://www.acmicpc.net/problem/16907)\n  * [BOJ 19515 Jong Hyok and String](https://www.acmicpc.net/problem/19515)\n  * [BOJ 13541 K번째 부분 문자열](https://www.acmicpc.net/problem/13541)\n  * [BOJ 26109 Longest Substring](https://www.acmicpc.net/problem/26109)\n  * [BOJ 14436 서로 다른 부분 문자열 쿼리](https://www.acmicpc.net/problem/14436)\n  * [BOJ 18544 Incomparable Pairs](https://www.acmicpc.net/problem/18544)\n  * [BOJ 18349 천지창조](https://www.acmicpc.net/problem/18349)\n\n### Run Enumerate\n\n* 튜토리얼\n  * (영어) [koosaga](https://codeforces.com/blog/entry/106725)\n* 연습 문제\n  * [Library Checker - Run Enumerate](https://judge.yosupo.jp/problem/runenumerate)\n  * [BOJ 23495 Longest Lyndon Prefix](https://www.acmicpc.net/problem/23495)\n  * [BOJ 25111 Repetitions](https://www.acmicpc.net/problem/25111)\n  * [BOJ 19020 Decomposition](https://www.acmicpc.net/problem/19020)\n  * [BOJ 16284 Lucid Strings](https://www.acmicpc.net/problem/16284)\n\n### FFT, NTT\n\n* 튜토리얼\n  * (한글) [namnamseo](https://namnamseo.tistory.com/entry/FFT-in-competitive-programming)\n  * (한글) [jhnah917](https://algoshitpo.github.io/2020/05/20/fft-ntt/) - 정확도 높은 FFT와 NTT\n* 연습 문제\n  * [Library Checker - Convolution](https://judge.yosupo.jp/problem/convolution_mod)\n  * [Library Checker - Convolution (Mod 1,000,00,007)](https://judge.yosupo.jp/problem/convolution_mod_1000000007)\n  * [BOJ 22289 큰 수 곱셈 (3)](https://www.acmicpc.net/problem/22289)\n  * [BOJ 10531 Golf Bot](https://www.acmicpc.net/problem/10531)\n  * [BOJ 1067 이동](https://www.acmicpc.net/problem/1067)\n  * [BOJ 13279 곱의 합 쿼리](https://www.acmicpc.net/problem/13279)\n  * [BOJ 13575 보석 가게](https://www.acmicpc.net/problem/13575)\n  * [BOJ 11385 씽크스몰](https://www.acmicpc.net/problem/11385)\n  * [BOJ 14882 다항식과 쿼리](https://www.acmicpc.net/problem/14882)\n\n### Polynomial Division, Kitamasa\n\n* 튜토리얼 - Polynomial Division\n  * (한글) [ho94949](https://github.com/infossm/infossm.github.io/blob/master/_posts/2019-06-17-Multipoint-evaluation.md)\n  * (한글) [hyperbolic](https://hyperbolic.tistory.com/4)\n  * (한글) [cubelover](https://cubelover.tistory.com/22)\n* 튜토리얼 - Kitamasa\n  * (한글) [jhnah917](https://justicehui.github.io/hard-algorithm/2021/03/13/kitamasa/)\n* 연습 문제\n  * [Library Checker - Division of Polynomials](https://judge.yosupo.jp/problem/division_of_polynomials)\n  * [BOJ 13758 RNG 2](https://www.acmicpc.net/problem/13758)\n\n### FWHT\n\n* 튜토리얼\n  * (한글) [gina0605](https://gina65.tistory.com/30)\n  * (영어) [upobir](https://codeforces.com/blog/entry/71899)\n* 연습 문제\n  * [BOJ 14878 부분 수열 XOR합](https://www.acmicpc.net/problem/14878)\n  * [BOJ 25563 AND, OR, XOR](https://www.acmicpc.net/problem/25563)\n  * [Library Checker - Subset Convolution](https://judge.yosupo.jp/problem/subset_convolution)\n\n### Multipoint Evaluation\n\n* 튜토리얼\n  * (한글) [ho94949](https://github.com/infossm/infossm.github.io/blob/master/_posts/2019-06-17-Multipoint-evaluation.md)\n  * (한글) [hyperbolic](https://hyperbolic.tistory.com/5)\n* 연습 문제\n  * [Library Checker - Multipoint Evaluation](https://judge.yosupo.jp/problem/multipoint_evaluation)\n  * [BOJ 18168 Game with Polynomials 2](https://www.acmicpc.net/problem/18168)\n\n### Polynomial Interpolation\n\n* 튜토리얼\n  * (한글) [hyperbolic](https://hyperbolic.tistory.com/5)\n* 연습 문제\n  * [Library Checker - Polynomial Interpolation](https://judge.yosupo.jp/problem/polynomial_interpolation)\n\n### Generating Function\n\n* 튜토리얼\n  * (한글) [evenharder](https://github.com/infossm/infossm.github.io/blob/master/_posts/2019-10-19-generating-function.md)\n  * (한글) [yclock - 1](https://github.com/infossm/infossm.github.io/blob/master/_posts/2021-04-18-generating-functions-1.md), [yclock - 2](https://github.com/infossm/infossm.github.io/blob/master/_posts/2021-05-17-generating-functions-2.md)\n* 연습 문제\n  * [BOJ 16725 다항 계수](https://www.acmicpc.net/problem/16725)\n  * [BOJ 13542 우표 구매하기 (Hard)](https://www.acmicpc.net/problem/13542)\n  * [BOJ 26037 지수 · 로그와 테일러 다항식(Large)](https://www.acmicpc.net/problem/26037)\n  * [BOJ 18248 제야의 종](https://www.acmicpc.net/problem/18248)\n\n### Mobius Function\n\n* 튜토리얼\n  * (한글) [rkm0959 - 1](https://rkm0959.tistory.com/186), [rkm0959 - 2](https://rkm0959.tistory.com/184)\n  * (한글) [snowflake - 1](https://xy-plane.tistory.com/16), [snowflake - 2](https://xy-plane.tistory.com/17), [snowflake - 3](https://xy-plane.tistory.com/18), [snowflake - 4](https://xy-plane.tistory.com/19)\n  * (한글) [ahgus89](https://ahgus89.github.io/algorithm/M%C3%B6bius-inversion/)\n* 연습 문제\n  * [BOJ 16409 Coprime Integers](https://www.acmicpc.net/problem/16409)\n  * [BOJ 14860 GCD 곱](https://www.acmicpc.net/problem/14860)\n  * [BOJ 11691 LCM(i, j)](https://www.acmicpc.net/problem/11691)\n  * [BOJ 14861 LCM 더하기](https://www.acmicpc.net/problem/14861)\n\n### Young Tableau Diagram, RSK Correspondence\n\n* 튜토리얼\n  * (영어) [mango_lassi](https://codeforces.com/blog/entry/98167)\n  * (한글) [yclock](https://youngyojun.github.io/secmem/2021/09/19/young-tableaux/)\n* 연습 문제\n  * [BOJ 18594 Three Investigators](https://www.acmicpc.net/problem/18594)\n  * [BOJ 18461 Disjoint LIS](https://www.acmicpc.net/problem/18461)\n\n### Matroid\n\n* 튜토리얼\n  * (한글) [ainta - 1](https://github.com/infossm/infossm.github.io/blob/master/_posts/2019-05-08-introduction-to-matroid.md), [ainta - 2](https://github.com/infossm/infossm.github.io/blob/master/_posts/2019-06-17-Matroid-Intersection.md)\n  * (영어) [ATSTNG](https://codeforces.com/blog/entry/69287)\n  * (한글) [imeimi](https://imeimi.tistory.com/45)\n* 연습 문제\n  * [BOJ 3836 Coin Collecting](https://www.acmicpc.net/problem/3836)\n  * [BOJ 16046 Rainbow Graph](https://www.acmicpc.net/problem/16046)\n  * [BOJ 18890 Seollal](https://www.acmicpc.net/problem/18890)\n  * [BOJ 21727 아즈텍의 섬](https://www.acmicpc.net/problem/21727)\n  * [BOJ 23052 두 트리](https://www.acmicpc.net/problem/23052)\n\n### LGV Theorem\n\n* 튜토리얼\n  * (영어) [miaowtin](https://codeforces.com/blog/entry/108395)\n  * (중국어) [OI-Wiki](https://oi-wiki.org/graph/lgv/)\n* 연습 문제\n  * [BOJ 19514 Intersection is Not Allowed!](https://www.acmicpc.net/problem/19514)\n  * [BOJ 21265 Ascending Matrix](https://www.acmicpc.net/problem/21265)\n\n### Voronoi Diagram, Dulaunay Triangulation\n\n* 연습 문제\n  * [BOJ 15695 Panda Preserve](https://www.acmicpc.net/problem/15695)\n  * [BOJ 21065 Friendship Circles](https://www.acmicpc.net/problem/21065)\n  * [BOJ 5401 Escape from the Minefield](https://www.acmicpc.net/problem/5401)\n  * [BOJ 18349 천지창조](https://www.acmicpc.net/problem/18349)\n\n## 그들만의 웰노운 문제 유형\n\n### 민코프스키 합 DP\n\n* 튜토리얼\n  * (한글) [arnold518](https://arnold518.tistory.com/72)\n* 연습 문제\n  * [BOJ 8987 수족관 3](https://www.acmicpc.net/problem/8987)\n  * [BOJ 17674 특별관광도시](https://www.acmicpc.net/problem/17674)\n  * [BOJ 18477 Jiry Matchings](https://www.acmicpc.net/problem/18477)\n\n### Regions Trick\n\n* 튜토리얼\n  * (한글) [jhnah917](https://github.com/justiceHui/SSU-SCCC-Study/blob/master/2022-winter-adv/slide/01.pdf) - 쿼리 캐싱 파트\n* 연습 문제\n  * [BOJ 12857 홍준이는 문자열을 좋아해](https://www.acmicpc.net/problem/12857)\n  * [BOJ 1762 평면그래프와 삼각형](https://www.acmicpc.net/problem/1762)\n  * [BOJ 25952 Rectangles](https://www.acmicpc.net/problem/25952)\n  * [BOJ 22316 Regions](https://www.acmicpc.net/problem/22316)\n  * [BOJ 25504 최적 경로와 쿼리](https://www.acmicpc.net/problem/25504)\n  * [BOJ 25505 공통 부분 문자열 쿼리](https://www.acmicpc.net/problem/25505)\n\n### Bulldozer Trick\n\n* 튜토리얼\n  * (한글) [jhnah917](https://github.com/justiceHui/SSU-SCCC-Study/blob/master/2022-winter-adv/slide/05.pdf)\n* 연습 문제\n  * [BOJ 9484 최대삼각형, 최소삼각형](https://www.acmicpc.net/problem/9484)\n  * [BOJ 16783 Bulldozer](https://www.acmicpc.net/problem/16783)\n  * [BOJ 17973 Quadrilaterals](https://www.acmicpc.net/problem/17973)\n  * [BOJ 17739 Constellation 2](https://www.acmicpc.net/problem/17739)\n  * [BOJ 17625 고압선](https://www.acmicpc.net/problem/17625)\n\n### 쿼리를 $\\sqrt N$ 또는 $\\sqrt Q$개씩 묶어서 처리하는 유형\n\n* 튜토리얼\n  * (한글) [jhnah917](https://github.com/justiceHui/SSU-SCCC-Study/blob/master/2022-winter-adv/slide/01.pdf) - 쿼리에 대한 버킷 파트\n* 연습 문제\n  * [BOJ 17635 다리](https://www.acmicpc.net/problem/17635)\n  * [BOJ 5823 코끼리](https://www.acmicpc.net/problem/5823)\n  * [BOJ 18254 쿼리와 쿼리](https://www.acmicpc.net/problem/18254)\n  * [BOJ 16793 Collapse](https://www.acmicpc.net/problem/16793)\n\n### 세그먼트 트리를 이용해 그래프의 간선 개수를 줄이는 유형\n\n* 튜토리얼\n  * (한글) [jhnah917](https://justicehui.github.io/tutorial/2020/09/05/graph-with-segment-tree/)\n* 연습 문제\n  * [BOJ 18193 비행기 타고 가요](https://www.acmicpc.net/problem/18193)\n  * [ARC 069 F Flags](https://atcoder.jp/contests/arc069/tasks/arc069_d)\n  * [BOJ 8274 Journeys](https://www.acmicpc.net/problem/8274)\n  * [BOJ 18362 Desert](https://www.acmicpc.net/problem/18362)\n\n### 볼록 다각형의 접선을 이용해 최적화하는 유형\n\n* 튜토리얼\n  * (한글) [jhnah917](https://github.com/justiceHui/SSU-SCCC-Study/blob/master/2022-autumn-adv/slide/05.pdf) - 볼록 다각형의 접선을 이용한 최적화 파트\n* 연습 문제\n  * [BOJ 15310 아티스트](https://www.acmicpc.net/problem/15310)\n  * [BOJ 5257 timeismoney](https://www.acmicpc.net/problem/5257)\n  * [BOJ 25009 뚫기](https://www.acmicpc.net/problem/25009)\n\n### 트리 위에서 exchange argument\n\n* 튜토리얼\n  * (한글) [koosaga](https://koosaga.com/349)\n  * (일본어) [maspy](https://maspypy.com/01-on-tree-%e4%ba%ac%e9%83%bd%e8%a6%b3%e5%85%89-train-seats)\n* 연습 문제\n  * [BOJ 9539 Escape](https://www.acmicpc.net/problem/9539)\n  * [BOJ 18596 Monster Hunter](https://www.acmicpc.net/problem/18596)\n  * [BOJ 17590 Prospecting](https://www.acmicpc.net/problem/17590)\n  * [BOJ 1763 트리 색칠](https://www.acmicpc.net/problem/1763)\n  * [AGC 023 F 01 on Tree](https://atcoder.jp/contests/agc023/tasks/agc023_f)\n\n## 그들만의 이상한 최적화\n\n### Fast I/O\n\n* 튜토리얼\n  * (한글) [cgiosy](https://cgiosy.github.io/posts/fast-io)\n* 연습 문제\n  * [BOJ 11921 0.1](https://www.acmicpc.net/problem/11921)\n  * [BOJ 18702 Array Queries](https://www.acmicpc.net/problem/18702) - 수열과 쿼리 28 + Fast I/O\n\n### Bitset을 이용한 최적화\n\n* 튜토리얼\n  * (영어) [Errichto](https://codeforces.com/blog/entry/73558)\n* 연습 문제\n  * [BOJ 20501 Facebook](https://www.acmicpc.net/problem/20501)\n  * [BOJ 9423 레슬링 팀 선발](https://www.acmicpc.net/problem/9423)\n  * [BOJ 9789 Friendship Graph](https://www.acmicpc.net/problem/9789) - $O(N^3/w)$\n  * [BOJ 23373 Jack the Mole](https://www.acmicpc.net/problem/23373) - $O(N^3W/w)$\n  * [BOJ 17184 Nautilus](https://www.acmicpc.net/problem/17184)\n  * [BOJ 18439 LCS 6](https://www.acmicpc.net/problem/18439)\n\n### SIMD\n\n* 튜토리얼\n  * (한글) [jhnah917](https://justicehui.github.io/hard-algorithm/2021/11/15/simd-in-ps/)\n* 연습 문제\n  * [BOJ 14438 수열과 쿼리 17](https://www.acmicpc.net/problem/14438) - $O(Q \\log N)$ vs $O(NQ/8)$\n  * [BOJ 3847 Comparing answers](https://www.acmicpc.net/problem/3847) - $O(N^2)$ vs $O(N^3/8)$\n  * [BOJ 13925 수열과 쿼리 13](https://www.acmicpc.net/problem/13925) - $O(Q \\log N)$ vs $O(NQ/8)$\n  * [BOJ 23577 Trio](https://www.acmicpc.net/problem/23577) - $O(81N^2)$ vs $O(N^3/96)$ vs $O(20000N^2/512)$\n\n### Barrett Reduction\n\n* 튜토리얼\n  * (영어) [Spheniscine](https://codeforces.com/blog/entry/75406)\n* 연습 문제\n  * [BOJ 17467 N! mod P (2)](https://www.acmicpc.net/problem/17467)\n\n## 그들만의 이상한 밈\n\n추가 예정\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FjusticeHui%2FUnknown-To-Wellknown","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FjusticeHui%2FUnknown-To-Wellknown","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FjusticeHui%2FUnknown-To-Wellknown/lists"}