import sys import bisect N = int(sys.stdin.readline()) stones = list(map(int, sys.stdin.readline().split())) def find_list(stones): values = [] forward = [0]*N for i, stone in enumerate(stones): if not values: values += stone, forward[i] = len(values) continue if values[-1] < stone: values += stone, forward[i] = len(values) continue idx = bisect.bisect_left(values, stone) values[idx] = stone for..

import sys P, N = map(int, sys.stdin.readline().split()) virus = list(map(int, sys.stdin.readline().split())) mul = P if len(virus) >= 2: for i in range(len(virus) - 2, -1, -1): virus[i] = (virus[i]*mul)%1000000007 mul = (mul*P)%1000000007 print(sum(virus)%1000000007)

O(N) algorithm import sys import bisect limits = [] test = [] N, M = map(int, sys.stdin.readline().split()) for i in range(N): limits += list(map(int, sys.stdin.readline().split())), for i in range(M): test += list(map(int, sys.stdin.readline().split())), for i in range(len(limits) - 1): limits[i + 1][0] += limits[i][0] for i in range(len(test) - 1): test[i + 1][0] += test[i][0] mx = 0 for end, ..

class Solution: def minimumMoves(self, s: str) -> int: idxs = [] for i, ch in enumerate(s): if ch == 'X': idxs += i, cnt = 0 while idxs: cur = idxs.pop(0) while idxs and cur + 2 >= idxs[0]: idxs.pop(0) cnt += 1 return cnt

import sys rows, cols = map(int, sys.stdin.readline().split()) grid = [] for _ in range(rows): grid += list(sys.stdin.readline()), wq = [] wvisited = set() rq = [] rvisited = set() for y in range(rows): for x in range(cols): if 'W' == grid[y][x]: wq += (y, x), wvisited.add((y, x)) elif '*' == grid[y][x]: rq += (y, x), rvisited.add((y, x)) cnt = 0 while wq: nrq = [] while rq: ry, rx = rq.pop(0) f..

def fill_outside(grid): q = [(0, 0)] # regard 0, 0 is empty cell while q: y, x = q.pop(0) grid[y][x] = 2 for oy, ox in [(0, 1), (0, -1), (1, 0), (-1, 0)]: ny = y + oy nx = x + ox if not (0