Description

To enable homebuyers to estimate the cost of flood insurance, a real-estate firm provides clients with the elevation of each 10-meter by 10-meter square of land in regions where homes may be purchased. Water from rain, melting snow, and burst water mains will collect first in those squares with the lowest elevations, since water from squares of higher elevation will run downhill. For simplicity, we also assume that storm sewers enable water from high-elevation squares in valleys (completely enclosed by still higher elevation squares) to drain to lower elevation squares, and that water will not be absorbed by the land.  From weather data archives, we know the typical volume of water that collects in a region. As prospective homebuyers, we wish to know the elevation of the water after it has collected in low-lying squares, and also the percentage of the region's area that is completely submerged (that is, the percentage of 10-meter squares whose elevation is strictly less than the water level). You are to write the program that provides these results. 

Input

The input consists of a sequence of region descriptions. Each begins with a pair of integers, m and n, each less than 30, giving the dimensions of the rectangular region in 10-meter units. Immediately following are m lines of n integers giving the elevations of the squares in row-major order. Elevations are given in meters, with positive and negative numbers representing elevations above and below sea level, respectively. The final value in each region description is an integer that indicates the number of cubic meters of water that will collect in the region. A pair of zeroes follows the description of the last region.
 

Output

For each region, display the region number (1, 2, ...), the water level (in meters above or below sea level) and the percentage of the region's area under water, each on a separate line. The water level and percentage of the region's area under water are to be displayed accurate to two fractional digits. Follow the output for each region with a blank line.

Sample Input

3 3
25 37 45
51 12 34
94 83 27
10000
0 0

Sample Output

