<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Expecto__Patronum的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Expecto__Patronum</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Expecto__Patronum]]></copyright><item><title><![CDATA[CF #425 DIV2 D. Misha, Grisha and Underground（LCA）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77970462</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77970462</guid><author>Expecto__Patronum</author><pubDate>Wed, 13 Sep 2017 20:12:17 +0800</pubDate><description><![CDATA[D. Misha, Grisha and Underground



Misha and Grisha are funny boys, so they like to use new underground. The underground has n stations connected with n - 1 routes
 so that each route connects t]]></description><category></category></item><item><title><![CDATA[HDU 6201 transaction transaction transaction（网络流+最短路）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77943886</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77943886</guid><author>Expecto__Patronum</author><pubDate>Tue, 12 Sep 2017 12:39:57 +0800</pubDate><description><![CDATA[transaction transaction transaction

Problem Description
Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens will r]]></description><category></category></item><item><title><![CDATA[HDU 6053 TrickGCD（莫比乌斯反演）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77882042</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77882042</guid><author>Expecto__Patronum</author><pubDate>Thu, 07 Sep 2017 15:18:04 +0800</pubDate><description><![CDATA[TrickGCD

Problem Description
You are given an array A , and Zhu wants to know there are how many different array B satisfy the following conditions?

* 1≤Bi≤Ai
* For each pair( l , r ) (1≤l≤r≤n]]></description><category></category></item><item><title><![CDATA[HDU 6058 Kanade's sum（思维）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77863001</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77863001</guid><author>Expecto__Patronum</author><pubDate>Wed, 06 Sep 2017 10:20:41 +0800</pubDate><description><![CDATA[Kanade's sum
Problem Description
Give you an array A[1..n]of length n. 

Let f(l,r,k) be the k-th largest element of A[l..r].

Specially , f(l,r,k)=0 if r−l+1

Give you k , you need to calcula]]></description><category></category></item><item><title><![CDATA[HDU 5961 传递（BFS）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77836120</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77836120</guid><author>Expecto__Patronum</author><pubDate>Mon, 04 Sep 2017 12:10:51 +0800</pubDate><description><![CDATA[传递
Problem Description
我们称一个有向图G是传递的，当且仅当对任意三个不同的顶点a,,若G中有 一条边从a到b且有一条边从b到c ,则G中同样有一条边从a到c。
我们称图G是一个竞赛图，当且仅当它是一个有向图且它的基图是完全图。换句 话说，将完全图每条边定向将得到一个竞赛图。
下图展示的是一个有4个顶点的竞赛图。




 

现在，给你两个有向图P =]]></description><category></category></item><item><title><![CDATA[HDU 6073 Matching In Multiplication（拓扑+思维）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77620992</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77620992</guid><author>Expecto__Patronum</author><pubDate>Sun, 27 Aug 2017 16:04:30 +0800</pubDate><description><![CDATA[Matching In Multiplication
Problem Description
In 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 a]]></description><category></category></item><item><title><![CDATA[HDU 6070 Dirt Ratio（二分+线段树）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77606507</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77606507</guid><author>Expecto__Patronum</author><pubDate>Sat, 26 Aug 2017 20:04:32 +0800</pubDate><description><![CDATA[Dirt Ratio


Problem Description
In 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 pas]]></description><category></category></item><item><title><![CDATA[HDU 6105 Gameia（博弈+二分匹配）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77507718</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77507718</guid><author>Expecto__Patronum</author><pubDate>Wed, 23 Aug 2017 16:29:16 +0800</pubDate><description><![CDATA[Gameia
Problem Description
Alice and Bob are playing a game called 'Gameia ? Gameia !'. The game goes like this :
0. There is a tree with all node unpainted initial.
1. Because Bob is the VIP play]]></description><category></category></item><item><title><![CDATA[HDU 6129 Just do it（递推）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77504737</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77504737</guid><author>Expecto__Patronum</author><pubDate>Wed, 23 Aug 2017 13:10:55 +0800</pubDate><description><![CDATA[Just do it

Problem Description
There is a nonnegative integer sequence a1...n of length n. HazelFan wants to do a type of transformation called prefix-XOR, which means a1...n changes into b1...n,]]></description><category></category></item><item><title><![CDATA[HDU 6162 Ch’s gift（LCA）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77497468</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77497468</guid><author>Expecto__Patronum</author><pubDate>Wed, 23 Aug 2017 09:23:02 +0800</pubDate><description><![CDATA[Ch’s gift
Problem Description
Mr. Cui is working off-campus and he misses his girl friend very much. After a whole night tossing and turning, he decides to get to his girl friend's city and of cours]]></description><category></category></item><item><title><![CDATA[HDU 6126 Give out candies（最小割）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77453696</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77453696</guid><author>Expecto__Patronum</author><pubDate>Mon, 21 Aug 2017 18:06:28 +0800</pubDate><description><![CDATA[Give out candies

Problem Description
There are n children numbered 1 to n, and HazelFan's task is to give out candies to the children. Each children must be given at least 1 and at most m candies.]]></description><category></category></item><item><title><![CDATA[HDU 6134 Battlestation Operational（莫比乌斯反演+线性筛）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77429563</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77429563</guid><author>Expecto__Patronum</author><pubDate>Sun, 20 Aug 2017 15:43:42 +0800</pubDate><description><![CDATA[Battlestation Operational


Input
There are multiple test cases.
Each line of the input, there is an integer n (1≤n≤106), as described in the problem.

There are up to 104 test cases. 
Output]]></description><category></category></item><item><title><![CDATA[HDU 6143 Killer Names（容斥）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77371826</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77371826</guid><author>Expecto__Patronum</author><pubDate>Fri, 18 Aug 2017 16:33:09 +0800</pubDate><description><![CDATA[Killer Names


Problem Description

> Galen Marek, codenamed Starkiller, was a male Human apprentice of the Sith Lord Darth Vader. A powerful Force-user who lived during the era of the Galactic E]]></description><category></category></item><item><title><![CDATA[HDU 6140 Hybrid Crystals（思维）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77365834</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77365834</guid><author>Expecto__Patronum</author><pubDate>Fri, 18 Aug 2017 10:15:42 +0800</pubDate><description><![CDATA[Hybrid Crystals
  Problem Description



 Given n crystals'
 energy levels ai and
 types bi (1≤i≤n), bi=N means
 the i-th
 crystal is a neutral one, bi=L means
 a Light one, and bi=D means
]]></description><category></category></item><item><title><![CDATA[HDU 6127 Hard challenge（几何）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77199213</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77199213</guid><author>Expecto__Patronum</author><pubDate>Tue, 15 Aug 2017 19:56:06 +0800</pubDate><description><![CDATA[Hard challenge

Problem Description
There are n points on the plane, and the ith points has a value vali, and its coordinate is (xi,yi). It is guaranteed that no two points have the same coordinate]]></description><category></category></item><item><title><![CDATA[HDU 6119 小小粉丝度度熊（尺取）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77179986</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77179986</guid><author>Expecto__Patronum</author><pubDate>Tue, 15 Aug 2017 09:34:09 +0800</pubDate><description><![CDATA[小小粉丝度度熊

Problem Description

度度熊喜欢着喵哈哈村的大明星——星星小姐。

为什么度度熊会喜欢星星小姐呢？

首先星星小姐笑起来非常动人，其次星星小姐唱歌也非常好听。

但这都不是最重要的，最重要的是，星星小姐拍的一手好代码！

于是度度熊关注了星星小姐的贴吧。

一开始度度熊决定每天都在星星小姐的贴吧里面签到。

但是度度熊是一个非常]]></description><category></category></item><item><title><![CDATA[HDU 6103 Kirinriki（尺取）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77098166</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77098166</guid><author>Expecto__Patronum</author><pubDate>Fri, 11 Aug 2017 15:29:41 +0800</pubDate><description><![CDATA[Kirinriki
Problem Description
We define the distance of two strings A and B with same length n is
disA,B=∑i=0n−1|Ai−Bn−1−i|
The difference between the two characters is defined as the difference i]]></description><category></category></item><item><title><![CDATA[HDU 6097 Mindis（几何）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77096909</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/77096909</guid><author>Expecto__Patronum</author><pubDate>Fri, 11 Aug 2017 14:10:34 +0800</pubDate><description><![CDATA[Mindis

Problem Description
The center coordinate of the circle C is O, the coordinate of O is (0,0) , and the radius is r.
P and Q are two points not outside the circle, and PO = QO.
You need to]]></description><category></category></item><item><title><![CDATA[HDU 6092 Rikka with Subset（背包+思维）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/76992444</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/76992444</guid><author>Expecto__Patronum</author><pubDate>Wed, 09 Aug 2017 15:01:34 +0800</pubDate><description><![CDATA[Rikka with Subset



Problem Description 
As 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 ha]]></description><category></category></item><item><title><![CDATA[HDU 6090 Rikka with Graph（思维）]]></title><link>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/76984748</link><guid>https://blog.youkuaiyun.com/Expecto__Patronum/article/details/76984748</guid><author>Expecto__Patronum</author><pubDate>Wed, 09 Aug 2017 14:00:22 +0800</pubDate><description><![CDATA[Rikka with Graph



Problem Description




As 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:
]]></description><category></category></item></channel></rss>