zoukankan      html  css  js  c++  java
  • UVa 101 The Blocks Problem Vector基本操作

    UVa 101 The Blocks Problem

    一道纯模拟题

    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 nblocks 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:

     
    egin{figure}centeringsetlength{unitlength}{0.0125in} %egin{picture}(2......raisebox{0pt}[0pt][0pt]{$ulletullet ullet$ }}}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 aretain 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:



     1 /*UVa 101 The Blocks Problem*/
     2 #include<bits/stdc++.h>
     3 #include<vector>
     4 #include<string>
     5 using namespace std;
     6 int n;
     7 vector<int> p[50];
     8 string s1,s2;
     9 void clearp(int p1,int h1){
    10     for(int i=h1+1;i<p[p1].size();i++){
    11         int b=p[p1][i];
    12         p[b].push_back(b);
    13     }
    14     p[p1].resize(h1+1);
    15     return;
    16 }
    17 void fd(int a,int &p1,int &h1){
    18     for(p1=0;p1<n;p1++)
    19       for(h1=0;h1<p[p1].size();h1++){
    20           if(p[p1][h1]==a)return;
    21       }
    22     return;
    23 }
    24 void pile_onto(int p1,int h1,int p2){
    25     for(int i=h1;i<p[p1].size();i++)
    26         p[p2].push_back(p[p1][i]);
    27     p[p1].resize(h1);
    28     return;
    29 }
    30 int main(){
    31     int a,b;
    32 //    scanf("%d
    ",&n);
    33     cin>>n;
    34     int i,j;
    35     for(i=0;i<n;i++) p[i].push_back(i);//初始化格子 
    36     int pa,pb,ha,hb;//a、b木块的水平位置和高度 
    37 //    while(cin>> s1 >> a >> s2 >> b){
    38     while(cin>>s1){
    39         if(s1=="quit")break;
    40         cin>>a;cin>>s2;cin>>b;
    41 //        cout<<"te:"<<s1<<"  "<<s2;
    42         fd(a,pa,ha);fd(b,pb,hb);
    43         if(pa==pb)continue;
    44         if(s1=="move") clearp(pa,ha);
    45         if(s2=="onto") clearp(pb,hb);
    46         
    47         pile_onto(pa,ha,pb);
    48     }
    49     //print
    50     for(i=0;i<n;i++){
    51         printf("%d:",i);
    52         for(j=0;j<p[i].size();j++) printf(" %d",p[i][j]);
    53         printf("
    ");
    54     }
    55     return 0;
    56 }
    本文为博主原创文章,转载请注明出处。
  • 相关阅读:
    【java】浅谈java内部类
    【java】java反射初探 ——“当类也学会照镜子”
    【java】关于java类和对象,你想知道的在这里!
    【javascript】谈谈HTML5: Web-Worker、canvas、indexedDB、拖拽事件
    【Vue】Vue中的父子组件通讯以及使用sync同步父子组件数据
    【javascript】详解变量,值,类型和宿主对象
    【javascript】异步编年史,从“纯回调”到Promise
    [转] golang 字符串比较是否相等
    because its MIME type ('text/html') is not a supported stylesheet MIME type, and strict MIME checkin
    desktoplayer.exe病毒及d:w7rtmasewcpsilmerged tu tsystem.cpp的解决方案
  • 原文地址:https://www.cnblogs.com/SilverNebula/p/5550607.html
Copyright © 2011-2022 走看看