POJ 1208 The Blocks Problem

来源：互联网发布：全球互联网大会知乎编辑：程序博客网时间：2024/06/06 08:57

#include<iostream>#include<cstdio>#include<vector>#include<string>using namespace std;const int maxn=30;int n;vector<int> pile[maxn];void find(int a,int &p,int &h){    for(p=0;p<n;p++)        for(h=0;h<pile[p].size();h++)            if(a==pile[p][h]) return ;}void clear_above(int p,int h){    for(int j=h+1;j<pile[p].size();j++)    {        int b=pile[p][j];        pile[b].push_back(b);    }    pile[p].resize(h+1);}void pile_onto(int p,int h,int p2){    for(int j=h;j<pile[p].size();j++)        pile[p2].push_back(pile[p][j]);    pile[p].resize(h);}void print(){    for(int i=0;i<n;i++)    {        printf("%d:",i);        for(int j=0;j<pile[i].size();j++) printf("% d",pile[i][j]);        printf("\n");    }}int main(){    int a,b;    string s1,s2;    scanf("%d",&n);    for(int i=0;i<n;i++)        pile[i].push_back(i);    while(1)    {        cin>>s1;        if(s1=="quit") break;        cin>>a>>s2>>b;        int pa, pb, ha, hb;        find(a, pa, ha);        find(b, pb, hb);        if(pa == pb) continue;        if(s2=="onto") clear_above(pb,hb);        if(s1=="move") clear_above(pa,ha);        pile_onto(pa,ha,pb);    }    print();    return 0;}

0 0