6 lqybzx

尚未进行身份认证

我要认证

123

等级
TA的排名 1w+

Petrozavodsk Winter Training Camp 2018: Carnegie Mellon U Contest I. Statistics

题目大意:有n个物品放入体积为v的背包内,问正好放满n时的最小物品数量在这个数量的基础上求a.体积平均最小b.体积中位数最小c.相同体积出现的次数最大值最小d.最大体积减去最小体积值最小题解:背包四合一,四个问题分开求解。a.直接放背包维护最小值即可。b.正反各放一遍背包,记录放进每一个时候背包的形态。放到x则将1放到x与n放到x+1的背包合并,查询

2018-04-28 20:01:52

Petrozavodsk Winter Training Camp 2018: Carnegie Mellon U Contest A. Mines

题目大意:给你n个点,分别位于pi。每个点有个爆炸范围ri和代价ci,花费ci可以引爆某个点,并且pi-ri到pi+ri范围内的点都会被引爆。q个询问,每次修改一个点的ci,每次输出引爆所有店的最小代价。题解:学了下线段树优化建立边。首先对于这些爆炸关系连边所点我们可以得到一个DAG,引爆所有点的代价就是所有入度为0的点的代价最小值之和。那么这题是区间操作,我们可以用线段树

2018-04-28 13:07:42

bzoj 2460: [BeiJing2011]元素

Description  相传,在远古时期,位于西方大陆的 Magic Land 上,人们已经掌握了用魔法矿石炼制法杖的技术。那时人们就认识到,一个法杖的法力取决于使用的矿石。一般地,矿石越多则法力越强,但物极必反:有时,人们为了获取更强的法力而使用了很多矿石,却在炼制过程中发现魔法矿石全部消失了,从而无法炼制出法杖,这个现象被称为“魔法抵消” 。特别地,如果在炼制过程中使

2018-03-01 19:56:19

bzoj 2115: [Wc2011] Xor

DescriptionInput第一行包含两个整数N和 M, 表示该无向图中点的数目与边的数目。 接下来M 行描述 M 条边,每行三个整数Si,Ti ,Di,表示 Si 与Ti之间存在 一条权值为 Di的无向边。 图中可能有重边或自环。Output仅包含一个整数,表示最大的XOR和(十进制结果),注意输出后加换行回车。Sample Input

2018-03-01 19:54:45

HDU 3949 XOR

Problem DescriptionXOR is a kind of bit operator, we define that as follow: for two binary base number A and B, let C=A XOR B, then for each bit of C, we can get its value by check the digit of co

2018-02-28 17:33:39

hdu 6200 mustedge mustedge mustedge

Problem DescriptionGive an connected undirected graph with n nodes and m edges, (n,m≤105) which has no selfloops or multiple edges initially. Now we have q operations (q≤105):   ⋅1 u

2017-09-21 16:50:45

hdu 6209 The Intersection

Problem DescriptionA given coefficient K leads an intersection of two curves f(x) and gK(x). In the first quadrant, the curve f is a monotone increasing function that f(x)=x−−√. The curve 

2017-09-18 20:54:59

2017多校训练Contest5: 1008 Rikka with Subset hdu6092

Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:Yuta has n positive A1−An and

2017-08-20 17:53:44

2017多校训练Contest5: 1006 Rikka with Graph hdu6090

Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:For an undirected graph G with

2017-08-20 17:51:59

2017多校训练Contest5: 1001 Rikka with Candies hdu6085

Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:There are n children and m ki

2017-08-20 17:48:22

2017多校训练Contest4: 1007 Matching In Multiplication hdu6073

Problem DescriptionIn the mathematical discipline of graph theory, a bipartite graph is a graph whose vertices can be divided into two disjoint sets U and V (that is, U and V are each independ

2017-08-20 17:42:53

2017多校训练Contest4: 1005 Lazy Running hdu6071

Problem DescriptionIn HDU, you have to run along the campus for 24 times, or you will fail in PE. According to the rule, you must keep your speed, and your running distance should not be less than

2017-08-20 17:39:39

2017多校训练Contest4: 1004 Dirt Ratio hdu6070

Problem DescriptionIn ACM/ICPC contest, the ''Dirt Ratio'' of a team is calculated in the following way. First let's ignore all the problems the team didn't pass, assume the team passed Xproblems

2017-08-20 17:37:15

2017多校训练Contest4: 1003 Counting Divisors hdu6069

Problem DescriptionIn mathematics, the function d(n) denotes the number of divisors of positive integer n.For example, d(12)=6 because 1,2,3,4,6,12 are all 12's divisors.In this prob

2017-08-20 17:31:33

2017多校训练Contest4: 1012 Wavel Sequence hdu6078

Problem DescriptionHave you ever seen the wave? It's a wonderful view of nature. Little Q is attracted to such wonderful thing, he even likes everything that looks like wave. Formally, he defines

2017-08-20 17:26:33

2017多校训练Contest4: 1011 Time To Get Up hdu6077

Problem DescriptionLittle Q's clock is alarming! It's time to get up now! However, after reading the time on the clock, Little Q lies down and starts sleeping again. Well, he has 5 alarms, and i

2017-08-20 17:20:46

2017多校训练Contest4: 1009 Questionnaire hdu6075

Problem DescriptionIn order to get better results in official ACM/ICPC contests, the team leader comes up with a questionnaire. He asked everyone in the team whether to have more training.

2017-08-20 17:20:38

2017多校训练Contest3: 1011 RXD's date hdu6066

Problem DescriptionAs we all know that RXD is a life winner, therefore he always goes out, dating with his female friends.Nevertheless, it is a pity that his female friends don't like extremely

2017-08-16 16:08:51

2017多校训练Contest3: 1008 RXD and math hdu6063

RXD is a good mathematician.One day he wants to calculate:∑i=1nkμ2(i)×⌊nki−−−√⌋output the answer module 109+7.1≤n,k≤1018μ(n)=1(n=1)μ(n)=(−1)k(n=p1p2…pk)μ(n)=0(other

2017-08-16 16:05:44

2017多校训练Contest3: 1005 RXD and dividing hdu6060

Problem DescriptionRXD has a tree T, with the size of n. Each edge has a cost.Define f(S) as the the cost of the minimal Steiner Tree of the set S on tree T. he wants to divide 2,3,4,5

2017-08-16 16:03:17

查看更多

勋章 我的勋章
  • 持之以恒
    持之以恒
    授予每个自然月内发布4篇或4篇以上原创或翻译IT博文的用户。不积跬步无以至千里,不积小流无以成江海,程序人生的精彩需要坚持不懈地积累!