• <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算法程序設(shè)計空間

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

            PKU1925 Spiderman 【DP】

            Posted on 2007-04-05 20:41 oyjpart 閱讀(2326) 評論(2)  編輯 收藏 引用 所屬分類: ACM/ICPC或其他比賽

            Spiderman
            Time Limit:5000MS  Memory Limit:65536K
            Total Submit:1762 Accepted:197

            Description
            Dr. Octopus kidnapped Spiderman's girlfriend M.J. and kept her in the West Tower. Now the hero, Spiderman, has to reach the tower as soon as he can to rescue her, using his own weapon, the web.

            From Spiderman's apartment, where he starts, to the tower there is a straight road. Alongside of the road stand many tall buildings, which are definitely taller or equal to his apartment. Spiderman can shoot his web to the top of any building between the tower and himself (including the tower), and then swing to the other side of the building. At the moment he finishes the swing, he can shoot his web to another building and make another swing until he gets to the west tower. Figure-1 shows how Spiderman gets to the tower from the top of his apartment – he swings from A to B, from B to C, and from C to the tower. All the buildings (including the tower) are treated as straight lines, and during his swings he can't hit the ground, which means the length of the web is shorter or equal to the height of the building. Notice that during Spiderman's swings, he can never go backwards.


            You may assume that each swing takes a unit of time. As in Figure-1, Spiderman used 3 swings to reach the tower, and you can easily find out that there is no better way.

             

            Input
            The first line of the input contains the number of test cases K (1 <= K <= 20). Each case starts with a line containing a single integer N (2 <= N <= 5000), the number of buildings (including the apartment and the tower). N lines follow and each line contains two integers Xi, Yi, (0 <= Xi, Yi <= 1000000) the position and height of the building. The first building is always the apartment and the last one is always the tower. The input is sorted by Xi value in ascending order and no two buildings have the same X value.

            Output
            For each test case, output one line containing the minimum number of swings (if it's possible to reach the tower) or -1 if Spiderman can't reach the tower.

            Sample Input

            2
            6
            0 3
            3 5
            4 3
            5 5
            7 4
            10 4
            3
            0 3
            3 4
            10 4
            

             

            Sample Output

            3
            -1
            

             

            Source
            Beijing 2004 Preliminary@POJ

            這是DP題,根據(jù)坐標(biāo)DP是比較好的選擇,提交中wa多次。經(jīng)回復(fù)指點 才注意到建筑物高度相乘越界了 謝謝提醒了

            //Solution by oyjpArt
            #include <stdio.h>
            #include <math.h>
            #include <string.h>
            const int N = 5010;
            const int M = 1000010;
            int x[N], y[N], dp[M], nb;
            const int MAXINT = 2000000000;
            #define Min(a,b) ((a) < (b) ? (a) : (b))

            int main() {
             int ntc, i, j;
             scanf("%d", &ntc);
             while(ntc--) {
              scanf("%d", &nb);
              for(i = 0; i<nb; i++)  scanf("%d %d", x+i, y+i);
              int m = x[nb-1];
              memset(dp, -1, (m+1)*sizeof(dp[0]));
              dp[x[0]] = 0;
              double h = y[0]; 
              for(i = 1; i<nb; i++) { //以1..i的建筑為中介進(jìn)行飛行
               int d = sqrt(2*y[i]*h - h*h); //不會墜落到地上的最長距離 sqrt(y[i]*y[i]-sqare(y[i]-h))
               for(j = 1; j<=d; j++) { //DP
                if(x[i]-j < x[0]) break; //無用狀態(tài)
                if(dp[x[i]-j] == -1) continue; //不可達(dá)
                int k = x[i]+j < m ? x[i]+j : m;
                if(dp[k] == -1) dp[k] = dp[x[i]-j]+1;
                else dp[k] = Min(dp[k], dp[x[i]-j]+1);
               }//for
              }//for
              printf("%d\n", dp[m]);
             }
             return 0;
            }

            Feedback

            # re: PKU1925 Spiderman 【DP】  回復(fù)  更多評論   

            2007-04-11 15:24 by mark
            int的話相乘后可能越界了

            # re: PKU1925 Spiderman 【DP】  回復(fù)  更多評論   

            2007-04-16 20:53 by oyjpart
            謝謝提醒 呵呵
            亚洲欧洲精品成人久久奇米网| 国产精品久久久福利| 亚洲v国产v天堂a无码久久| 久久婷婷色香五月综合激情| 人妻精品久久无码区| 国产香蕉97碰碰久久人人| 99精品久久精品一区二区| 蜜臀久久99精品久久久久久小说 | 精品久久久久久无码中文字幕 | 久久精品国产色蜜蜜麻豆| 欧美综合天天夜夜久久| 一本色道久久99一综合| 青青热久久国产久精品| 久久国产精品99精品国产987| 中文国产成人精品久久亚洲精品AⅤ无码精品 | 99久久精品国产高清一区二区 | 久久精品综合网| 久久国产免费直播| 日本免费久久久久久久网站| 亚洲伊人久久精品影院| 婷婷久久综合九色综合绿巨人| 九九久久99综合一区二区| 中文无码久久精品| 久久久国产打桩机| 中文字幕无码久久精品青草| 精品久久久久久久中文字幕 | 久久久久久毛片免费看| 狠狠色综合久久久久尤物| 青青草国产精品久久久久| 久久最近最新中文字幕大全| 99精品久久精品| 99久久99久久精品国产| 青青草国产精品久久久久| 品成人欧美大片久久国产欧美... 品成人欧美大片久久国产欧美 | 亚洲AV无码久久精品成人| 亚洲中文字幕无码一久久区| 亚洲精品无码久久久影院相关影片 | 国产亚洲美女精品久久久久狼| 国产欧美久久一区二区| 97久久精品人人澡人人爽| 精品国产一区二区三区久久蜜臀|