- 博客(7)
- 收藏
- 关注
原创 ceoi 2017 One-Way Streets
题目描述 Once upon a time there was a country with n cities and m bidirectional roads connecting them. Technical development led to faster and larger road vehicles which presented a problem—the roads we...
2018-09-01 01:08:57
513
3
原创 ceoi 2017 Building Bridges
题目描述 A wide river has n pillars of possibly different heights standing out of the water. They are arranged in a straight line from one bank to the other. We would like to build a bridge that uses the...
2018-09-01 00:55:30
406
原创 DTOI 3523 环线(tour)
来自 FJWC 2018 Day5 以下为题解对于 30% 的数据, n<=4 0,k<=1000 。计算每个点在第 1 – k-1步到每个点 步到每个点 的方法数 ,将所有自环(回到己)的方案统计起来。 O(n^3*k) 对于 60% 的数据, n<=80 ,k<=10^6 。 计算每个点在第 1 – k-1步到每个点的方法数 ,使用 ,使用 矩阵乘法快速幂 ...
2018-08-28 14:33:41
263
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人