学步园

模拟题，根据题目描述的内容直接写程序就可以。

需要注意的是非法输入的情况：对于a==b或是a和b在同一堆的输入命令直接忽略。

返回 Volume I 索引

返回总索引

// 101_The_Blocks_Problem.cpp : Defines the entry point for the console application.<br /> //</p> <p>#include <set><br /> #include <map><br /> #include <list><br /> #include <queue><br /> #include <stack><br /> #include <vector><br /> #include <string><br /> #include <sstream></p> <p>#include <cstdio><br /> #include <cmath><br /> #include <limits><br /> #include <utility></p> <p>#ifndef ONLINE_JUDGE<br /> #include <fstream><br /> std::ifstream cin("in.txt");<br /> std::ofstream cout("out.txt");<br /> // std::ofstream cout(stdout);<br /> #else<br /> #include <iostream><br /> #endif</p> <p>typedef long long llong;<br /> typedef unsigned long long ullong;<br /> typedef long double ldouble;</p> <p>using namespace std;</p> <p>vector<vector<int> > blocks;<br /> vector<pair<int,int> > position;</p> <p>void returnBlocksOnTopOf(int block)<br /> {<br /> int nStack = position[block].first;<br /> int nOffset = position[block].second;</p> <p> for(int i = nOffset + 1; i < blocks[nStack].size(); ++i)<br /> {<br /> int x = blocks[nStack][i];<br /> blocks[x].push_back(x);<br /> position[x] = make_pair(x, 0);<br /> }</p> <p> blocks[nStack].resize(nOffset + 1);<br /> }</p> <p>void mergeStack(int source, int target)<br /> {<br /> int nSourceStack = position[source].first;<br /> int nSourceOffset = position[source].second;</p> <p> int nTargetStack = position[target].first;<br /> int nTargetOffset = position[target].second;</p> <p> if(nSourceStack != nTargetStack)<br /> {<br /> for(int i = nSourceOffset; i < blocks[nSourceStack].size(); ++i)<br /> {<br /> int x = blocks[nSourceStack][i];<br /> position[x] = make_pair(nTargetStack, blocks[nTargetStack].size());<br /> blocks[nTargetStack].push_back(x);<br /> }</p> <p> blocks[nSourceStack].resize(nSourceOffset);<br /> }<br /> }</p> <p>int main(int argc, char* argv[])<br /> {<br /> int nBlocks;<br /> cin>> nBlocks;</p> <p> blocks.resize(nBlocks);<br /> position.resize(nBlocks);</p> <p> for(int i = 0; i < nBlocks; ++i)<br /> {<br /> blocks[i].push_back(i);<br /> position[i] = make_pair(i, 0);<br /> }</p> <p> for(;;)<br /> {<br /> string command, type;<br /> int source, target;</p> <p> cin>> command;<br /> if(command[0] == 'q')<br /> break;</p> <p> cin>> source>> type>> target;</p> <p> if(source == target || position[source].first == position[target].first)<br /> continue;</p> <p> switch(type[1])<br /> {<br /> case 'n': // onto<br /> returnBlocksOnTopOf(target);<br /> break;</p> <p> case 'v': // over<br /> break;<br /> }</p> <p> switch(command[0])<br /> {<br /> case 'm': // move<br /> returnBlocksOnTopOf(source);<br /> break;</p> <p> case 'p': // pile<br /> break;<br /> }</p> <p> mergeStack(source, target);<br /> }</p> <p> for(int i = 0; i < nBlocks; ++i)<br /> {<br /> cout<< i<< ":";</p> <p> if(blocks[i].size() > 0)<br /> {<br /> for(int j = 0; j < blocks[i].size(); ++j)<br /> cout<< " "<< blocks[i][j];<br /> }</p> <p> cout<< "/n";<br /> }</p> <p> return 0;<br /> }</p> <p>

101 - The Blocks Problem