随笔分类 -  搜索

icpc 2018 北京网络赛 A（搜索）
摘要：Saving Tang Monk II Saving Tang Monk II 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 《Journey to the West》(also 《Monkey》) is one of the Four Great Classical 阅读全文
posted @ 2018-09-22 23:37 Acerkoo 阅读(142) 评论(0) 推荐(0)
2018 徐州网络赛 C
摘要：262144K Morgana is playing a game called cacti lottery. In this game, morgana has a 3 \times 33×3 grid graph, and the graph is filled with 11 ~ 99 , e 阅读全文
posted @ 2018-09-12 23:20 Acerkoo 阅读(165) 评论(0) 推荐(0)
Split The Tree（dfs序+树状数组）
摘要：Split The Tree 题目描述 You are given a tree with n vertices, numbered from 1 to n. ith vertex has a value wiWe define the weight of a tree as the number 阅读全文
posted @ 2018-09-05 19:04 Acerkoo 阅读(718) 评论(1) 推荐(1)
8377: Playoff
摘要：8377: Playoff 题目描述 The Minato Mirai Football Association hosts its annual championship as a single round-robin tournament, in which each team plays a 阅读全文
posted @ 2018-08-23 19:45 Acerkoo 阅读(167) 评论(0) 推荐(0)
zoj 4045 District Division
摘要：District DivisionTime Limit: 1 Second Memory Limit: 65536 KB Special JudgeEzio learned a lot from his uncle Mario in Villa A... 阅读全文
posted @ 2018-06-11 21:30 Acerkoo 阅读(245) 评论(0) 推荐(0)
哈密顿绕行世界问题
摘要：一个规则的实心十二面体，它的 20个顶点标出世界著名的20个城市，你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m=1.m=0退出. Output输出从第m个城市... 阅读全文
posted @ 2018-06-02 15:26 Acerkoo 阅读(176) 评论(0) 推荐(0)
D. Fair
摘要：D. Fairtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputSome company is going to ... 阅读全文
posted @ 2018-05-31 12:57 Acerkoo 阅读(151) 评论(0) 推荐(0)