Fork me on github

09 2018 档案

hdu 6318 Swaps and Inversions （线段树求逆序对数）
摘要：Swaps and Inversions Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2787 Accepted Submission(s): 阅读全文
posted @ 2018-09-27 21:09 acboyty 阅读(161) 评论(0) 推荐(0)
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 D 80 Days （线段树查询最小值）
摘要：题目4 : 80 Days 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 80 Days is an interesting game based on Jules Verne's science fiction "Around the World in Eighty 阅读全文
posted @ 2018-09-25 22:37 acboyty 阅读(217) 评论(0) 推荐(0)
hdu 6299 Balanced Sequence （贪心）
摘要：Balanced Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6311 Accepted Submission(s): 16 阅读全文
posted @ 2018-09-20 23:31 acboyty 阅读(143) 评论(0) 推荐(0)
hdu 6308 Time Zone （模拟+字符串处理）
摘要：Time Zone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4337 Accepted Submission(s): 1278 Probl 阅读全文
posted @ 2018-09-20 23:20 acboyty 阅读(194) 评论(0) 推荐(0)
hdu 6301 Distinct Values （贪心）
摘要：Distinct Values Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4915 Accepted Submission(s): 1680 阅读全文
posted @ 2018-09-20 23:11 acboyty 阅读(101) 评论(0) 推荐(0)
hdu 6298 Maximum Multiple （简单数论）
摘要：Maximum Multiple Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3313 Accepted Submission(s): 138 阅读全文
posted @ 2018-09-15 23:18 acboyty 阅读(121) 评论(0) 推荐(0)
ACM-ICPC 2018 南京赛区网络预赛 L. Magical Girl Haze （分层dijkstra）
摘要：There are NN cities in the country, and MMdirectional roads from uu to v(1\le u, v\le n)v(1≤u,v≤n). Every road has a distance c_ici​. Haze is a Magica 阅读全文
posted @ 2018-09-15 23:03 acboyty 阅读(280) 评论(0) 推荐(0)
hdu 4725 The Shortest Path in Nya Graph （最短路+建图）
摘要：The Shortest Path in Nya Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11694 Accepted Sub 阅读全文
posted @ 2018-09-14 19:53 acboyty 阅读(186) 评论(0) 推荐(0)
poj 1062 昂贵的聘礼 （有限制的最短路）
摘要：昂贵的聘礼 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 56594 Accepted: 17083 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用1000 阅读全文
posted @ 2018-09-14 00:05 acboyty 阅读(160) 评论(0) 推荐(0)
poj 1511 Invitation Cards （最短路）
摘要：Invitation Cards Time Limit: 8000MS Memory Limit: 262144K Total Submissions: 33435 Accepted: 11104 Description In the age of television, not many peop 阅读全文
posted @ 2018-09-13 23:06 acboyty 阅读(153) 评论(0) 推荐(0)
poj 3241 Object Clustering （曼哈顿最小生成树）
摘要：Object Clustering Time Limit: 2000MS Memory Limit: 131072K Total Submissions: 2640 Accepted: 806 Description We have N (N ≤ 10000) objects, and wish t 阅读全文
posted @ 2018-09-13 22:58 acboyty 阅读(237) 评论(0) 推荐(0)
ACM-ICPC 2018 徐州赛区网络预赛 H. Ryuji doesn't want to study （线段树）
摘要：Ryuji is not a good student, and he doesn't want to study. But there are n books he should learn, each book has its knowledge a[i]a[i]. Unfortunately, 阅读全文
posted @ 2018-09-09 22:48 acboyty 阅读(310) 评论(0) 推荐(0)
hdu 1667 The Rotation Game ( IDA* )
摘要：题目大意： 给你一个“井”子状的board，对称的由24个方块组成，每个方块上有123三个数字中的一个。给你初始状态，共有八种变换方式，求字典序最小的最短的的变换路径使得，board中间的八个方块上数字相同。（建议看下题目中的图就懂啦）。 IDA*搜索。 我是干脆用结构体保存搜索状态（当然这样很占空 阅读全文
posted @ 2018-09-05 22:30 acboyty 阅读(231) 评论(0) 推荐(0)