포럼
문제 ICPC00270

G. Gig Combinatorics

설명

Your friend Tóti is an aspiring musician. He has written \(n\) songs, each of which has a hype rating of either \(1\), \(2\), or \(3\). A higher hype rating means the song has more energy. Tóti is planning his first live performance and needs your help. He wants to know how many setlists he can make. A setlist consist of at least three songs, the first song must have hype rating \(1\), the last song must have hype rating \(3\), and all other songs must have hype rating \(2\). Tóti also wants to play the songs in the same order he wrote them.

Given the hype rating of each of Tóti's songs in the order he wrote them, how many setlists can he make?

제약
입력 형식

The first line of input consists of an integer \(n\) (\(1 \leq n \leq 10^6\)), the number of songs Tóti has written. The second line consists of \(n\) integers, each in \(\{1, 2, 3\}\), giving the hype ratings of the \(n\) songs in the order they were written.

출력 형식

Output the number of setlists Tóti can make. Since this number can be large, print it modulo \(10^9 + 7\).

예제 1
입력
9
1 1 1 2 2 2 3 3 3
출력
63
예제 2
입력
8
1 2 1 2 3 1 2 3
출력
15
문제 정보

생성자가 기록되지 않았습니다.

출처 ICPC NCPC 2020

평가 및 의견

G. Gig Combinatorics

개요
출제자 난이도 Unrated 레이팅 미적용 의견 0 / 1 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

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

풀이 제출

G. Gig Combinatorics

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