2017年10月_TLECODE

原创【bzoj1834】 network 网络扩容【ZJOI2010】

Description给定一张有向图，每条边都有一个容量C和一个扩容费用W。这里扩容费用是指将容量扩大1所需的费用。求： 1、在不扩容的情况下，1到N的最大流； 2、将1到N的最大流增加K所需的最小扩容费用。Input输入文件的第一行包含三个整数N,M,K，表示有向图的点数、边数以及所需要增加的流量。接下来的M行每行包含四个整数u,v,C,W，表示一条从u到v，容量为C，扩容费用...

2017-10-31 20:30:32 209

原创【poj 1061】青蛙的约会

Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，既没有问清楚对方的特征，也没有约定见面的具体位置。不过青蛙们都是很乐观的，它们觉得只要一直朝着某个方向跳下去，总能碰到对方的。但是除非这两只青蛙在同一时间跳到同一点上，不然是永远都不可能碰面的。

2017-10-29 12:24:38 358

原创【poj 1274】 The Perfect Stall 【USACO 40】

DescriptionFarmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are differen

2017-10-27 21:40:54 284

原创【poj 1511】 Invitation Cards 【Central Europe 1998】

DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique

2017-10-16 16:18:31 284

原创【poj 2823】 Sliding Window

DescriptionAn array of size n ≤ 106 is given to you. There is a sliding window of sizek which is moving from the very left of the array to the very right. You can only see thek numbers in the wi

2017-10-13 23:05:59 208

原创【poj 2299】 Ultra-QuickSort 【Waterloo local 2005.02.05】

DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the seque

2017-10-13 21:13:57 326

原创【poj 2478】 Farey Sequence

DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible rational numbers a/b with 0 < a < b <= n and gcd(a,b) = 1 arranged in increasing order. The first few are

2017-10-11 22:16:26 386

原创【poj 3268】 Silver Cow Party 【USACO 2007 February Silver】

DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirect

2017-10-10 14:58:02 296

原创【poj 1330】 Nearest Common Ancestors 【Taejon 2002】

DescriptionA rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is labeled with an integer from {1, 2,...,16}.

2017-10-09 16:01:13 257

原创【poj 1080】 Human Gene Functions 【Taejon 2001】

DescriptionIt is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters, A, C, G, and T. Biologists have been intere

2017-10-09 14:28:24 234

原创【poj 1050】 To the Max 【Greater New York 2001】

DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle

2017-10-05 11:34:37 276

原创【poj 2407】 Relatives 【Waterloo local 2002.07.01】

DescriptionGiven n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such

2017-10-03 20:56:49 326

原创【poj 2356】 Find a multiple 【Ural Collegiate Programming Contest 1999】

DescriptionThe input contains N natural (i.e. positive integer) numbers ( N <= 10000 ). Each of that numbers is not greater than 15000. This numbers are not necessarily different (so it may happen t

2017-10-02 20:21:38 271

原创【poj 2115】 C Looooops 【CTU Open 2004】

DescriptionA Compiler Mystery: We are given a C-language style for loop of typefor (variable = A; variable != B; variable += C) statement;I.e., a loop which starts by setting variable to

2017-10-02 19:06:49 513

TLECODE的博客