Problems from DIU Unlock the Algorithm Programming Contest Spring -24 [Preliminary - D Slot]
These problems are from a contest organized by Daffodil International University - Department of CSE on See details...
Standings
A.
The Enchanted Forest Adventure In the heart of the Whispering Woods, there lay an enchanted forest known only to a few. This forest... |
B.
Hard Summation!!! Neha, a skilled witch, has set out on a risky quest to defeat a mighty jinn. To ensure her victory, ... |
C.
First XI The stage is set for one of the biggest football matches: Brazil vs. Argentina! You've been chosen a... |
D.
Hard Search You must already be very familiar with the popular searching algorithm, “Hard Search”. This is the a... |
E.
Moo's Coin Conundrum Ambani and Bobita are two special cows who live in the town of Cowville. They are on a quest to coll... |
F.
Another easy problem. Imagine you're given a detailed grid showing a country's landscape, with 0’s denoting vast water bod... |
G.
Unification. You have two countries, each with many cities connected by roads. These countries have a magical rul... |
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
