大桃桃 - 博客园

TZOJ 2099 Sightseeing tour(网络流判混合图欧拉回路)

摘要：描述 The city executive board in Lund wants to construct a sightseeing tour by bus in Lund, so that tourists can see every corner of the beautiful city. 阅读全文

posted @ 2018-10-04 23:14 大桃桃阅读(174) 评论(0) 推荐(0) 编辑

2018 ICPC青岛网络赛 B. Red Black Tree(倍增lca好题)

摘要： BaoBao has just found a rooted tree with n vertices and (n-1) weighted edges in his backyard. Among the vertices, of them are red, while the others ar 阅读全文

posted @ 2018-09-19 22:31 大桃桃阅读(516) 评论(0) 推荐(0) 编辑

HDU 6118 度度熊的交易计划(最小费用最大流)

摘要： Problem Description度度熊参与了喵哈哈村的商业大会，但是这次商业大会遇到了一个难题：喵哈哈村以及周围的村庄可以看做是一共由n个片区，m条公路组成的地区。由于生产能力的区别，第i个片区能够花费a[i]元生产1个商品，但是最多生产b[i]个。同样的，由于每个片区的购买能力的区别，第i个阅读全文

posted @ 2018-09-19 15:29 大桃桃阅读(143) 评论(0) 推荐(0) 编辑

TZOJ 4848 货车运输(最大生成树+倍增lca)

摘要：描述 A 国有 n 座城市，编号从 1 到 n，城市之间有 m 条双向道路。每一条道路对车辆都有重量限制，简称限重。现在有 q 辆货车在运输货物，司机们想知道每辆车在不超过车辆限重的情况下，最多能运多重的货物。 A 国有 n 座城市，编号从 1 到 n，城市之间有 m 条双向道路。每一条道路对车辆都阅读全文

posted @ 2018-09-18 21:48 大桃桃阅读(233) 评论(0) 推荐(0) 编辑

Gym - 101243F Vitamins(思维+并查集)

摘要：题意有三种药丸，白色W>红色R>蓝色B，给你m个约束条件，问你n个药丸的颜色，不能确定颜色输出‘？’ 题解如果1<2<3，只要找到2就能确定1和3的颜色如果2=4，只要确定一个就能确定另一个处理的时候先把=用并查集处理一下在处理<和>号代码阅读全文

posted @ 2018-09-18 14:42 大桃桃阅读(253) 评论(0) 推荐(0) 编辑

FZU 2277 Change(dfs序+树状数组)

摘要： Problem Description There is a rooted tree with n nodes, number from 1-n. Root’s number is 1.Each node has a value ai. Initially all the node’s value 阅读全文

posted @ 2018-09-16 20:05 大桃桃阅读(214) 评论(0) 推荐(0) 编辑

ACM-ICPC 2018 沈阳赛区网络预赛 J. Ka Chang(树状数组+分块)

摘要： Given a rooted tree ( the root is node 1 ) of N nodes. Initially, each node has zero point.Then, you need to handle Q operations. There're two types:1 阅读全文

posted @ 2018-09-15 09:42 大桃桃阅读(254) 评论(0) 推荐(0) 编辑

POJ 2396 Budget(有源汇上下界网络流)

摘要： Description We are supposed to make a budget proposal for this multi-site competition. The budget proposal is a matrix where the rows represent differ 阅读全文

posted @ 2018-09-14 14:48 大桃桃阅读(177) 评论(0) 推荐(0) 编辑

HDU 4940 Destroy Transportation system(无源汇上下界网络流)

摘要： Problem Description Tom is a commander, his task is destroying his enemy’s transportation system. Let’s represent his enemy’s transportation system as 阅读全文

posted @ 2018-09-11 15:31 大桃桃阅读(145) 评论(0) 推荐(0) 编辑

ACM-ICPC 2018 沈阳赛区网络预赛 F. Fantastic Graph (贪心或有源汇上下界网络流)

摘要： "Oh, There is a bipartite graph.""Make it Fantastic."X wants to check whether a bipartite graph is a fantastic graph. He has two fantastic numbers, an 阅读全文

posted @ 2018-09-08 21:39 大桃桃阅读(380) 评论(0) 推荐(0) 编辑

HDU 3251 Being a Hero(最小割+输出割边)

摘要： Problem DescriptionYou are the hero who saved your country. As promised, the king will give you some cities of the country, and you can choose which o 阅读全文

posted @ 2018-09-08 11:35 大桃桃阅读(219) 评论(0) 推荐(0) 编辑

HDU 6081 度度熊的王国战略(全局最小割堆优化)

摘要： Problem Description度度熊国王率领着喵哈哈族的勇士，准备进攻哗啦啦族。哗啦啦族是一个强悍的民族，里面有充满智慧的谋士，拥有无穷力量的战士。所以这一场战争，将会十分艰难。为了更好的进攻哗啦啦族，度度熊决定首先应该从内部瓦解哗啦啦族。第一步就是应该使得哗啦啦族内部不能同心齐力，需要内部阅读全文

posted @ 2018-09-07 22:38 大桃桃阅读(378) 评论(0) 推荐(0) 编辑

HDU 3691 Nubulsa Expo(全局最小割)

摘要： Problem DescriptionYou may not hear about Nubulsa, an island country on the Pacific Ocean. Nubulsa is an undeveloped country and it is threatened by t 阅读全文

posted @ 2018-09-07 15:26 大桃桃阅读(138) 评论(0) 推荐(0) 编辑

上海大都会赛 I Matrix Game(最大流)

摘要： At the start of the matrix game, we have an N x M matrix. Each grid has some balls.The grid in (i,j) (0 ≤ i < N, 0 ≤ j < M) has Aij balls.In each oper 阅读全文

posted @ 2018-09-06 15:32 大桃桃阅读(105) 评论(0) 推荐(0) 编辑

ACM-ICPC 2018 南京赛区网络预赛 G. Lpl and Energy-saving Lamps(二分+线段树区间最小)

摘要： During tea-drinking, princess, amongst other things, asked why has such a good-natured and cute Dragon imprisoned Lpl in the Castle? Dragon smiled eni 阅读全文

posted @ 2018-09-04 22:43 大桃桃阅读(160) 评论(0) 推荐(0) 编辑