- 博客(9)
- 资源 (1)
- 收藏
- 关注
原创 hdu 5883 The Best Path 欧拉回路(路径)
The Best Path Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 924 Accepted Submission(s): 383 Problem Description Alice is plann
2016-09-28 17:05:37 1633
原创 codeforces 716D. Complete The Graph 堆优化dij+暴力
D. Complete The Graph time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output ZS the Coder has drawn an undirected
2016-09-21 18:04:13 1038
原创 POJ 1149 PIGS 最大流
PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 20272 Accepted: 9255 Description Mirko works on a pig farm that consists of M locked pig-houses and
2016-09-16 18:46:27 512
原创 POJ 637 Sightseeing tour 混合欧拉回路 最大流
Sightseeing tour Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9114 Accepted: 3841 Description The city executive board in Lund wants to construct a si
2016-09-16 16:27:30 608
原创 hdu 3400 Line belt 三分
Line belt Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3930 Accepted Submission(s): 1528 Problem Description In a two-dimensi
2016-09-13 21:24:52 498
原创 hdu 5876 Sparse Graph 补图的最短路
Sparse Graph Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1138 Accepted Submission(s): 408 Problem Description In graph the
2016-09-12 17:18:03 537
原创 2016-2017 CT S03E01: Codeforces Trainings Season 3 Episode 1 J Wrong Answer 最大独立集
题意: 一个最大为2000*2000的矩阵,有h个横着的单词,v个竖着单词,横着的可能与竖着的有交叉,交叉的字符只能选其一放在格子内,问怎样选择才能使矩阵内单词的数量最多,输出最多有多少个。(注意同一行的单词不会有交叉) 解法:最大独立集,因为横着的与横着不会有交叉,竖着的没有,所以可以把横着的单词放在一边,竖着的放在另一边,横着的与竖着的交叉点是不同字母的进行连边。跑一遍二分匹配,每一个匹配
2016-09-11 21:43:02 1537
原创 codeforces 618D. Hamiltonian Spanning Tree
D. Hamiltonian Spanning Tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A group of n cities is connect
2016-09-09 20:25:43 775
原创 PowerOJ 1679: Drainage Ditches(网络流入门) 最大流模板
Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time t
2016-09-07 16:04:45 637
EasyCopy.zip
2024-08-09
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人