kuronekonano的博客

Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Fa...

Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Fa...

Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph. Input The first line of input contains an integer...

Description 假期，Hrbust集训队在Tang长老的带领下去河上坐船游玩。 但是很多队员想单独坐船游览风光，体验一个人的旅行。 但是教主说那样会很危险，而且似乎也没那么多的旅行路线。可是队员们还是坚持自己的想法，于是教主提了个要求：如果游览的路线足够一人一条，而且每条路线没有重复的水路的话，就同意大家的做法，不然，Tang长老就请大家集体吃冰棍，一起坐船去。集训队这次一...

题目描述 We have N gemstones labeled 1 through N. You can perform the following operation any number of times (possibly zero). Select a positive integer x, and smash all the gems labeled with multiples...

题目描述 Open-pit mining is a surface mining technique of extracting rock or minerals from the earth by their removal from an open pit or borrow. Open-pit mines are used when deposits of commercially use...

Problem Description C-bacteria takes charge of two kinds of videos: ’The Collection of Silly Games’ and ’The Collection of Horrible Games’. For simplicity’s sake, they will be called as videoA and v...

题目描述In the country of Via, the cities are connected by roads that can be used in both directions.However, this has been the cause of many accidents since the lanes are not separated: The drivers fre...

题意： 一个n个城市m条边的有向图，有c个人要从起点走到终点，每个人走到终点的花费为该人所走路径上经过人最多的边的人数平方，求所有人到达终点花费总和的最小值题解： 因为花费是平方，每个人最优的走法一定是将人数按路径平均下来。最终所有人的花费总和其实就是每一条能到达终点的路径上的最大人数平方和。从起点到终点的路径数量用容量为1的边跑最大流可以得到。然后就按照最优分法，将人数c平均分为路径数量...