• <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久久免费国产特黄| 2021国产成人精品久久| 婷婷久久精品国产| 亚洲精品国产字幕久久不卡| 久久精品国产精品国产精品污| 久久久精品国产免大香伊| 精品一区二区久久久久久久网站| 久久精品国产99国产精品| 亚洲AV日韩AV永久无码久久| 久久99精品国产麻豆宅宅| 欧美久久一级内射wwwwww.| 久久发布国产伦子伦精品| 欧美国产成人久久精品| 国产激情久久久久影院老熟女| 伊人久久大香线蕉av不卡| 久久国产AVJUST麻豆| 久久国产精品免费一区| 亚洲伊人久久大香线蕉苏妲己| 77777亚洲午夜久久多喷| 精品久久久久久久久久久久久久久| 久久偷看各类wc女厕嘘嘘| 伊人 久久 精品| 亚洲乱码日产精品a级毛片久久 | 久久精品综合一区二区三区| 色综合久久中文字幕无码| 国产一区二区久久久| 久久久久无码专区亚洲av| 成人午夜精品久久久久久久小说| av无码久久久久不卡免费网站| 欧洲成人午夜精品无码区久久| 亚洲国产天堂久久久久久| 久久久久国产| 亚洲第一永久AV网站久久精品男人的天堂AV| 久久香蕉国产线看观看99| 办公室久久精品| 久久久久婷婷| 伊人久久无码精品中文字幕|