ORDERSET - Order statistic set
In this problem, you have to maintain a dynamic set of numbers which support the two fundamental operations
- INSERT(S,x): if x is not in S, insert x into S
- DELETE(S,x): if x is in S, delete x from S
and the two type of queries
- K-TH(S) : return the k-th smallest element of S
- COUNT(S,x): return the number of elements of S smaller than x
- Line 1: Q (1 ≤ Q ≤ 200000), the number of operations
- In the next Q lines, the first token of each line is a character I, D, K or C meaning that the corresponding operation is INSERT, DELETE, K-TH or COUNT, respectively, following by a whitespace and an integer which is the parameter for that operation.
If the parameter is a value x, it is guaranteed that 0 ≤ |x| ≤ 109. If the parameter is an index k, it is guaranteed that 1 ≤ k ≤ 109.
For each query, print the corresponding result in a single line. In particular, for the queries K-TH, if k is larger than the number of elements in S, print the word 'invalid'.
Input 8 I -1 I -1 I 2 C 0 K 2 D -1 K 1 K 2 Output 1 2 2 invalid
compression + BIT + binary search ~ O(n log^2(n)) got AC ^^
Spent a day implementing the augmented red-black tree on CLRS, good problem!
Use tree policy [for C++ coders].
ios_base:: sync_with_stdio(false); cin.tie(0);
Had to replace cout with printf to get rid of TLE.
confirmed! I fell in love with BIT <3
After solving this , You will fall in love with BIT....
C++ 14 (AC) runs a bit faster than C++ 5.1 (TLE). But crazy time-limit makes coding less fun. 1s is quite good.
cordination compression+BIT+Binary search!!!!!..........AC
coordinate compresion + segment tree + unordered_map = accepted!