takeU

n = int(input()) mat = [] check = [] ans = [0, [0, 0]] direction = [[0, 1], [1, 1], [1, 0], [1, -1], [0, -1], [-1, -1], [-1, 0], [-1, 1]] flag = 0 for i in range(n): li = list(input()) for j in range(n): if li[j] == '.': check.append([i, j]) mat.append(li) for c in check: x, y = c count = 0 for d in direction: cur = 0 nx, ny = x, y while check: nx += d[0] ny += d[1] if not 0

from collections import deque n, m = map(int, input().split()) tree = [[0] * (n + 1) for _ in range(n + 1)] for _ in range(n - 1): x, y, d = map(int, input().split()) tree[x][y] = d tree[y][x] = d def bfs(start, end): q = deque([[start, 0]]) check = [0] * (n + 1) while q: s, d = q.popleft() if s == end: return d for i in range(1, n + 1): if tree[s][i] != 0 and check[i] == 0: check[i] = 1 q.appen..

from itertools import combinations n, m = map(int, input().split()) mat = [list(map(int, input().split())) for _ in range(n)] res = 0 for i in range(n): for j in range(m): if i < n - 3: res = max(res, sum([mat[i + k][j] for k in range(4)])) if j < m - 3: res = max(res, sum(mat[i][j:j + 4])) if i < n - 1 and j < m - 2: minus = 2000 com = list(combinations([[i, j], [i, j + 1], [i, j + 2], [i + 1, ..

n = int(input()) li = [] d = {} for _ in range(n): cur = list(input()) li.append(cur) for i in range(len(cur)): if cur[i] not in d: d[cur[i]] = [len(cur) - i, 10 ** (len(cur) - i - 1)] else: d[cur[i]][0] = len(cur) - i d[cur[i]][1] += 10 ** (len(cur) - i - 1) temp = sorted(map(list, d.items()), key=lambda x: (-x[1][1], -x[1][0])) for i in range(len(temp)): d[temp[i][0]] = 9 - i for i, l in enume..

import sys import heapq t = int(sys.stdin.readline()) for _ in range(t): n = int(sys.stdin.readline()) count = 0 li = [] while count check: heapq.heappush(min_h, cur) else: heapq.heappush(max_h, -cur) if i % 2 == 1: while len(max_h) != len(min_h): if len(max_h) > len(min_h): heapq.heappush(min_h, -heapq.heappop(max_h)) else: heapq.heappush(max_h, -heapq.heappop(min_h)) check = -max_h[0] else: wh..

import sys import heapq n = int(sys.stdin.readline()) max_h = [-int(sys.stdin.readline())] min_h = [] check = -max_h[0] print(check) for i in range(1, n): cur = int(sys.stdin.readline()) if cur > check: heapq.heappush(min_h, cur) else: heapq.heappush(max_h, -cur) if i % 2 == 1: while len(max_h) != len(min_h): if len(max_h) > len(min_h): heapq.heappush(min_h, -heapq.heappop(max_h)) else: heapq.he..

import math m, n = map(int, input().split()) check = [1 for i in range(n - m + 1)] for i in range(2, math.floor(n ** 0.5) + 1): num = m // i**2 while num * (i**2)

n, m, b = map(int, input().split()) ground = [] min_h, max_h, ans = 256, 0, [1e15, 256] for _ in range(n): cur = list(map(int, input().split())) min_h = min([min_h] + cur) max_h = max([max_h] + cur) ground.append(cur) for h in range(min_h, max_h + 1): s = 0 inv = b for i in range(n): for j in range(m): d = h - ground[i][j] if d > 0: s += d inv -= d else: s -= 2 * d inv -= d if 0 ans[1]): ans = [..

import sys import heapq t = int(sys.stdin.readline()) for _ in range(t): n = int(sys.stdin.readline()) min_h = [] max_h = [] check = [0] * n for i in range(n): command = sys.stdin.readline().split() if command[0] == 'I': heapq.heappush(min_h, (int(command[1]), i)) heapq.heappush(max_h, (-int(command[1]), i)) check[i] = 1 else: if command[1] == '1': while max_h and not check[max_h[0][1]]: heapq.h..

from collections import deque n, m = map(int, input().split()) board = [list(map(int, input().split())) for _ in range(m)] check = [[0] * n for _ in range(m)] dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] q = deque() ans = 0 for i in range(m): for j in range(n): if board[i][j] == 1: q.append([i, j, 0]) while q: x, y, count = q.popleft() ans = max(ans, count) for i in range(4): nx, ny = x + dx[i], y + dy..