루미 알고리즘

#1550골드Mountain Range

PO 2022 학교 예선코딩출제 Nils Gustafsson영어 원문이 문제가 어렵다면 — 배우는 순서 보기

영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)

Problem

(그림은 원문 저장소에서 볼 수 있습니다)

Two possible distributions of heights consistent with example 1.

Torunn lives in a mountainous residential area consisting of an n × m grid with one plot in each cell. Torunn lives in the cell at the top-left corner of the grid. Unfortunately, a particularly troublesome tenant has recently moved in, so Torunn has decided to sell her property and move elsewhere. However, she first needs to find out how much her property is worth.

Each cell in the grid has a height. All heights are unique, so for simplicity, let's assume the heights are 1, 2, 3, …, n · m. Plots with higher heights are worth more on the housing market, so Torunn wants to determine the height of her plot. She has therefore gone around to each cell in the grid and checked how many adjacent cells have lower heights. A cell is considered adjacent if it shares a side (cells not on the edge of the grid have 4 adjacent cells).

Write a program that, given the information Torunn collected, finds the minimum and maximum possible height of her plot.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 8), the number of rows and columns in the grid.

The following n lines each contain a string of length m. This grid represents the information Torunn collected; each digit corresponds to the number of adjacent cells that have a lower height than the cell with that digit. It is guaranteed that there is at least one way to assign the heights 1, 2, …, n · m to the cells such that the collected information is correct. Note that the values collected will always be between 0 and 4.

Output

Output two integers, the minimum and maximum possible height of the cell in the top-left corner.

Scoring

Your solution will be tested on a set of test groups, each worth a number of points. Each test group contains a set of test cases. To get the points for a test group you need to solve all test cases in the test group.

GroupPointsConstraints
120n = 1
220n = m ≤ 3
320n = m ≤ 4
440No additional constraints.

예제

예제 1

입력
2 3
122
101
출력
3 4

예제 2

입력
1 4
0111
출력
1 1

출처 표기

출처: Programmeringsolympiaden 2022년 학교 예선 · 원문 페이지 · 이용 조건 CC BY-SA · LaTeX 원문을 화면용 글로 옮겼습니다(수식·표의 모양이 다를 수 있습니다). 내용은 고치지 않았습니다.

크리에이티브 커먼즈 저작자표시-동일조건변경허락.

문제 출처: 한국정보올림피아드(KOI) (CC BY-NC-SA 4.0) · International Olympiad in Informatics (IOI) (CC BY) · Centre for Education in Mathematics and Computing (CEMC), University of Waterloo (CC BY-NC 4.0) · Programmeringsolympiaden (CC BY-SA) · CSES Problem Set (Antti Laaksonen) (CC BY-NC-SA 4.0). 루미 알고리즘은 위 단체들과 관계없는 별도의 서비스이며, 자료는 원문 그대로 싣습니다. 문제마다 출처와 이용 조건을 따로 표기합니다.