信息学竞赛 - 随笔分类(第9页) - zjxxcn

bzoj 3545: [ONTAK2010]Peaks

摘要：3545: [ONTAK2010]Peaks Description 在Bytemountains有N座山峰，每座山峰有他的高度h_i。有些山峰之间有双向道路相连，共M条路径，每条路径有一个困难值，这个值越大表示越难走，现在有Q组询问，每组询问询问从点v开始只经过困难值小于等于x的路径所能到达的山峰阅读全文

posted @ 2019-09-12 14:34 zjxxcn 阅读(211) 评论(0) 推荐(0)

bzoj 3551: [ONTAK2010]Peaks加强版

摘要：3551: [ONTAK2010]Peaks加强版 Description 【题目描述】同3545 【题目描述】同3545 Input 第一行三个数N，M，Q。第二行N个数，第i个数为h_i 接下来M行，每行3个数a b c，表示从a到b有一条困难值为c的双向路径。接下来Q行，每行三个数v x 阅读全文

posted @ 2019-09-12 14:32 zjxxcn 阅读(299) 评论(0) 推荐(0)

bzoj 5415 归程

摘要：题目描述本题的故事发生在魔力之都，在这里我们将为你介绍一些必要的设定。魔力之都可以抽象成一个 n 个节点、m 条边的无向连通图（节点的编号从 1 至 n）。我们依次用 l,a 描述一条边的长度、海拔。作为季风气候的代表城市，魔力之都时常有雨水相伴，因此道路积水总是不可避免的。由于整个城市的排阅读全文

posted @ 2019-09-12 14:29 zjxxcn 阅读(138) 评论(0) 推荐(0)

pat 1005 Programming Pattern (35 分)

摘要：Programmers often have a preference among program constructs. For example, some may prefer if(0==a), while others may prefer if(!a). Analyzing such pa 阅读全文

posted @ 2019-09-11 11:02 zjxxcn 阅读(338) 评论(0) 推荐(0)

pat 1004 To Buy or Not to Buy - Hard Version (35 分)

摘要：Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of b 阅读全文

posted @ 2019-09-11 11:02 zjxxcn 阅读(292) 评论(0) 推荐(0)

pat 1003 Universal Travel Sites (35 分)

摘要：After finishing her tour around the Earth, CYLL is now planning a universal travel sites development project. After a careful investigation, she has a 阅读全文

posted @ 2019-09-11 11:02 zjxxcn 阅读(1193) 评论(0) 推荐(0)

pat考试1002 Business (35 分)

摘要：As the manager of your company, you have to carefully consider, for each project, the time taken to finish it, the deadline, and the profit you can ga 阅读全文

posted @ 2019-09-11 11:02 zjxxcn 阅读(273) 评论(0) 推荐(0)

pat 顶级 1001 Battle Over Cities - Hard Version (35 分)

摘要：It is vitally important to have all the cities connected by highways in a war. If a city is conquered by the enemy, all the highways from/toward that 阅读全文

posted @ 2019-09-11 11:02 zjxxcn 阅读(604) 评论(0) 推荐(0)

zjxxcn

随笔分类 - 信息学竞赛

公告