CPMagical CP Library

Problem solution · Python

Booking Concert Tickets in Groups

Booking Concert Tickets in Groups: a Python solution using segment tree or range structure. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Segment tree or range structure
Source
Kamyu LeetCode Solutions
Length
98 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Segment tree or range structure

For Booking Concert Tickets in Groups, the implementation stores interval information in a range-query data structure so updates and queries avoid rescanning the full input.

  1. Choose the aggregate stored for each interval or prefix.
  2. Build or initialize the structure from the input.
  3. Apply updates and combine the affected nodes to answer each query.

Code notes

  • 98 lines of Python from the credited upstream file booking-concert-tickets-in-groups.py.
  • The implementation visibly relies on sequence storage.
  • No explicit loop blocks detected.

Complexity

Count the build once, then multiply the logarithmic update or query path by the number of operations.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeBooking Concert Tickets in Groups · PythonPython
Use this to learn the idea, then write your own version.
# Time:  ctor:    O(n)#        gather:  O(logn)#        scatter: O(logn), amortized# Space: O(n) # Template:# https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/longest-substring-of-one-repeating-character.pyclass SegmentTree(object):    def __init__(self, N,                 build_fn=lambda _: float("inf"),                 query_fn=lambda x, y: y if x is None else x if y is None else min(x, y),                 update_fn=lambda x: x):        self.tree = [None]*(2*2**((N-1).bit_length()))        self.base = len(self.tree)//2        self.query_fn = query_fn        self.update_fn = update_fn        for i in xrange(self.base, self.base+N):            self.tree[i] = build_fn(i-self.base)        for i in reversed(xrange(1, self.base)):            self.tree[i] = query_fn(self.tree[2*i], self.tree[2*i+1])     def update(self, i, h):        x = self.base+i        self.tree[x] = self.update_fn(h)        while x > 1:            x //= 2            self.tree[x] = self.query_fn(self.tree[x*2], self.tree[x*2+1])     def query(self, L, R):        L += self.base        R += self.base        left = right = None        while L <= R:            if L & 1:                left = self.query_fn(left, self.tree[L])                L += 1            if R & 1 == 0:                right = self.query_fn(self.tree[R], right)                R -= 1            L //= 2            R //= 2        return self.query_fn(left, right)  # design, segment tree, binary searchclass BookMyShow(object):     def __init__(self, n, m):        """        :type n: int        :type m: int        """        self.__st = SegmentTree(n,                                build_fn=lambda _: [m]*2,                                query_fn=lambda x, y: y if x is None else x if y is None else [max(x[0], y[0]), x[1]+y[1]])        self.__m = m        self.__i = 0     def gather(self, k, maxRow):        """        :type k: int        :type maxRow: int        :rtype: List[int]        """        i = 1        if k > self.__st.tree[i][0]:            return []        while i < self.__st.base:            i = 2*i+int(self.__st.tree[2*i][0] < k)        if i-self.__st.base > maxRow:            return []        cnt = self.__st.tree[i][0]        c = self.__m-cnt        i -= self.__st.base        self.__st.update(i, [cnt-k]*2)        return [i, c]     def scatter(self, k, maxRow):        """        :type k: int        :type maxRow: int        :rtype: bool        """        cnt = self.__st.query(self.__i, maxRow)        if not cnt or cnt[1] < k:            return False        for i in xrange(self.__i, maxRow+1):            cnt = self.__st.tree[self.__st.base+i][1]            c = min(cnt, k)            cnt -= c            if not cnt:                self.__i += 1            self.__st.update(i, [cnt]*2)            k -= c            if not k:                break        return True

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