TOJ 1644: Cow Acrobats -- 二分，贪心

最新推荐文章于 2020-07-26 19:50:21 发布

randygx

最新推荐文章于 2020-07-26 19:50:21 发布

阅读量581

点赞数

分类专栏： ACM 文章标签： USACO 贪心二分

本文链接：https://blog.csdn.net/randygx/article/details/24811937

版权

ACM 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

1644: Cow Acrobats

Time Limit(Common/Java):1000MS/10000MS Memory Limit:65536KByte
Total Submit: 20 Accepted:9

Description

Farmer John's N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away and join the circus. Their hoofed feet prevent them from tightrope walking and swinging from the trapeze (and their last attempt at firing a cow out of a cannon met with a dismal failure). Thus, they have decided to practice performing acrobatic stunts.

The cows aren't terribly creative and have only come up with one acrobatic stunt: standing on top of each other to form a vertical stack of some height. The cows are trying to figure out the order in which they should arrange themselves within this stack.

Each of the N cows has an associated weight (1 <= W_i <= 10,000) and strength (1 <= S_i <= 1,000,000,000). The risk of a cow collapsing is equal to the combined weight of all cows on top of her (not including her own weight, of course) minus her strength (so that a stronger cow has a lower risk). Your task is to determine an ordering of the cows that minimizes the greatest risk of collapse for any of the cows.

Input

* Line 1: A single line with the integer N.

* Lines 2..N+1: Line i+1 describes cow i with two space-separated integers, W_i and S_i.

Output

* Line 1: A single integer, giving the largest risk of all the cows in any optimal ordering that minimizes the risk.

Sample Input

Sample Output

Hint

OUTPUT DETAILS:

Put the cow with weight 10 on the bottom. She will carry the other two cows, so the risk of her collapsing is 2+3-3=2. The other cows have lower risk of collapsing.

Source

USACO November 2005

分析：一开始感觉贪心可以做，但是有点不放心，还是用二分写的。然后去网上看了看别人的解法，发现贪心真的可以，就不想写了。贪心代码可以看这里。

#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
#include 
        
        
         
         
#include 
         
         
           #include 
           #include 
           
             #include 
            
              #include 
             
               #include 
              
                #include 
               
                 #include 
                
                  #include 
                 
                   #include 
                  
                    #include 
                   
                     #define mp make_pair using namespace std; typedef unsigned int ui; typedef long long ll; typedef unsigned long long ull; typedef pair 
                    
                      pii; typedef vector 
                     
                       vi; typedef vi::iterator vi_it; typedef map 
                      
                        mii; typedef priority_queue 
                       
                         pqi; typedef priority_queue 
                        
                          , greater 
                         
                           > rpqi; const int MAX_N = 50000 + 2; int sum[MAX_N]; int cow[MAX_N]; struct COW { int weight; int strength; bool operator < (const COW &c) const { return weight + strength > c.weight + c.strength; } } cw[MAX_N]; bool check(int n, int k) { int pos = 1; while (pos <= n && cow[pos] >= sum[n] - sum[pos - 1] - k) { pos = upper_bound(cow + pos, cow + n + 1, sum[n] - sum[pos - 1] - k, greater 
                          
                            ()) - cow; } return pos > n; } int main(int argc, char *argv[]) { // freopen("D:\\in.txt", "r", stdin); int n, i; cin >> n; for (i = 1; i <= n; ++i) { scanf("%d%d", &cw[i].weight, &cw[i].strength); } sort(cw + 1, cw + n + 1); for (i = 1; i <= n; ++i) { sum[i] = sum[i - 1] + cw[i].weight; cow[i] = cw[i].weight + cw[i].strength; } int low = -1000000000, high = 500000000, mid; while (low < high) { mid = (low + high) >> 1; if (check(n, mid)) { high = mid; } else { low = mid + 1; } } cout << low << endl; return 0; }