09 2018 档案

HDU 5723 Abandoned country 【最小生成树&&树上两点期望】
摘要：任意门：http://acm.hdu.edu.cn/showproblem.php?pid=5723 Abandoned country Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)T 阅读全文
posted @ 2018-09-27 16:41 莜莫 阅读(178) 评论(0) 推荐(0)
CodeForces-822D 【最小素因子应用】
摘要：任意门:https://vjudge.net/problem/CodeForces-822D D. My pretty girl Noora time limit per test 1.5 seconds memory limit per test 256 megabytes input stand 阅读全文
posted @ 2018-09-26 18:54 莜莫 阅读(361) 评论(0) 推荐(0)
2014-2015 ACM-ICPC East Central North America Regional Contest (ECNA 2014) A、Continued Fractions 【模拟连分数】
摘要：任意门：http://codeforces.com/gym/100641/attachments Con + tin/(ued + Frac/tions) Con + tin/(ued + Frac/tions) Time Limit: 3000/1000 MS (Java/Others) Memo 阅读全文
posted @ 2018-09-25 20:15 莜莫 阅读(244) 评论(0) 推荐(0)
Codeforces Round #512 (Div. 2, based on Technocup 2019 Elimination Round 1) C. Vasya and Golden Ticket 【。。。】
摘要：任意门：http://codeforces.com/contest/1058/problem/C C. Vasya and Golden Ticket time limit per test 1 second memory limit per test 256 megabytes input sta 阅读全文
posted @ 2018-09-25 20:04 莜莫 阅读(259) 评论(0) 推荐(0)
HDU 5025 Saving Tang Monk 【状态压缩BFS】
摘要：任意门：http://acm.hdu.edu.cn/showproblem.php?pid=5025 Saving Tang Monk Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)To 阅读全文
posted @ 2018-09-24 11:56 莜莫 阅读(234) 评论(0) 推荐(0)
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 A、Saving Tang Monk II 【状态搜索】
摘要：任意门：http://hihocoder.com/problemset/problem/1828 Saving Tang Monk II 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 《Journey 阅读全文
posted @ 2018-09-23 15:53 莜莫 阅读(364) 评论(0) 推荐(0)
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 B Tomb Raider 【二进制枚举】
摘要：任意门：http://hihocoder.com/problemset/problem/1829 Tomb Raider 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 Lara Croft, the 阅读全文
posted @ 2018-09-23 11:52 莜莫 阅读(264) 评论(0) 推荐(0)
HDU 5258 数长方形【离散化+暴力】
摘要：任意门：http://acm.hdu.edu.cn/showproblem.php?pid=5258 数长方形 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submissi 阅读全文
posted @ 2018-09-12 21:41 莜莫 阅读(195) 评论(0) 推荐(0)
Educational Codeforces Round 10 D. Nested Segments 【树状数组区间更新 + 离散化 + stl】
摘要：任意门：http://codeforces.com/contest/652/problem/D D. Nested Segments time limit per test 2 seconds memory limit per test 256 megabytes input standard in 阅读全文
posted @ 2018-09-12 00:20 莜莫 阅读(219) 评论(0) 推荐(0)
Codeforces Round #361 (Div. 2) E. Mike and Geometry Problem 【逆元求组合数 && 离散化】
摘要：任意门：http://codeforces.com/contest/689/problem/E E. Mike and Geometry Problem time limit per test 3 seconds memory limit per test 256 megabytes input s 阅读全文
posted @ 2018-09-11 18:09 莜莫 阅读(149) 评论(0) 推荐(0)
ACM-ICPC 2018 徐州赛区网络预赛 G. Trace【树状数组维护区间最大值】
摘要：任意门：https://nanti.jisuanke.com/t/31459 There's a beach in the first quadrant. And from time to time, there are sea waves. A wave ( xx , yy ) means the 阅读全文
posted @ 2018-09-10 23:15 莜莫 阅读(183) 评论(0) 推荐(0)
ACM-ICPC 2018 徐州赛区网络预赛 A.Hard to prepare 【规律递推】
摘要：任意门：https://nanti.jisuanke.com/t/31453 A.Hard to prepare After Incident, a feast is usually held in Hakurei Shrine. This time Reimu asked Kokoro to de 阅读全文
posted @ 2018-09-10 22:50 莜莫 阅读(338) 评论(0) 推荐(0)
POJ 3635 Full Tank? 【分层图/最短路dp】
摘要：任意门：http://poj.org/problem?id=3635 Full Tank? Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8388 Accepted: 2734 Description After going t 阅读全文
posted @ 2018-09-06 20:54 莜莫 阅读(302) 评论(0) 推荐(0)
BZOJ 2763: [JLOI2011]飞行路线 【分层图模板】
摘要：任意门：https://www.lydsy.com/JudgeOnline/problem.php?id=2763 2763: [JLOI2011]飞行路线 Description Alice和Bob现在要乘飞机旅行，他们选择了一家相对便宜的航空公司。该航空公司一共在n个城市设有业务，设这些城市分别 阅读全文
posted @ 2018-09-05 15:57 莜莫 阅读(218) 评论(0) 推荐(0)
[USACO09FEB] Revamping Trails 【分层图+Dijkstra】
摘要：任意门：https://www.luogu.org/problemnew/show/P2939 Revamping Trails 题目描述 Farmer John dutifully checks on the cows every day. He traverses some of the M ( 阅读全文
posted @ 2018-09-05 15:13 莜莫 阅读(171) 评论(0) 推荐(0)