Problems from Criterion 2021 Round 14
A. Locality-Sensitive Hashing IAccording to Wikipedia, Locality-Sensitive hashing (LSH) is an algorithmic technique that hashes sim... |
B. This Is Business“Why brother why…?” “This is Business …” You have started a cupcake factory where two types of cupca... |
C. Upside-DownIn this problem, you are given a tetrahedron in 333-dimensional space. A tetrahedron is defined as “... |
D. Binary RhodiumXenon is a great alchemist. Recently, he has decided to perform a special type of transmutation. But... |
E. HashingShreas has created a new revolutionary hashing function that calculates hash values of graphs. For a... |
F. Object DetectionObject detection is a computer vision technique that is used to identify and locate objects in an im... |
Practice Contest
Practice contests allow you to re-run contests and experience them as close as possible to the original run.
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
