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

Cave Paintings

Platinum I 플래티넘 I
난이도
2s
시간 제한
256MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

Bessie has become an artist and is creating paintings of caves! Her current work
in progress is a grid of height \(N\) such that each row of the grid contains
exactly \(M\) squares (\(1\le N,M\le 1000\)). Each square is either empty, filled
with rock, or filled with water. Bessie has already painted the squares
containing rock, including the entire border of the painting. She now wants to
fill some empty squares with water such that if the painting were real, there
would be no net motion of water. Define the height of a square in the \(i\)-th row
from the top to be \(N+1-i\). Bessie wants her painting to satisfy the following
constraint:

Suppose that square \(a\) is filled with water. Then if there exists a path from
\(a\) to square \(b\) using only empty or water squares that are not higher than \(a\)
such that every two adjacent squares on the path share a side, then \(b\) is also
filled with water.

Find the number of different paintings Bessie can make modulo \(10^9+7\). Bessie
may fill any number of empty squares with water, including none or all.

Problem credits: Daniel Zhang

제약

SCORING

  • Test cases 1-5 satisfy \(N,M\le 10.\)
  • Test cases 6-15 satisfy no additional constraints.

Problem credits: Daniel Zhang

입력 형식

The first line contains two space-separated integers \(N\) and \(M\).

The next \(N\) lines of input each contain \(M\) characters. Each character is
either '.' or '#', representing an empty square and a square filled with rock,
respectively. The first and last row and first and last column only contain '#'.

출력 형식

A single integer: the number of paintings satisfying the constraint modulo
\(10^9+7\).

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

If a square in the second row is filled with water, then all empty squares must
be filled with water. Otherwise, assume that no such squares are filled with
water. Then Bessie can choose to fill any subset of the three horizontally
contiguous regions of empty squares in the third row. Thus, the number of
paintings is equal to \(1+2^3=9.\)

문제 정보

riseoj 작성

출처 올림피아드 > USACO > 2019-2020 > January > Platinum

태그

평가 및 의견

Cave Paintings

개요
출제자 난이도 Platinum I 플래티넘 I 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

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

풀이 제출

Cave Paintings

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