- 博客(4)
- 收藏
- 关注
原创 B. Preparing for Merge Sort(二分)
2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)B. Preparing for Merge Sort time limit per test2 seconds memory limit per
2017-09-21 21:25:23 575
原创 spfa模板
#include using namespace std; const int maxn = 1e4 + 5; int inf = 1e9 + 7; vector G[maxn],cost[maxn]; queue seq; int n,m,dis[maxn],vis[maxn]; void spfa(int x){ for(int i = 1;i <= n;i++) dis[i]
2017-09-15 21:46:43 168
原创 At.beginner.073 D - joisino's travel (floyd + 全排列)
D - joisino’s travel Time limit : 2sec / Memory limit : 256MBScore : 400 pointsProblem Statement There are N towns in the State of Atcoder, connected by M bidirectional roads.The i-th road connects T
2017-09-15 20:52:57 284
原创 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 F.islands (强联通分量 + 缩点)
On the mysterious continent of Tamriel, there is a great empire founded by human.To develope the trade, the East Empire Company is set up to transport goods from place to place.Recently, the company wa
2017-09-14 22:26:03 336
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人