Region 1
Water level is 46.67 meters.
66.67 percent of the region is under water. 先对所有海拔排序,从小到大
然后,选取中间的海拔作为最终填满T1体积水后的海拔高度,判断其与T的关系,若T1>T,选取海拔较小的海拔,填满T2体积水。
直到得到两相邻海拔高度的T1,T2,使得(T1-T)*(T2-T)<0,则说明最后的水的高度在T1和T2之间。
考虑到数据个能比较多,采用二分法做该题。
但是,最后一直 结果错误,以下为采用二分法的错误代码
情况很多,细节也很多。
#include <iostream>
#include <algorithm>
#include <string.h>
#include <cmath>
#include <iomanip>
using namespace std;
const int maxn = *+;
int s[maxn], sum[maxn],m,n; //s为各个网格的海拔高度,有正有负 void dataout(double a1,double a2,double ss,double numm,double T)
{
//cout<<a1<<" "<<a2<< " "<<ss<< " "<<numm<<endl;
if(numm == )numm=;
double height = ss + (a1 - a2) / numm , per;
if(T == )per=;
else per = * numm / (m*n) ;
cout<<setiosflags(ios::fixed)<<setprecision();
cout << "Water level is " << height << " meters."<<endl;
cout << per << " percent of the region is under water."<<endl;
} void deal2(double T)
{
sort(s, s + m * n);
int a = , b = n * m - ,mid; //用二分法从中间向两边计算
while(){
mid = (a + b) / ;
if(sum[mid]!=)sum[mid]=;
for(int i = ;i < mid; i++){
if(s[i] < s [mid]) {
sum[mid] += (s[mid] - s[i]);
}
}
if (sum[mid] < T) a = mid;
else b = mid;
if(abs(a-b)<=)break;
}
if((sum[a-]-T)*(sum[a]-T) < &&a!=){
if(sum[a-] > T) dataout(T,sum[a],s[a],a-,T);
else dataout(T,sum[a-],s[a-],a,T);
}
else{
if(sum[a+] > T) dataout(T,sum[a],s[a],a+,T);
else dataout(T,sum[a+],s[a+],a,T);
}
} void deal1(double T)
{
sort(s, s + m * n);
int i;
bool flag = false;
sum[] = ;
for(i=;i<n*m;i++){
for(int j=;j<i;j++){
sum[i]+=(s[i] - s[j]);
/*cout<<"i "<<i<<" j "<<j<<endl;
cout<<sum[i]<<" = "<<s[i]<<" - "<<s[j]<<endl;*/
}
if(sum[i] >= T){
flag = true;
break;
}
}
/*cout<<i<<endl;
cout<<"sum[i-1] "<<sum[0]<<" sum[i] "<<sum[1]<<endl;*/
if(flag){
double height ,per;
if(T == ){
per=;
height = s[];
}
else {
per = * i / m / n;
height = s[i-] + (sum[i] - sum[i-]) / i;
}
cout<<setiosflags(ios::fixed)<<setprecision();
cout << "Water level is " <<height << " meters."<<endl;
cout << per<<" percent of the region is under water."<<endl;
}
else{
i--;
/*cout<<"false"<<endl;
cout<<"i "<<i<<endl;
cout<<" s[i-1] "<<s[i-1]<<" sum[i] "<<sum[i]<<endl;*/
double height ,per;
if(T == ){
per = ;
height = s[];
}
else {
per = ;
height = s[i] + (T - sum[i]) / (i + ) ;
}
cout<<setiosflags(ios::fixed)<<setprecision();
cout << "Water level is " <<height << " meters."<<endl;
cout << per<<" percent of the region is under water."<<endl;
}
} int main()
{
int times=;
double T;
while( cin >> n >> m ){
if(n == )break;
for(int i = ;i < n*m;i++)cin >> s[i];
cin >> T;
cout<< "Region " << ++times << endl;
memset(sum,,sizeof(sum));
if(m == &&n == ){
double height = T/ + s[],per;
if(T == ) per = ;
else per = ;
cout << setiosflags(ios::fixed) << setprecision();
cout << "Water level is " <<height << " meters."<<endl;
cout << per << " percent of the region is under water."<<endl;
}
else if(m*n<)deal1(T/);
else deal2(T / );
}
return ;
}
实在不知错在哪,就不用二分法试试。
一次AC
果然还是我想太多了,不用二分法也并没有超时。
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
const int maxn = *+;
int s[maxn],m,n; //s为各个网格的海拔高度,有正有负 void dataout(double a1,double a2,double ss,double numm,double T)
{
if(numm == )numm=;
double height = ss + (a1 - a2) / numm , per = * numm / (m*n);
cout<<setiosflags(ios::fixed)<<setprecision();
cout << "Water level is " << height << " meters."<<endl;
cout << per << " percent of the region is under water."<<endl;
} void deal(double T)
{ int a = ,t1 = ,t2 = ,i;
for(i=;i<n*m;i++){
t2 = t1;
t1 = ;
for(int j=;j<i;j++)t1+=(s[i] - s[j]);
if(t2< T&& (t1 > T||t1 == T))break; }
if(i == n*m) dataout(T,t1,s[i-],i,T);
else dataout(T,t2,s[i-],i,T);
} int main()
{
int times=;
double T;
while( cin >> n >> m ){
if(n == )break;
for(int i = ;i < n*m;i++)cin >> s[i];
cin >> T;
cout<< "Region " << ++times << endl;
sort(s, s + m * n);
if(T == ){
double height = s[], per = ;
cout << setiosflags(ios::fixed) << setprecision();
cout << "Water level is " <<height << " meters."<<endl;
cout << per << " percent of the region is under water."<<endl;
}
else deal( T / );
}
return ;
}



