1100 : Spanning Trees
- 时间限制Time Limit
- 1 秒Sec
- 内存限制Memory Limit
- 128 兆MB
- 提交次数Submitted
- 11 次Times
- 通过次数Solved
- 9 次Times
各语言实际时限 Time Limits by Language
| C / C++ | 1 s |
|---|---|
| Java / Python3 / Kotlin |
3 s
1s + 2s
|
全局时限上限:30 s(补偿后超出截断) Global time cap: 30 s (after allowances)
各语言实际内存 Memory Limits by Language
| C / C++ | 128 MB |
|---|---|
| Java / Kotlin |
640 MB
128 + 512 MB · 含 JVM
128 + 512 MB · JVM
|
| Python3 |
640 MB
128 + 512 MB
|
全局内存上限:2048 MB(补偿后超出截断) Global memory cap: 2048 MB (after allowances)
标准评测 Standard
从标准输入读入,结果写到标准输出。评测将输出拆成 token,与标准答案逐项比较,不按整段逐字节比对。
Read from standard input and write to standard output. The judge splits the output into tokens and compares them with the official answer; it does not compare raw bytes.
| 比对Compare | token 相同即通过。中间的空格、制表符、换行可多可少。Matching tokens pass. Extra spaces, tabs, or newlines between them are ignored. |
|---|---|
| 不同则错Differs | token 个数或内容不同即错误。23 与 2 3、02 与 2、2.0 与 2 均视为不同。A different token count or value is wrong. 23 vs 2 3, 02 vs 2, and 2.0 vs 2 all differ. |
| 输入Input | 标准输入,格式见题面。Standard input; format as in the statement. |
| 输出Output | 标准输出。Standard output. |
| 时间与内存Time and memory | 记这一份程序的 CPU 时间和内存峰值。题目上的时间限制、内存限制就是这一份的上限。The record is this program’s CPU time and peak memory. The limits on the problem apply to this one run. |
题目描述Description
Bobo has a string s1…sn consisting of zeros and ones, and he constructs an undirected graph G with n vertices v1, …, vn. In the graph G, an edge between the vertices vi and vj if and only if i < j and sj = 1.
Find the number of spanning trees of the graph G modulo (109 + 7).
输入格式Input
The input consists of several test cases terminated by end-of-file.
The first line of each test case contains an integer n, and the second line contains a string s1…sn.
- 1 ≤ n ≤ 105
- si ∈ {0, 1}
- sn − 1 = 1
- The sum of n does not exceed 106.
输出格式Output
For each test case, print an integer which denotes the result.
样例Sample
出题Author
ftiasch
来源Source
湖南省第十六届大学生计算机程序设计竞赛(HNCPC2020)
题目到此结束End of problem