SegmentTree Problems
Straightforward No gossip. In this problem I will just say what to do. Initially, you will be given a bracket sequen... |
Palindrome and Queries You'll be given an array A of N strings containing lowercase English letters only and Q queries. In ... |
Maximum Meetings I am the boss of my company. I have n employees. The office time of my company starts at 1. Every em... |
Donate Our Department We are students of CSE, IU. It is very well known that our departmental instruments are not so good.... |
Stick Game Shahwat has a stick that has n blocks that are indexed from 1 to n (from first to last). Each block ... |
Bored?? "Avoid touching your face, particularly your eyes, nose or mouth to prevent the virus from entering ... |
Paltu, a Prime Lover Note that the memory limit is unusual. Paltu is a good programmer and he loves prime numbers. One da... |
Exists or Not Exists You will be given some numbers. Then there will contain some queries. In every query there will be g... |
Birthday Present Today is problem setter's best friend Jenny’s birthday. Long ago, Jenny, being a very clever girl, a... |
Escape Plan Hey, you are stuck on prison and you have to get out soon. This prison has one way road and you can ... |
Path Intersection Extended Do you remember the problem from ICPC Dhaka Regional 2018 named $Path$ $Intersection$ by Md. Imran B... |
Change Queries Today is a very special day for Rubel. Recently he got a job in a software company. Now today is the... |
GCD and Sum Congratulations! You’ve been hired in “Buggy Software Ltd.” And you’ve been already given your first... |
Protik and Hill Climbing Who doesn't want to save a mother? Like everyone, Protik was finding a way to earn some money (he h... |
Nothing Is Absolute, Everything Is Relative! You are given an integer array, A[] of size N, and an integer M. Then you have to perform a total of... |
Maximum Distance You know it’s hard seeing your favorite person being interested in another one instead of you. At th... |
Subsequence Fight You are given an array a1,a2,…,an consisting of n distinct integers and an integer k. You can cho... |
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
