RiseOJ는 solved.ac와 제휴 관계가 없습니다. 티어 아이콘 © solved.ac. solved.ac
포럼
USACO0273 파일 입출력

Why Did the Cow Cross the Road

Gold II 골드 II
난이도
2s
시간 제한
256MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

Why did the cow cross the road? Well, one reason is that Farmer John's farm
simply has a lot of roads, making it impossible for his cows to travel around
without crossing many of them.

FJ's farm is arranged as an \(N \times N\) square grid of fields
(\(3 \leq N \leq 100\)), with a set of \(N-1\) north-south roads and \(N-1\) east-west
roads running through the interior of the farm serving as dividers between the
fields. A tall fence runs around the external perimeter, preventing cows from
leaving the farm. Bessie the cow can move freely from any field to any other
adjacent field (north, east, south, or west), as long as she carefully looks
both ways before crossing the road separating the two fields. It takes her \(T\)
units of time to cross a road (\(0 \leq T \leq 1,000,000\)).

One day, FJ invites Bessie to visit his house for a friendly game of chess.
Bessie starts out in the north-west corner field and FJ's house is in the
south-east corner field, so Bessie has quite a walk ahead of her. Since she gets
hungry along the way, she stops at every third field she visits to eat grass
(not including her starting field, but including possibly the final field in
which FJ's house resides). Some fields are grassier than others, so the amount
of time required for stopping to eat depends on the field in which she stops.

Please help Bessie determine the minimum amount of time it will take to reach
FJ's house.

Problem credits: Brian Dean

제약

Problem credits: Brian Dean

입력 형식

The first line of input contains \(N\) and \(T\). The next \(N\) lines each contain
\(N\) positive integers (each at most 100,000) describing the amount of time
required to eat grass in each field. The first number of the first line is the
north-west corner.

출력 형식

Print the minimum amount of time required for Bessie to travel to FJ's house.

파일 입력 / 출력
이 문제는 표준 입출력을 사용하지 않습니다. 프로그램은 다음 파일을 읽고 써야 합니다:
입력을 읽을 파일 visitfj.in
출력을 쓸 파일 visitfj.out
예제 1
입력
4 2
30 92 36 10
38 85 60 16
41 13 5 68
20 97 13 80
출력
31
설명

The optimal solution for this example involves moving east 3 squares (eating the
"10"), then moving south twice and west once (eating the "5"), and finally
moving south and east to the goal.

문제 정보

riseoj 작성

출처 올림피아드 > USACO > 2016-2017 > February > Gold

태그

평가 및 의견

Why Did the Cow Cross the Road

개요
출제자 난이도 Gold II 골드 II 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.

풀이 제출

Why Did the Cow Cross the Road

게스트로 둘러보고 있습니다. 로그인하면 풀이를 제출하고 진행 상황을 확인할 수 있습니다. 로그인하고 제출하기
공개
C++20 Tab 들여쓰기 · Ctrl+/ 주석 토글 · Enter 자동 들여쓰기
1 1 1 0 공백: 4 · UTF-8