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

Push a Box

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

의견: 0

설명

Bessie and her friends have invented a new game. The game is named accurately,
but not particularly creatively. They call it the "Push A Box Around The Barn To
Get It In The Right Spot And Don't Move The Hay" game (if you think that's
excessive, you should see some of the variable names the cows use when they
write code...)

The barn can be modeled as an \(N \times M\) rectangular grid. Some of the grid
cells have hay in them. Bessie occupies one cell in this grid, and a large
wooden box occupies another cell. Bessie and the box are not able to fit in the
same cell at the same time, and neither can fit into a cell containing hay.

Bessie can move in the 4 orthogonal directions (north, east, south, west) as
long as she does not walk into hay. If she attempts to walk to the space with
the box, then the box will be pushed one space in that direction, as long as
there is an empty cell on the other side. If there is no empty cell, then Bessie
will not be able to make that move.

A certain grid cell is designated as the goal. Bessie's goal is to get the box
into that location.

Given the layout of the barn, including the starting positions of the box and
the cow, and the target position of the box, determine if it possible to win the
game.

Note: This problem allows 512MB of memory usage, up from the default limit of 256MB.

Problem credits: Nathan Pinsker

제약

Problem credits: Nathan Pinsker

입력 형식

The first line has three numbers, \(N\), \(M\), and \(Q\), where \(N\) is the number of
rows in the grid and \(M\) is the number of columns.

  • \(1 \le N,M \le 1500\).
  • \(1 \le Q \le 50,000\).

On the next \(N\) lines is a representation of the grid, where characters
represent empty cells (.), hay (#), Bessie's starting position (A), and the
box's initial location (B).

This is followed by \(Q\) lines, each with a pair of integers \((R, C)\). For each
pair, you should determine if it is possible to get the box to that cell at row
\(R\), column \(C\), starting from the initial state of the barn. The top row is row
1, and the left column is column 1.

출력 형식

\(Q\) lines, each with either the string "YES" or "NO".

파일 입력 / 출력
이 문제는 표준 입출력을 사용하지 않습니다. 프로그램은 다음 파일을 읽고 써야 합니다:
입력을 읽을 파일 pushabox.in
출력을 쓸 파일 pushabox.out
예제 1
입력
5 5 4
##.##
##.##
A.B..
##.##
##.##
3 2
3 5
1 3
5 3
출력
NO
YES
NO
NO
설명

To push the box to the position (3, 5), the cow just needs to move 3 spaces to
the right.

None of the other three positions are attainable.

문제 정보

riseoj 작성

출처 올림피아드 > USACO > 2017-2018 > December > Platinum

태그

평가 및 의견

Push a Box

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

Log in to rate problems.

개별 의견

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

풀이 제출

Push a Box

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