wang_128的博客

A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16941 Accepted: 5840DescriptionYou are in charge of setting up the press room for the ina

时间限制：C/C++ 2秒，其他语言4秒空间限制：C/C++ 131072K，其他语言262144K64bit IO Format: %lld题目描述 小Y写了一篇文章，他对自己的文笔很有自信，尤其是自己总结出了一套计算文章通顺性的公式。文章共N段，对于文章的每一段小Y对它都能计算出一个估值，而一篇文章的不连贯值定义为，现在小Y想要发布他的文章，但是编辑小Z让他加入一些广告，具体来说就是M段估值分...

Coding Contest                                                                     Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8159 Accepted: 2961 Special JudgeDescriptionAs you know, all the computers use

FiringTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 10904 Accepted: 3290DescriptionYou’ve finally got mad at “the world’s most stupid” employees

Ikki's Story I - Road ReconstructionTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 8020 Accepted: 2315DescriptionIkki is the king of a small count

DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16831 Accepted: 7473DescriptionCows are such finicky eaters. Each cow has a preference for certa

Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22253 Accepted: 11235DescriptionOn a grid map there are n little men and n houses. In each u

度度熊的交易计划                                                                Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21699 Accepted: 9915DescriptionMirko works on a pig farm that consists of M locked pig-houses and

Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 28881 Accepted: 14972DescriptionA power network consists of nodes (power stations, consum

Secret Milking MachineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12405 Accepted: 3623DescriptionFarmer John is constructing a new milking machine

Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 77789 Accepted: 30315DescriptionEvery time it rains on Farmer John's fields, a pond fo

IntervalsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8363 Accepted: 3569DescriptionYou are given N weighted open intervals. The ith interval cover

Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 17153 Accepted: 6167Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K

题目链接：https://www.nowcoder.com/acm/contest/130/D解题思路：网络流，预处理出所有的（i，j）对和（p，q）对，源点S和（i，j）连容量为1的边，（p，q）和汇点T连容量为1的边，如果(i,j)和(p,q)可以同时选择则连容量为1的边。跑一遍最大流即可得出答案。边数可能很大，注意到（i，j）和（p，q）可以连边的条件是不互质，可以将质因子作为中间点，（i，...