1974F - Cutting Game - CodeForces Solution


binary search brute force data structures implementation sortings two pointers

Please click on ads to support us..

Python Code:

import sys
input = sys.stdin.readline

for _ in range(int(input())):
    a, b, n, m = map(int, input().split())
    u, d, l, r = 1, a, 1, b
    s = []
    for i in range(n):
        x, y = map(int, input().split())
        s.append((x, y))
    z = []
    for i in range(m):
        c, k = input().strip().split()
        k = int(k)
        if c == 'U':
            u += k
        elif c == 'D':
            d -= k
        elif c == 'L':
            l += k
        else:
            r -= k
        z.append((u, d, l, r))
    alice = bob = 0
    for i in range(n):
        l, r = 0, m - 1
        while l <= r:
            mid = (l + r) // 2
            if z[mid][0] <= s[i][0] <= z[mid][1] and z[mid][2] <= s[i][1] <= z[mid][3]:
                l = mid + 1
            else:
                r = mid - 1
        if l != m:
            if l & 1:
                bob += 1
            else:
                alice += 1
    print(alice, bob)


Comments

Submit
0 Comments
More Questions

349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera