uva 101 The Blocks Problem
2016-05-26 18:13
337 查看
#include <cstdio> #include <string> #include <vector> #include <iostream> using namespace std; const int maxn = 30; int n; vector<int> pile[maxn]; //每个pile[i]是一个vector //找木块a所在的pile 和height,以引用的形式返回调用者 void find_block(int a, int& p, int& h) { for(p = 0; p < n; p++) for(h = 0; h < pile[p].size(); h++) if(pile[p][h] == a) return; } //把第p堆高度为h的木块上方的所有木块移回原位 void clear_above(int p, int h) { for(int i = h+1; i < pile[p].size(); i++) { int b = pile[p][i]; pile[b].push_back(b); //把木块b放回原位 } pile[p].resize(h+1); //pile 只应保留下标0~h 的元素 } //把第p堆高度为h及其上方的木块整体移动到p2 堆的顶部 void pile_onto(int p, int h, int p2) { for(int i = h; i < pile[p].size(); i++) pile[p2].push_back(pile[p][i]); 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; cin >> n; string s1, s2; for(int i = 0; i < n; i++) pile[i].push_back(i); while(cin >> s1 >> a >> s2 >> b) { int pa, pb, ha, hb; find_block(a, pa, ha); find_block(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; }
相关文章推荐
- 1.10055 - Hashmat the brave warrior
- 2.10071 - Back to High School Physics
- 3.458 - The Decoder
- 4.694 - The Collatz Sequence
- 6.494 - Kindergarten Counting Game
- 7.490 - Rotating Sentences
- 8.414 - Machined Surfaces
- 9.488 - Triangle Wave
- A.457 - Linear Cellular Automata
- B.489 - Hangman Judge
- C.445 - Marvelous Mazes
- 1.10494 - If We Were a Child Again
- 2.424 - Integer Inquiry
- 3.10250 - The Other Two Trees
- 5.465 - Overflow
- 6.113 - Power of Cryptography
- 7.10161 - Ant on a Chessboard
- 8.621 - Secret Research
- 9.401 - Palindromes
- A.537 - Artificial Intelligence?