zoukankan      html  css  js  c++  java
  • 75th LeetCode Weekly Contest Champagne Tower

    We stack glasses in a pyramid, where the first row has 1 glass, the second row has 2 glasses, and so on until the 100th row.  Each glass holds one cup (250ml) of champagne.

    Then, some champagne is poured in the first glass at the top.  When the top most glass is full, any excess liquid poured will fall equally to the glass immediately to the left and right of it.  When those glasses become full, any excess champagne will fall equally to the left and right of those glasses, and so on.  (A glass at the bottom row has it's excess champagne fall on the floor.)

    For example, after one cup of champagne is poured, the top most glass is full.  After two cups of champagne are poured, the two glasses on the second row are half full.  After three cups of champagne are poured, those two cups become full - there are 3 full glasses total now.  After four cups of champagne are poured, the third row has the middle glass half full, and the two outside glasses are a quarter full, as pictured below.

    Now after pouring some non-negative integer cups of champagne, return how full the j-th glass in the i-th row is (both i and j are 0 indexed.)

    Example 1:
    Input: poured = 1, query_glass = 1, query_row = 1
    Output: 0.0
    Explanation: We poured 1 cup of champange to the top glass of the tower (which is indexed as (0, 0)). There will be no excess liquid so all the glasses under the top glass will remain empty.
    
    Example 2:
    Input: poured = 2, query_glass = 1, query_row = 1
    Output: 0.5
    Explanation: We poured 2 cups of champange to the top glass of the tower (which is indexed as (0, 0)). There is one cup of excess liquid. The glass indexed as (1, 0) and the glass indexed as (1, 1) will share the excess liquid equally, and each will get half cup of champange.
    

    Note:

    • poured will be in the range of [0, 10 ^ 9].
    • query_glass and query_row will be in the range of [0, 99].

    cf原题....http://codeforces.com/contest/676/problem/B

    class Solution {
    public:
        double x[120][120];
        double champagneTower(int poured, int query_row, int query_glass) {
            memset(x,0,sizeof(x));
            x[0][0]=poured;
            for(int i=0;i<110;i++){
                for(int j=0;j<=i;j++){
                    if(x[i][j]>1){
                        x[i+1][j]+=(x[i][j]-1.0)/2;
                        x[i+1][j+1]+=(x[i][j]-1.0)/2;
                        x[i][j]=1;
                    }
                }
            }
            return x[query_row][query_glass];
        }
    };
  • 相关阅读:
    magento 产品目录全部修改 :
    zencart 支付流程总结
    去掉 power by ecshop的方法
    ECSHOP实现收货国家省市由选择下拉菜单改为手动
    MYSQL的随机抽取实现方法
    Ecshop中导航栏中使用二级菜单显示并调用子分类
    打包遇到的问题
    jQuery is not defined问题
    实现表格中每行展开收起内容
    jQuery对象与DOM对象的相互转化
  • 原文地址:https://www.cnblogs.com/yinghualuowu/p/8577428.html
Copyright © 2011-2022 走看看