uvA Flooded!的更多相关文章

  1. UVA 815 Flooded!

    题意:来自:https://blog.csdn.net/lecholin/article/details/70186673 思路: ①数组存每个网格的高度,然后排序,做题时想象为上面的柱状图. ②注意 ...

  2. 【每日一题】Flooded! UVA - 815 模拟阅读格式题

    https://cn.vjudge.net/problem/UVA-815 题意:给你一个矩阵,每个格子的数代表一个海拔并且每个格子的面积100平方米.给你整个区域的降水量(立方米),问降水量(米). ...

  3. 【习题 4-9 UVA - 815】Flooded!

    [链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 题目很迷啊. 不会出现盆地? 可以理解为一条线. 从左往右高度上升的一座座山. 然后V升的水从最左边的山倒进去. 然后问你最后海拔多 ...

  4. Flooded! UVA - 815 (sort排序)

    错了好多遍,不知道为啥出错,如果有大神发现,请求指点!!! 附错误代码(错的不知道怎么回事): #include<iostream> #include<cstdio> #inc ...

  5. uva 1354 Mobile Computing ——yhx

    aaarticlea/png;base64,iVBORw0KGgoAAAANSUhEUgAABGcAAANuCAYAAAC7f2QuAAAgAElEQVR4nOy9XUhjWbo3vu72RRgkF5

  6. UVA 10564 Paths through the Hourglass[DP 打印]

    UVA - 10564 Paths through the Hourglass 题意: 要求从第一层走到最下面一层,只能往左下或右下走 问有多少条路径之和刚好等于S? 如果有的话,输出字典序最小的路径 ...

  7. UVA 11404 Palindromic Subsequence[DP LCS 打印]

    UVA - 11404 Palindromic Subsequence 题意:一个字符串,删去0个或多个字符,输出字典序最小且最长的回文字符串 不要求路径区间DP都可以做 然而要字典序最小 倒过来求L ...

  8. UVA&&POJ离散概率与数学期望入门练习[4]

    POJ3869 Headshot 题意:给出左轮手枪的子弹序列,打了一枪没子弹,要使下一枪也没子弹概率最大应该rotate还是shoot 条件概率,|00|/(|00|+|01|)和|0|/n谁大的问 ...

  9. UVA计数方法练习[3]

    UVA - 11538 Chess Queen 题意:n*m放置两个互相攻击的后的方案数 分开讨论行 列 两条对角线 一个求和式 可以化简后计算 // // main.cpp // uva11538 ...

随机推荐

  1. jquery的Post方法$.post()

    $.post是jquery自带的一个方法,使用前需要引入jquery.js 语法:$.post(url,data,callback,type); url(必须):发送请求的地址,String类型 da ...

  2. 后缀自动机/回文自动机/AC自动机/序列自动机----各种自动机(自冻鸡) 题目泛做

    题目1 BZOJ 3676 APIO2014 回文串 算法讨论: cnt表示回文自动机上每个结点回文串出现的次数.这是回文自动机的定义考查题. #include <cstdlib> #in ...

  3. apache将请求转发到到tomcat应用

    映射: 1.开启apache中的proxy模块(proxy.conf,proxy.load,proxy_http.load) 2.配置apache配置文件,<VirtualHost *:80&g ...

  4. 利用JS实现HTML TABLE的分页

    有时候table的列数太长,不利于使用者查询,所以利用JS做了一个table的分页,以下为相关代码 一.JS代码 <script type="text/javascript" ...

  5. pcduino通过USB方式刷机

    最近买了块pcduino来玩,一开始也不知道怎么入手使用,就想先学着网上来刷机,可以用TF卡来刷机,也可以用U盘来刷机.由于手上只有优盘,所以采用了第二种方式.具体方法参考了网上. 本文非原创,原文来 ...

  6. 自定义栈类型,具有找到站内最小元素的min函数 ,且min(),pop(),push()函数的时间复杂度为O(1)

    基本思想: // 借助一个辅助栈,入栈时,若新元素比辅助栈栈顶元素小,则直接放入辅助站 // 反之,辅助站中放入次小元素(即辅助栈栈顶元素)====保证最小元素出栈时,次小元素被保存 static c ...

  7. Linux iostat监测IO状态(转)

    Linux iostat监测IO状态 2010-03-1  |  13:13分类:Linux,技术细节  |  标签:Linux  |  53,945 views Linux系统出现了性能问题,一般我 ...

  8. Codeforces 245H Queries for Number of Palindromes

    http://codeforces.com/contest/245/problem/H 题意:给定一个字符串,每次给个区间,求区间内有几个回文串(n<=5000) 思路:设定pd[i][j]代表 ...

  9. 正确地黑C

    转载:http://tieba.baidu.com/p/3190068223?pn=1 本版暂时当作提纲,不做详细展开讨论,以后可能更新. 注意:本文主旨不是政治正确. 1.设计C的设计相对于同期来说 ...

  10. 查看mysql字符集及修改表结构--表字符集,字段字符集

    MySQL 乱码的根源是的 MySQL 字符集设置不当的问题,本文汇总了有关查看 MySQL 字符集的命令.包括查看 MySQL 数据库服务器字符集.查看 MySQL 数据库字符集,以及数据表和字段的 ...