• <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>

            技術,瞎侃,健康,休閑……

            mahu@cppblog 人類的全部才能無非是時間和耐心的混合物
            posts - 11, comments - 13, trackbacks - 0, articles - 12
              C++博客 :: 首頁 :: 新隨筆 :: 聯系 :: 聚合  :: 管理

            The Blocks Problem

            Posted on 2006-06-10 01:16 mahudu@cppblog 閱讀(888) 評論(1)  編輯 收藏 引用 所屬分類: C/C++

            Background?

            Many areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robotics (STRIPS) used a block world in which a robot arm performed tasks involving the manipulation of blocks.

            In this problem you will model a simple block world under certain rules and constraints. Rather than determine how to achieve a specified state, you will ``program'' a robotic arm to respond to a limited set of commands.

            The Problem?

            The problem is to parse a series of commands that instruct a robot arm in how to manipulate blocks that lie on a flat table. Initially there are n blocks on the table (numbered from 0 to n-1) with block bi adjacent to block bi+1 for all $0 \leq i < n-1$ as shown in the diagram below:
            ?
            \begin{figure}
\centering
\setlength{\unitlength}{0.0125in} %
\begin{picture}
(2...
...raisebox{0pt}[0pt][0pt]{$\bullet
\bullet \bullet$ }}}
\end{picture}
\end{figure}
            Figure: Initial Blocks World

            The valid commands for the robot arm that manipulates blocks are:

            • move a onto b

              where a and b are block numbers, puts block a onto block b after returning any blocks that are stacked on top of blocks a and b to their initial positions.

            • move a over b

              where a and b are block numbers, puts block a onto the top of the stack containing block b, after returning any blocks that are stacked on top of block a to their initial positions.

            • pile a onto b

              where a and b are block numbers, moves the pile of blocks consisting of block a, and any blocks that are stacked above block a, onto block b. All blocks on top of block b are moved to their initial positions prior to the pile taking place. The blocks stacked above block a retain their order when moved.

            • pile a over b

              where a and b are block numbers, puts the pile of blocks consisting of block a, and any blocks that are stacked above block a, onto the top of the stack containing block b. The blocks stacked above block a retain their original order when moved.

            • quit

              terminates manipulations in the block world.

            Any command in which a = b or in which a and b are in the same stack of blocks is an illegal command. All illegal commands should be ignored and should have no affect on the configuration of blocks.

            The Input?

            The input begins with an integer n on a line by itself representing the number of blocks in the block world. You may assume that 0 < n < 25.

            The number of blocks is followed by a sequence of block commands, one command per line. Your program should process all commands until the quit command is encountered.

            You may assume that all commands will be of the form specified above. There will be no syntactically incorrect commands.

            The Output?

            The output should consist of the final state of the blocks world. Each original block position numbered i ( $0 \leq i < n$ where n is the number of blocks) should appear followed immediately by a colon. If there is at least a block on it, the colon must be followed by one space, followed by a list of blocks that appear stacked in that position with each block number separated from other block numbers by a space. Don't put any trailing spaces on a line.

            There should be one line of output for each block position (i.e., n lines of output where n is the integer on the first line of input).

            Sample Input?

            10
            move 9 onto 1
            move 8 over 1
            move 7 over 1
            move 6 over 1
            pile 8 over 6
            pile 8 over 5
            move 2 over 1
            move 4 over 9
            quit

            Sample Output?

             0: 0
            1: 1 9 2 4
            2:
            3: 3
            4:
            5: 5 8 7 6
            6:
            7:
            8:
            9:

            Solution

            #include?<stdio.h>
            #define?MAXB?100?????????????????????/*?maximum?number?of?blocks?*/
            ????
            typedef?
            struct?block{
            ????
            struct?block?*above;
            ????
            struct?block?*below;
            ????
            int?index;
            }
            ?block;

            block?blocks[MAXB];??????????????????
            /*?storage?for?the?blocks?*/
            block?
            *table[MAXB];??????????????????/*?pointers?to?each?block?*/
            int?numBlocks;?????????????????????????/*?the?actual?number?of?blocks?*/


            void?InitBlocks()
            /*?initially?table[i]?-->?blocks[i],?one?block?per?stack?*/?????
            {
            ????
            int?i;
            ????
            for(i=0;i<numBlocks;i++){
            ????blocks[i].index?
            =?i;
            ????blocks[i].above?
            =?(block?*)?NULL;
            ????blocks[i].below?
            =?(block?*)?NULL;
            ????table[i]?
            =?&blocks[i];
            ????}

            }



            block?
            *BlockTop(int?n)
            /*?return?a?pointer?to?the?block?on?top?of?the?stack?in?which?block?*/
            /*?n?is?located?*/?????
            {
            ????block?
            *temp?=?table[n];

            ????
            while?(temp->above?!=?(block?*)?NULL){
            ????temp?
            =?temp->above;
            ????}

            ????
            return?temp;
            }



            void?ClearStackAbove(int?n)
            /*?return?all?blocks?stacked?above?block?n?to?their?original?spot?*/?????
            {
            ????block?
            *top,*next;

            ????top?
            =?BlockTop(n);
            ????
            while?(top?!=?table[n]){??????/*?until?we?reach?block?n?*/
            ????next?
            =?top->below;

            ????
            /*?unlink?block?from?stack?*/
            ????top
            ->above?=?(block?*)?NULL;
            ????top
            ->below?=?(block?*)?NULL;
            ????
            ????top?
            =?next;
            ????}

            ????table[n]
            ->above?=?(block?*)?NULL;
            }


            void?MoveOnto(int?n,int?k)
            {
            ????ClearStackAbove(n);
            ????ClearStackAbove(k);
            ????table[k]
            ->above?=?table[n];????????/*?move?n?onto?k?*/
            ????
            if?(table[n]->below)??????????????/*?be?safe?when?relinking?*/
            ????table[n]
            ->below->above?=?(block?*)?NULL;
            ????table[n]
            ->below?=?table[k];
            }


            void?PileOnto(int?n,int?k)
            {
            ????ClearStackAbove(k);
            ????table[k]
            ->above?=?table[n];????????????/*?move?n?onto?k??*/
            ????
            if?(table[n]->below)????????/*?be?safe?when?relinking?*/
            ????table[n]
            ->below->above?=?(block?*)?NULL;
            ????table[n]
            ->below?=?table[k];
            }


            int?IsOver(int?n,int?k)
            /*?return?1?if?block?n?is?"over"?block?k?(same?stack),?else?0?*/?????
            {
            ????block?
            *temp;

            ????temp?
            =?table[k];
            ????
            while?(temp){
            ????
            if?(temp->index?==?n)
            ????????
            return?1;
            ????temp?
            =?temp->above;
            ????}

            ????
            return?0;
            }


            ????
            void?MoveOver(int?n,int?k)
            {
            ????block?
            *top;
            ????
            ????ClearStackAbove(n);
            ????top?
            =?BlockTop(k);????????????/*?top?of?block?k's?stack?*/
            ????top
            ->above?=?table[n];
            ????
            if?(table[n]->below)????????????/*?be?safe?when?relinking?*/
            ????table[n]
            ->below->above?=?(block?*)?NULL;
            ????table[n]
            ->below?=?top;
            }


            void?PileOver(int?n,int?k)
            {
            ????block?
            *top;
            ????
            ????top?
            =?BlockTop(k);????????????/*?top?of?block?k's?stack?*/
            ????top
            ->above?=?table[n];????
            ????
            if?(table[n]->below)????????????/*?be?safe?when?relinking?*/
            ????table[n]
            ->below->above?=?(block?*)?NULL;????
            ????table[n]
            ->below?=?top;
            }


            main()
            {

            ????
            char?ch;
            ????
            int?n,k;
            ????block?
            *bottom;
            ????
            char?b1[10],b2[10];???????????????/*?b1?=?move/pile,?b2?=?onto/over?*/
            ????
            char?*w1?=?&b1[0];
            ????
            char?*w2?=?&b2[0];

            ????scanf(
            "%d\n",&numBlocks);
            ????InitBlocks();
            ????
            while?(1){
            ????scanf(
            "%s",w1);
            ????
            if?(w1[0]?==?'q')???/*?quit??*/
            ????????
            break;
            ????scanf(
            "%d?%s?%d\n",&n,w2,&k);

            ????
            /*?is?command?a?legal?command??*/
            ????
            if?(n?==?k?||?IsOver(k,n)?||?IsOver(n,k)){
            ????????
            continue;
            ????}

            ????
            ????
            switch?(w1[0]){
            ??????
            case?'m':
            ????????
            switch?(w2[1]){
            ??????????
            case?'n':????/*?onto?*/
            ????????MoveOnto(n,k);
            ????????
            break;
            ??????????
            case?'v':????/*?over?*/
            ????????MoveOver(n,k);
            ????????
            break;
            ??????????
            default:
            ????????fprintf(stderr,
            "illegal?command?%s\n",w2);
            ????????}

            ????????
            break;
            ??????
            case?'p':
            ????????
            switch?(w2[1]){
            ??????????
            case?'n':????/*?onto?*/
            ????????PileOnto(n,k);
            ????????
            break;
            ??????????
            case?'v':????/*?over?*/
            ????????PileOver(n,k);
            ????????
            break;
            ??????????
            default:
            ????????fprintf(stderr,
            "illegal?command?%s\n",w2);
            ????????}

            ????????
            break;
            ??????
            default:
            ????????fprintf(stderr,
            "illegal?command?%s\n",w2);
            ????}

            ????}


            ????
            /*?print?stacks?*/
            ????
            ????
            for(k=0;k<numBlocks;k++){
            ????printf(
            "%2d:?",k);

            ????
            /*?is?block?in?another?stack?,?if?so,?nothing?to?print?*/
            ????
            ????
            if?(table[k]->below?!=?(block?*)?NULL){
            ????????printf(
            "\n");
            ????}

            ????
            else{
            ????????bottom?
            =?table[k];
            ????????
            while?(bottom){
            ????????printf(
            "?%d",bottom->index);
            ????????bottom?
            =?bottom->above;
            ????????}

            ????????printf(
            "\n");
            ????}

            ????}

            ????
            }

            Feedback

            # re: The Blocks Problem[未登錄]  回復  更多評論   

            2007-05-31 16:05 by Joe
            最近在做電子商務的翻譯,不知道The Blocks Problem 是什么意思?怎么這里也沒有中文解釋啊!好不郁悶!
            久久99久久99小草精品免视看| 97r久久精品国产99国产精| 成人午夜精品久久久久久久小说| 99久久精品午夜一区二区| 国产精品无码久久久久| 无码乱码观看精品久久| 久久影院亚洲一区| 久久久久亚洲av无码专区导航 | 亚洲级αV无码毛片久久精品| 亚洲中文字幕久久精品无码APP| 青青青青久久精品国产h| 亚洲人成无码网站久久99热国产| 精品久久久久久久无码| 久久噜噜久久久精品66| 久久久久高潮毛片免费全部播放| 久久久精品国产Sm最大网站| 久久偷看各类wc女厕嘘嘘| 性做久久久久久免费观看| 国产精品久久久久久久| 亚洲综合伊人久久大杳蕉| 久久久久亚洲精品无码网址| 日本免费久久久久久久网站| 熟妇人妻久久中文字幕| 久久久亚洲裙底偷窥综合| 久久久99精品一区二区| 久久精品国产一区二区三区日韩| 中文字幕无码免费久久| 狠狠色丁香婷婷久久综合| 久久久久国产| 精品欧美一区二区三区久久久| 国产精品久久久久…| 嫩草伊人久久精品少妇AV| 日产精品久久久久久久| 亚洲另类欧美综合久久图片区| 久久国产三级无码一区二区| 国产视频久久| 久久精品国产亚洲Aⅴ香蕉| 久久精品国产精品亚洲下载| 久久国产三级无码一区二区| 青青热久久国产久精品| 亚洲国产成人精品无码久久久久久综合 |