---
tags: note
---

# Problem List

[TOC]

---

## Untagged

## Binary search

- [x] [DDJ - a291. 42! 42! 42!](http://203.64.191.163/ShowProblem?problemid=a291)

## Mathematics

- [x] [DDJ - a290. 兩個陣列問題](http://203.64.191.163/ShowProblem?problemid=a290)

## Randomized algorithm

- [x] [DDJ - a106. pC 退化的三角形](http://203.64.191.163/ShowProblem?problemid=a106)

## Implementation

### Linked list

- [ ] [DDJ - a793 動態區間第 k 小](http://203.64.191.163/ShowProblem?problemid=a793)

## Divide & Conquer

### CDQ optimization

- [x] [ZJ - c571 三維偏序問題](https://zerojudge.tw/ShowProblem?problemid=c571)

## DP

### Complex implementation

- [x] [2014 ACM-ICPC Vietnam National Second Round - pJ Math Magic](https://codeforces.com/gym/100541/problem/J)
- [x] [DDJ - a644. Explooooooooooooosion!](http://203.64.191.163/ShowProblem?problemid=a644)

### Li Chao tree optimization

- [x] [AtCoder Educational DP Contest - pZ Frog 3](https://atcoder.jp/contests/dp/tasks/dp_z)
- [x] [CSES - Monster Game I](https://cses.fi/problemset/task/2084)
- [x] [CSES - Monster Game II](https://cses.fi/problemset/task/2085)

### Knuth optimization

- [ ] [CSES - Knuth Division](https://cses.fi/problemset/task/2088)

### Tree / DAG DP

- [x] [AtCoder Educational DP Contest - pV Subtree](https://atcoder.jp/contests/dp/tasks/dp_v)
- [x] [AtCoder Educational DP Contest - pP Independent Set](https://atcoder.jp/contests/dp/tasks/dp_p)
- [x] [DDJ - a159. 樹的高度 - 進階](http://203.64.191.163/ShowProblem?problemid=a159)
- [x] [CSES - Finding a Centroid](https://cses.fi/problemset/task/2079)

### Bitmask DP

- [x] [AtCoder Educational DP Contest - pU Grouping](https://atcoder.jp/contests/dp/tasks/dp_u)

### Binary Lifting DP
- [x] [AtCoder Educational DP Contest - pR Walk](https://atcoder.jp/contests/dp/tasks/dp_r)

## Mo's algorithm

- [x] [CSES - Distinct Values Queries](https://cses.fi/problemset/task/1734/)
- [x] [CSES - Distinct Colors](https://cses.fi/problemset/task/1139/)

## Tree

### Flattening

- [x] [CSES - Path Queries](https://cses.fi/problemset/task/1138)

### Heavy-light decomposition

- [x] [CSES - Path Queries II](https://cses.fi/problemset/task/2134/)

### Centroid decomposition

- [x] [CSES - Fixed-Length Paths I](https://cses.fi/problemset/task/2080)
- [x] [CSES - Fixed-Length Paths II](https://cses.fi/problemset/task/2081)

## Graph

### BFS/DFS

- [x] [CSES - Planets Cycles](https://cses.fi/problemset/task/1751)
- [x] [AtCoder - abc284 E - Count Simple Paths](https://atcoder.jp/contests/abc284/tasks/abc284_e)

### Binary jumping

- [x] [CSES - Planets Queries II](https://cses.fi/problemset/task/1160)

### Euler paths / circuits

- [x] [CSES - Mail Delivery](https://cses.fi/problemset/task/1691)
- [x] [CSES - Teleporters Path](https://cses.fi/problemset/task/1693/)

### Shortest path

- [x] [2016 ACM-ICPC Pacific NW Regional Contest - pB Buggy Robot](https://codeforces.com/gym/101201/problem/B)
- [x] [CSES - Flight Routes](https://cses.fi/problemset/task/1196)
- [x] [CSES - Investigation](https://cses.fi/problemset/task/1202)

### Cycle finding

- [ ] [DDJ - a786. SPFA (Shortest-Path-Faster-Algorithm)](http://203.64.191.163/ShowProblem?problemid=a786)

### Biconnected component

- [x] [CSES - Necessary Roads](https://cses.fi/problemset/task/2076/)
- [x] [CSES - Necessary Cities](https://cses.fi/problemset/task/2077/)

### Strongly connected component

- [x] [CSES - Coin Collector](https://cses.fi/problemset/task/1686)

### 2-sat

- [x] [2016 ACM-ICPC Pacific NW Regional Contest - pF Illumination](https://codeforces.com/gym/101201/problem/F)

### Warnsdorff's algorithm

- [x] [CSES - Knight's Tour](https://cses.fi/problemset/task/1689/)

### Flow

#### Maxflow / Mincut

- [x] [CSES - Download Speed](https://cses.fi/problemset/task/1694)
- [x] [CSES - Police Chase](https://cses.fi/problemset/task/1695)
- [x] [CSES - School Dance](https://cses.fi/problemset/task/1696)
- [x] [CSES - Distinct Routes](https://cses.fi/problemset/task/1711)
- [x] [Luogu - P2756 飞行员配对方案问题](https://www.luogu.com.cn/problem/P2756)
- [x] [Luogu - P2762 太空飞行计划问题](https://www.luogu.com.cn/problem/P2762)
- [x] [Luogu - P2763 试题库问题](https://www.luogu.com.cn/problem/P2763)
- [x] [Luogu - P4015 运输问题](https://www.luogu.com.cn/problem/P4015)

#### MCMF

- [x] [CSES - Parcel Delivery](https://cses.fi/problemset/task/2121/)
- [x] [CSES - Task Assignment](https://cses.fi/problemset/task/2129/)
- [x] [Luogu - P1251 餐巾计划问题](https://www.luogu.com.cn/problem/P1251)

## Geometry

### Basics

- [x] [CSES - Polygon Area](https://cses.fi/problemset/task/2191/)
- [x] [CSES - Line Segment Intersection](https://cses.fi/problemset/task/2190/)
- [x] [CSES - Minimum Euclidean Distance](https://cses.fi/problemset/task/2194/)
- [x] [CSES - Point in Polygon](https://cses.fi/problemset/task/2192)

### Pick's theorem

- [x] [CSES - Polygon Lattice Points](https://cses.fi/problemset/task/2193)

### Li Chao tree

- [x] [VJudge - Blue Mary开公司](https://vjudge.net/problem/%E9%BB%91%E6%9A%97%E7%88%86%E7%82%B8-1568)
- [x] [VJudge - Segment](https://vjudge.net/problem/%E9%BB%91%E6%9A%97%E7%88%86%E7%82%B8-3165)

### Convex Hull

- [x] [2016 ACM-ICPC Pacific NW Regional Contest - pL Windy Path](https://codeforces.com/gym/101201/problem/L)

## Data Structure

### Mergeable heap

- [x] [Luogu - 左偏树（可并堆）](https://vjudge.net/solution/42537407/yNmw0S6KVDkFkcxB5Ntv)

### Treap

- [x] [CSES - Cut and Paste](https://cses.fi/problemset/task/2072)
- [x] [CSES - Substring Reversals](https://cses.fi/problemset/task/2073)
- [x] [CSES - Reversals and Sums](https://cses.fi/problemset/task/2074)

### Monotone stack

- [x] [CSES - Increasing Array Queries](https://cses.fi/problemset/result/4399372/)

### Persistent treap

- [x] [2012 ACM-ICPC Asia Hatyai Regional Programming Contest - pE Version Controlled IDE](https://codeforces.com/gym/101549/problem/E)

### Segment tree beats

- [x] [Library Checker - Range Chmin Chmax Add Range Sum](https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum)

### Time segment tree

- [x] [TIOJ - 1903【Gate】這個笑容由我來守護 - EXTREME](https://tioj.ck.tp.edu.tw/problems/1903)
- [x] [Codeforces 813F. Bipartite Checking](https://codeforces.com/contest/813/problem/F)
- [x] [CSES - Dynamic Connectivity](https://cses.fi/problemset/task/2133/)