zoukankan      html  css  js  c++  java
  • UVA 815 Flooded!

    题目链接:https://vjudge.net/problem/UVA-815

    题目翻译摘自《算法禁赛入门经典》

    题目大意

      有一个 n * m(1 ≤ m,n < 30)的网格,每个格子是边长 10 米的正方形,网格四周是无限大的墙壁。输入每个格子的海拔高度,以及网格内雨水的总体积,输出水位的海拔高度以及有多少百分比的区域有水(即高度严格小于水平面)。

    分析

      堆结构基础题。

    代码如下

      1 #include <bits/stdc++.h>
      2 using namespace std;
      3  
      4 #define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
      5 #define Rep(i,n) for (int i = 0; i < (n); ++i)
      6 #define For(i,s,t) for (int i = (s); i <= (t); ++i)
      7 #define rFor(i,t,s) for (int i = (t); i >= (s); --i)
      8 #define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
      9 #define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
     10 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
     11 #define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
     12  
     13 #define pr(x) cout << #x << " = " << x << "  "
     14 #define prln(x) cout << #x << " = " << x << endl
     15  
     16 #define LOWBIT(x) ((x)&(-x))
     17  
     18 #define ALL(x) x.begin(),x.end()
     19 #define INS(x) inserter(x,x.begin())
     20  
     21 #define ms0(a) memset(a,0,sizeof(a))
     22 #define msI(a) memset(a,inf,sizeof(a))
     23 #define msM(a) memset(a,-1,sizeof(a))
     24 
     25 #define MP make_pair
     26 #define PB push_back
     27 #define ft first
     28 #define sd second
     29  
     30 template<typename T1, typename T2>
     31 istream &operator>>(istream &in, pair<T1, T2> &p) {
     32     in >> p.first >> p.second;
     33     return in;
     34 }
     35  
     36 template<typename T>
     37 istream &operator>>(istream &in, vector<T> &v) {
     38     for (auto &x: v)
     39         in >> x;
     40     return in;
     41 }
     42  
     43 template<typename T1, typename T2>
     44 ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
     45     out << "[" << p.first << ", " << p.second << "]" << "
    ";
     46     return out;
     47 }
     48 
     49 inline int gc(){
     50     static const int BUF = 1e7;
     51     static char buf[BUF], *bg = buf + BUF, *ed = bg;
     52     
     53     if(bg == ed) fread(bg = buf, 1, BUF, stdin);
     54     return *bg++;
     55 } 
     56 
     57 inline int ri(){
     58     int x = 0, f = 1, c = gc();
     59     for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
     60     for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
     61     return x*f;
     62 }
     63 
     64 template<class T>
     65 inline string toString(T x) {
     66     ostringstream sout;
     67     sout << x;
     68     return sout.str();
     69 }
     70  
     71 typedef long long LL;
     72 typedef unsigned long long uLL;
     73 typedef pair< double, double > PDD;
     74 typedef pair< int, int > PII;
     75 typedef pair< int, PII > PIPII;
     76 typedef pair< string, int > PSI;
     77 typedef pair< int, PSI > PIPSI;
     78 typedef set< int > SI;
     79 typedef set< PII > SPII;
     80 typedef vector< int > VI;
     81 typedef vector< VI > VVI;
     82 typedef vector< PII > VPII;
     83 typedef map< int, int > MII;
     84 typedef map< int, string > MIS;
     85 typedef map< int, PII > MIPII;
     86 typedef map< PII, int > MPIII;
     87 typedef map< string, int > MSI;
     88 typedef map< string, string > MSS;
     89 typedef map< PII, string > MPIIS;
     90 typedef map< PII, PII > MPIIPII;
     91 typedef multimap< int, int > MMII;
     92 typedef multimap< string, int > MMSI;
     93 //typedef unordered_map< int, int > uMII;
     94 typedef pair< LL, LL > PLL;
     95 typedef vector< LL > VL;
     96 typedef vector< VL > VVL;
     97 typedef priority_queue< int > PQIMax;
     98 typedef priority_queue< int, VI, greater< int > > PQIMin;
     99 const double EPS = 1e-10;
    100 const LL inf = 0x7fffffff;
    101 const LL infLL = 0x7fffffffffffffffLL;
    102 const LL mod = 1e9 + 7;
    103 const int maxN = 1e3 + 7;
    104 const LL ONE = 1;
    105 const LL evenBits = 0xaaaaaaaaaaaaaaaa;
    106 const LL oddBits = 0x5555555555555555;
    107 
    108 int T, m, n, V;
    109 double level;
    110 
    111 int main(){
    112     //freopen("MyOutput.txt","w",stdout);
    113     //freopen("input.txt","r",stdin);
    114     //INIT();
    115     while(cin >> m >> n) {
    116         if(!m) break;
    117         PQIMin minH;
    118         
    119         For(i, 1, m) {
    120             For(j, 1, n) {
    121                 int x;
    122                 cin >> x;
    123                 minH.push(x);
    124             }
    125         }
    126         minH.push(inf >> 16); // 增加一个无限高的格子 
    127         cin >> V;
    128         
    129         int cnt = 0;
    130         level = minH.top();
    131         
    132         while(minH.top() != inf) {
    133             if(V == 0) break;
    134             ++cnt;
    135             int tmp = minH.top(); minH.pop();
    136             
    137             while(tmp == minH.top()) {
    138                 ++cnt;
    139                 minH.pop();
    140             }
    141             
    142             int v = (minH.top() - tmp) * cnt * 100;
    143             if(V > v) {
    144                 V -= v;
    145                 level = minH.top();
    146             }
    147             else {
    148                 level += 1.0 * V / cnt / 100;
    149                 break;
    150             }
    151         }
    152         
    153         printf("Region %d
    ", ++T);
    154         printf("Water level is %.2f meters.
    ", level);
    155         printf("%.2f percent of the region is under water.
    
    ", 100.0 * cnt / n / m);
    156     }
    157     return 0;
    158 }
    View Code
  • 相关阅读:
    hdu 5646 DZY Loves Partition
    bzoj 1001 狼抓兔子 平面图最小割
    poj 1815 Friendship 最小割 拆点 输出字典序
    spoj 1693 Coconuts 最小割 二者取其一式
    hdu 5643 King's Game 约瑟夫环变形
    约瑟夫环问题
    hdu 5642 King's Order
    CodeForces 631C Report
    1039: C语言程序设计教程(第三版)课后习题9.4
    1043: C语言程序设计教程(第三版)课后习题10.1
  • 原文地址:https://www.cnblogs.com/zaq19970105/p/11047338.html
Copyright © 2011-2022 走看看