[백준] 17140번 이차원 배열과 연산 파이썬

N

고민)

r, c, k = map(int, input().split())

arr = [list(map(int, input().split())) for _ in range(3)]

def r_cal(arr):
  cnt = [[0] * 101 for _ in range(len(arr))]
  
  for i in range(len(arr)):
    for num in arr[i]:
      cnt[i][num] += 1

  temp = []
  for x in range(len(arr)):
    for y in range(101):
      if cnt[x][y] != 0:
        if temp == []:
          temp.append(y)
          temp.append(cnt[x][y])
        if 

  arr = 
  if(len(arr) > 100):
    arr = arr[99:]
    
  return 
def c_cal():

def check(arr):
  row_len = len(arr)
  column_len = len(arr[0])

  if row_len >= column_len:
    return 'row'
  else:
    return "column"

    
t = 0
while(t =< 100):
  t += 1

  if check(arr) == 'row':
    r_cal()
  else:
    c_cal()
    
  if arr[r+1][c+1] == k:
    break

  if(t == 100):
    t = -1
    break
    

print(t)

 

17140번 이차원 배열과 연산

해답) 

arr = [[0]*101 for _ in range(101)]

r, c, k = map(int, input().split())
m_r, m_c = 3, 3
for i in range(1, 4):
    data = map(int, input().split())
    arr[i][1:4] = data

count = 0

def cal_r():
    global m_r, m_c
    r, c = m_r, m_c
    r_m_c = -1
    for i in range(1, r+1):
        data = arr[i][1:c+1]
        dict = {data[j]:data.count(data[j]) for j in range(len(data))}
        if 0 in dict.keys():
            dict.pop(0)
        tp = list(dict.items())
        tp.sort(key=lambda x:(x[1], x[0]))
        if len(tp) > 50:
            l = 50
        else:
            l = len(tp)

        r_m_c = max(r_m_c, l * 2)
        temp = []
        for t in range(l):
            a, b = tp[t]
            temp.append(a)
            temp.append(b)
        arr[i][1:l * 2] = temp
        for t in range(l*2+1, 101):
            arr[i][t] = 0
    m_c = r_m_c


def cal_c():
    global m_r, m_c
    r, c = m_r, m_c
    r_m_r = -1
    for i in range(1, c + 1):
        data = []
        for j in range(1, r+1):
            data.append(arr[j][i])
        dict = {data[j]: data.count(data[j]) for j in range(len(data))}
        if 0 in dict.keys():
            dict.pop(0)
        tp = list(dict.items())
        tp.sort(key=lambda x: (x[1], x[0]))
        if len(tp) > 50:
            l = 50
        else:
            l = len(tp)
        r_m_r = max(r_m_r, l * 2)
        temp = []
        for t in range(l):
            a, b = tp[t]
            temp.append(a)
            temp.append(b)
        for t in range(len(temp)):
            arr[t+1][i] = temp[t]
        for t in range(2*l+1, 101):
            arr[t][i] = 0
    m_r = r_m_r

while True:
    if count > 100:
        print(-1)
        break
    if arr[r][c] == k:
        print(count)
        break

    if m_r >= m_c:
        cal_r()
        count += 1
    else:
        cal_c()
        count += 1

 

출처 : https://www.acmicpc.net/problem/17140

17140번: 이차원 배열과 연산

참고 : https://developer-ellen.tistory.com/61

BOJ - 이차원 배열과 연산 17140번 (python)