• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            oyjpArt ACM/ICPC算法程序設計空間

            // I am new in programming, welcome to my blog
            I am oyjpart(alpc12, 四城)
            posts - 224, comments - 694, trackbacks - 0, articles - 6

            終于發現自己G題Accelarator的錯誤了 找了好久好久 就這個錯誤 讓我在整個后半段的比賽中幾乎廢掉了 太不應該了!
            吸取教訓!在場上出現自己無法找出錯誤的情況 應該要讓隊友重寫

            #include <stdio.h>
            #include <string.h>
            #include <math.h>

            const int N = 100010;
            int d[N];
            __int64 d2[N];
            int na, av, np;

            bool check(int x) {
             int i;
             for(i = 0; i < np; i++) d2[i] = d[i];
             for(i = 0; i < np; i++) d2[i] -= x;
             int cnt = 0;
             __int64 rest = na*x; 左邊寫了__int64 右邊卻忘記轉成__int64了
             for(i = 0; i<np; i++) {
              if(d2[i] > 0) {
               if(av <= 0) return false;
               __int64 need = (d2[i]-1)/av + 1;
               if(need > rest || need > x) return false;
               rest -= need;
              }
             }
             return 1;
            }

            int main() {
             int ntc, i;
             scanf("%d", &ntc);
             while(ntc--) {
              scanf("%d", &np);
              int _max = -1;
              for(i = 0; i<np; i++) {
               scanf("%d", d + i);
               if(d[i] > _max) _max = d[i];
              }
              scanf("%d %d", &na, &av);
              av--;
              int lo = 0, hi = _max;
              while(lo < hi) {
               int mid = lo + (hi-lo)/2;
               if(check(mid)) hi = mid;
               else lo = mid+1;
              }
              if(check(lo)) printf("%d\n", lo);
             }
             return 0;
            }

              
            Accelerator
            Time Limit:4000MS  Memory Limit:65536K
            Total Submit:811 Accepted:142

            Description


            Shiming (alpc02) is a boy likes to play PopKart very much. He is a good rider in this game. And one day he thought that he became a team leader of a team of N Kart riders.

            Today, after the game begins, the riders of his team are now at different places at the racetrack, for that some of the riders got some short cut.

            However, we know actually how long has each rider left to run along, and they will ride actually one meter per one time unit (maybe 10ms).

            Luckily, Shiming now gets M accelerators, the accelerator can help one rider to ride k meters per one time unit. And all the accelerators are as the same. But one rider can't use more than one accelerator at one time unit.

            Shiming is the team leader, and he wants all the team members to finish in the minimal time not just the fastest one to finish the race. He will distribute all the accelerators to the riders.

            Note: Here some rules are not as the same as the game we played. At a time unit, Shiming distributes the accelerators to riders for one rider one accelerator, and at the next time unit, all the accelerator can be reused, and Shiming can re-distributes all the accelerators to riders also for one rider one accelerator and the distribution is no relationship with the last time unit.

            So you will program to help Shiming to get the actually minimal time the team will use to finish the race.


            Input


            The input file has T (1<T<20) test cases, and the first line of the file will show the T.

            Each of test cases, will be the N (1<= N <= 100000) rider, and N numbers Ai (1<= Ai <= 10^8) show how long will the rider have to finish the race. And the M and the K (1<= K*M <=10^8) for the accelerators.


            Output
            For each of test cases print a single integer on a single line, the minimal possible number of time units required to finish the race all team.

            Sample Input


            2
            3
            2 3 9
            1 5
            3
            2 3 6
            1 5


            Sample Output


            3
            2

            Feedback

            # re: 終于發現自己G題Accelarator的錯誤了  回復  更多評論   

            2007-05-10 22:29 by
            bless,我也是錯在這個上。

            # re: 終于發現自己G題Accelarator的錯誤了  回復  更多評論   

            2007-05-11 12:25 by oyjpart
            這么巧啊 同bless
            久久精品无码专区免费青青| 久久精品水蜜桃av综合天堂 | 99久久这里只精品国产免费 | 久久99国产精品成人欧美| 久久久久久av无码免费看大片| 亚洲国产高清精品线久久| 久久久久亚洲AV无码专区体验| 99久久婷婷国产综合亚洲| 精品久久人人妻人人做精品| 亚洲国产成人精品久久久国产成人一区二区三区综 | 国产高清美女一级a毛片久久w| 久久精品日日躁夜夜躁欧美| 日韩一区二区久久久久久| 久久久久久曰本AV免费免费| 91精品国产综合久久久久久| 久久丫精品国产亚洲av| 久久久久亚洲精品日久生情 | 精品视频久久久久| 久久久亚洲欧洲日产国码二区| 国产高潮国产高潮久久久91 | 国产一区二区精品久久岳| 久久久久久国产精品免费无码| 久久久久久久国产免费看| 99热成人精品热久久669| 日本精品一区二区久久久| 久久久久久久尹人综合网亚洲 | 亚洲国产精品成人AV无码久久综合影院| 久久久久久夜精品精品免费啦| 欧美久久久久久精选9999| 国产伊人久久| 热99re久久国超精品首页| 国产亚洲欧美精品久久久| 亚洲国产精品无码久久| 久久综合给久久狠狠97色| 久久国内免费视频| 人妻无码精品久久亚瑟影视 | 99久久精品免费看国产| 国产精品欧美久久久久无广告| 久久er99热精品一区二区| 综合网日日天干夜夜久久| 国产∨亚洲V天堂无码久久久|