940D - Alena And The Heater - CodeForces Solution


binary search implementation *1600

Please click on ads to support us..

Python Code:

n = int(input())
a = list(map(int, input().split()))
b = input()
 
minl = int(-1e9)
maxr = int(1e9)
 
for i in range(4, n):
  if not (b[i-4] == b[i-3] == b[i-2] == b[i-1] != b[i]):
    continue
    if b[i] == '0':
    maxr = min(maxr+1, a[i], a[i-1], a[i-2], a[i-3], a[i-4])-1
  if b[i] == '1':
    minl = max(minl-1, a[i], a[i-1], a[i-2], a[i-3], a[i-4])+1
 
print(minl, maxr)


Comments

Submit
0 Comments
More Questions

1244E - Minimizing Difference
1688A - Cirno's Perfect Bitmasks Classroom
219A - k-String
952A - Quirky Quantifiers
451B - Sort the Array
1505H - L BREAK into program
171E - MYSTERIOUS LANGUAGE
630D - Hexagons
1690D - Black and White Stripe
1688D - The Enchanted Forest
1674C - Infinite Replacement
712A - Memory and Crow
1676C - Most Similar Words
1681A - Game with Cards
151C - Win or Freeze
1585A - Life of a Flower
1662A - Organizing SWERC
466C - Number of Ways
1146A - Love "A"
1618D - Array and Operations
1255A - Changing Volume
1710C - XOR Triangle
415C - Mashmokh and Numbers
8A - Train and Peter
591A - Wizards' Duel
1703G - Good Key Bad Key
1705A - Mark the Photographer
1707A - Doremy's IQ
1706B - Making Towers
1325B - CopyCopyCopyCopyCopy