1973B - Cat Fox and the Lonely Array - CodeForces Solution

binary search bitmasks greedy math two pointers

Please click on ads to support us..

Python Code: 

for s in[*open(0)][2::2]:
 m=0
 for s in map(''.join,zip(*[f'{int(x):020b}'for x in s.split()])):m=max([m]+[*map(len,s.split('1'))]*('1'in s)) 
 print(m+1)


Comments

Submit
0 Comments
More Questions

99A - Help Far Away Kingdom
622B - The Time
1688C - Manipulating History
1169D - Good Triple
1675B - Make It Increasing
588A - Duff and Meat
1541B - Pleasant Pairs
1626B - Minor Reduction
1680A - Minimums and Maximums
1713A - Traveling Salesman Problem
1713B - Optimal Reduction
1710A - Color the Picture
1686B - Odd Subarrays
251A - Points on Line
427C - Checkposts
1159A - A pile of stones
508A - Pasha and Pixels
912A - Tricky Alchemy
1249A - Yet Another Dividing into Teams
1713C - Build Permutation
1699A - The Third Three Number Problem
1617B - GCD Problem
841A - Generous Kefa
1690B - Array Decrements
1692C - Where's the Bishop
104A - Blackjack
1438A - Specific Tastes of Andre
1711C - Color the Picture
1194C - From S To T
110B - Lucky String