Leetcode heroes

завтрашний дейлик https://leetcode.com/problems/robot-collisions class Solution: def survivedRobotsHealths(self, p: List[int], h: List[int], d: str) -> List[int]: s=setitem;q=[];[*map((f:=lambda i:q.append(i)if'L'<d[i]else(q and h[i]and(a:=h[q[-1]],b:=h[i],s(h,q[-1]if a>b else q.pop(),(a>b)*~-a),s(h,i,(a<b)*~-b),f(i)))),sorted(range(len(p)),key=p.__getitem__))];return[*filter(None,h)]