101 - The Blocks Problem

来源：互联网发布：淘宝里面我的店铺在哪编辑：程序博客网时间：2024/05/17 03:00
#include<stdio.h>#include<algorithm>#include<string>#include<stdlib.h>#include<math.h>#include<ctype.h>#include<string.h>#include<time.h>#include<iostream>#include<sstream>#include<vector>using namespace std;int n;vector<int> pile[30];void search(int a,int &ha,int &pa){    for(pa=0;pa<n;pa++)        for(ha=0;ha<pile[pa].size();ha++)            if(pile[pa][ha]==a) return;}void guiwei(int p,int h){    int i;    for(i=h+1;i<pile[p].size();i++)        pile[pile[p][i]].push_back(pile[p][i]);    pile[p].resize(h+1);}void banyun(int pa,int ha,int pb){    int i;    for(i=ha;i<pile[pa].size();i++)        pile[pb].push_back(pile[pa][i]);    pile[pa].resize(ha);}void printf(){    int i,j;    for(i=0;i<n;i++)    {        printf("%d:",i);        for(j=0;j<pile[i].size();j++)            printf(" %d",pile[i][j]);        printf("\n");    }}int main(){        int i,j,k;        int a,b;        string s1,s2;        cin>>n;        for(i=0;i<n;i++) pile[i].push_back(i);        while(1)        {            cin>>s1;            if(s1=="quit") break;            cin>>a>>s2>>b;            int ha,hb,pa,pb;            search(a,ha,pa);            search(b,hb,pb);            if(pa==pb) continue;            if(s1=="move"&&s2=="onto") {guiwei(pa,ha);guiwei(pb,hb);}            if(s1=="move"&&s2=="over") guiwei(pa,ha);            if(s1=="pile"&&s2=="onto") guiwei(pb,hb);            banyun(pa,ha,pb);        }        printf();    return 0;}
0 0