takeU

import sys input = sys.stdin.readline n, m = map(int, input().split()) graph = [list(map(int, input().split()))[1:] for _ in range(n)] selected = [-1] * (m + 1) def bimatch(num): if visited[num]: return False visited[num] = 1 for g in graph[num]: if selected[g] == -1 or bimatch(selected[g]): selected[g] = num return True return False for _ in range(2): for i in range(n): visited = [0] * n bimatc..

import sys input = sys.stdin.readline n, m = map(int, input().split()) graph = [list(map(int, input().split()))[1:] for _ in range(n)] selected = [-1] * (m + 1) def bimatch(num): if visited[num]: return False visited[num] = 1 for g in graph[num]: if selected[g] == -1 or bimatch(selected[g]): selected[g] = num print(selected) return True return False for i in range(n): visited = [0] * n bimatch(i..

import sys input = sys.stdin.readline n = int(input()) li = [] for i in range(n): li.append([int(input()), i]) sorted_li = sorted(li) ans = 0 for i in range(n): ans = max(ans, sorted_li[i][1] - li[i][1]) print(ans + 1) 정렬

n = int(input()) li = list(map(int, input().split())) ans, stack = [-1] * n, [] count = {0: 0} for l in li: if l in count: count[l] += 1 else: count[l] = 1 stack.append(0) for i in range(1, n): while stack and count[li[stack[-1]]] < count[li[i]]: ans[stack.pop()] = li[i] stack.append(i) print(*ans) 스택

import sys input = sys.stdin.readline def interval_sum(start, end, index, left, right): if left > end or right end: return tree[index] += ..

n, m = map(int, input().split()) board = [list(map(int, input().split())) for _ in range(n)] prefix_sum = [[0] * (m + 1) for _ in range(n + 1)] for i in range(1, n + 1): for j in range(1, m + 1): prefix_sum[i][j] = prefix_sum[i - 1][j] + prefix_sum[i][j - 1] + \ board[i - 1][j - 1] - prefix_sum[i - 1][j - 1] def acc(mat, x1, y1, x2, y2): return mat[x2][y2] - mat[x1 - 1][y2] - mat[x2][y1 - 1] + m..

from heapq import heappop, heappush import sys input = sys.stdin.readline n, m = map(int, input().split()) indegree = [0] * (n + 1) graph = [[] for _ in range(n + 1)] for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) indegree[b] += 1 def topological_sort(): ans = [] h = [] for i in range(1, n + 1): if indegree[i] == 0: heappush(h, i) while h: cur = heappop(h) ans.append(cur)..

n = int(input()) li = list(map(int, input().split())) if len(li) == 1: print('A') elif len(set(li)) == 1: print(li[0]) elif len(li) == 2: print('A') else: a = (li[1] - li[2]) // (li[0] - li[1]) if (li[0] - li[1]) else 0 b = li[1] - li[0] * a for i in range(n - 1): if (li[i + 1] != li[i] * a + b): print('B') exit() print(li[-1] * a + b) 수학

def itots(c): if '0'

def check(): for i in range(n): if a[i] != b[i]: return False return True n, m = map(int, input().split()) a = [list(map(int, list(input()))) for _ in range(n)] b = [list(map(int, list(input()))) for _ in range(n)] ans = 0 for i in range(n - 2): for j in range(m - 2): if a[i][j] != b[i][j]: for x in range(i, i + 3): for y in range(j, j + 3): a[x][y] ^= 1 ans += 1 print(ans if check() else '-1') 구현