ConvexHull Problems
Cover the Points You are given a set of points P, and a set of target points M in 2D space. For each point M[i] in M,... |
Sticking Pins You are sticking pins on a 2D board at N given coordinates. However, since you are not very good at ... |
The Wall A long time ago in a galaxy far, far away, there lived two groups of people named Stormtroopers and ... |
RAD! In the year 3333, earthly scientists discovered a massive star has blast in a nearby galaxy. Dangero... |
Bikpik Colony Bikpiks are very small aliens. Day by day they are becoming very dangerous for human being. They liv... |
Hizitizi's Array Cutting Hizitizi is a new character in our story. In every episode, he gets a task to do from his imaginary ... |
Tags
2Sat, Adhoc, ApolloneasTheorem, Backtracking, BFS, Bignum, BinarySearch, BipartiteMatching, Bitmask, BruteForce, ChineseRemainderTheorem, Combinatorics, ConvexHull, CutVertex, DataStructure, DFS, DigitDP, DisjointSets, DivideAndConquer, DP, Eertree, EulerTour, ExpectedValue, FenwickTree, FFT, Flow, Game, GCD, Geometry, Graph, Greedy, Hashing, HeavyLightDecomposition, Implementation, InclusionExclusion, Interactive, KnuthMorrisPratt, LowestCommonAncestor, Math, Matrix, MatrixExponentiation, MergeSortTree, ModularExponentiation, MOSAlgorithm, MST, NTT, NumberTheory, Parsing, PersistentLiChaoTree, PersistentSegmentTree, PollardRho, PriorityQueue, Probability, Queue, RabinMiller, RangeOrderStatistics, Scheduling, SegmentTree, ShortestPath, Simulation, Sorting, SparseTable, SpragueGrundyTheorem, SqrtDecomposition, Stack, String, StronglyConnectedComponents, SuffixStructure, TernarySearch, Tree, Trie, TwoPointer, WaveletTree
