난이도: MediumProblem DescriptionYou are given a 2D integer grid of size m x n and an integer x. In one operation, you can add x to or subtract x from any element in the grid. A uni-value grid is a grid where all the elements of it are equal. Return the minimum number of operations to make the grid uni-value. If it is not possible, return -1.  Problem ExampleExample 1:Input: grid = [[2,4],[6,8]], x..

난이도: MediumProblem DescriptionYou are given an integer n representing the dimensions of an n x n grid, with the origin at the bottom-left corner of the grid. You are also given a 2D array of coordinates rectangles, where rectangles[i] is in the form [startx, starty, endx, endy], representing a rectangle on the grid. Each rectangle is defined as follows:(startx, starty): The bottom-left corner of..

난이도: MediumProblem DescriptionYou are given a positive integer days representing the total number of days an employee is available for work (starting from day 1). You are also given a 2D array meetings of size n where, meetings[i] = [start_i, end_i] represents the starting and ending days of meeting i (inclusive). Return the count of days when the employee is available for work but no meetings a..

난이도: MediumProblem Description You are in a city that consists of n intersections numbered from 0 to n - 1 with bi-directional roads between some intersections. The inputs are generated such that you can reach any intersection from any other intersection and that there is at most one road between any two intersections. You are given an integer n and a 2D integer array roads where roads[i] = [ui,..

BOJ 16236. 아기 상어https://www.acmicpc.net/problem/16236 내 코드import sysfrom collections import dequeinput = sys.stdin.readlinen = int(input())area = []for i in range(n): area.append(list(map(int, input().split()))) for j in range(n): if area[i][j] == 9: start = (i, j) area[i][j] = 0def bfs(start, size): visited = [[0]*n for _ in range(n)] q = deque([start]) ..

BOJ 11660. 구간 합 구하기 5https://www.acmicpc.net/problem/11660  내 코드import sysinput = sys.stdin.readlinen, m = map(int, input().split())board = [list(map(int, input().split())) for _ in range(n)]for i in range(n): for j in range(n): if i == 0 and j == 0: continue elif j == 0: board[i][j] += board[i-1][-1] else: board[i][j] += board[i][j-1]for ..