101 The Blocks Problem

两块砖位置相同时不进行操作

#include <iostream>
#include <vector>
#include <string>

using namespace std;

class Blocks
{
public:
	void ReadBlocks();
	void ComputeBlocks();
	void OutputResult();
private:
	void moveBlocks(const int& iFrom, const int& iTo);
private:
	int m_iNumber = 0;
	vector<string> m_vecCommands;
	vector<int> m_vecFrom;
	vector<string> m_vecOperation;
	vector<int> m_vecTo;
	vector<vector<int>> m_vecBlocks;
	vector<int> m_vecBlocksPosition;
};

void Blocks::ReadBlocks()
{
	cin >> m_iNumber;
	for (int i = 0; i < m_iNumber; ++i)
	{
		vector<int> vecNumber;
		vecNumber.push_back(i);
		m_vecBlocks.push_back(vecNumber);
		m_vecBlocksPosition.push_back(i);
	}
	string strCommand;
	while (true)
	{
		cin >> strCommand;
		if (strCommand.compare("quit") == 0)
		{
			return;
		}
		m_vecCommands.push_back(strCommand);
		int iNumber;
		cin >> iNumber;
		m_vecFrom.push_back(iNumber);
		cin >> strCommand;
		m_vecOperation.push_back(strCommand);
		cin >> iNumber;
		m_vecTo.push_back(iNumber);
	}
}

void Blocks::moveBlocks(const int& iFrom, const int& iTo)
{
	bool isMove = false;
	for (auto it = m_vecBlocks[m_vecBlocksPosition[iFrom]].begin(); it != m_vecBlocks[m_vecBlocksPosition[iFrom]].end();)
	{
		if (isMove)
		{
			int iPosition = 0;
			if (iTo == -1)
			{
				iPosition = *it;
			}
			else
			{
				iPosition = m_vecBlocksPosition[iTo];
			}
			m_vecBlocksPosition[*it] = iPosition;
			m_vecBlocks[iPosition].push_back(*it);
			it = m_vecBlocks[m_vecBlocksPosition[iFrom]].erase(it);
		}
		else
		{
			if (*it == iFrom)
			{
				isMove = true;
				if (iTo != -1)
				{
					m_vecBlocks[m_vecBlocksPosition[iTo]].push_back(iFrom);
					it = m_vecBlocks[m_vecBlocksPosition[iFrom]].erase(it);
					continue;
				}
			}
			++it;
		}
	}
	if (iTo != -1)
	{
		m_vecBlocksPosition[iFrom] = m_vecBlocksPosition[iTo];
	}
}

void Blocks::ComputeBlocks()
{
	for (size_t i = 0; i < m_vecCommands.size(); ++i)
	{
		if (m_vecBlocksPosition[m_vecFrom[i]] != m_vecBlocksPosition[m_vecTo[i]])
		{
			if (m_vecCommands[i].compare("move") == 0)
			{
				if (m_vecOperation[i].compare("onto") == 0)
				{
					this->moveBlocks(m_vecTo[i], -1);
					this->moveBlocks(m_vecFrom[i], m_vecTo[i]);
				}
				else if (m_vecOperation[i].compare("over") == 0)
				{
					this->moveBlocks(m_vecFrom[i], m_vecTo[i]);
				}
			}
			else if (m_vecCommands[i].compare("pile") == 0)
			{
				if (m_vecOperation[i].compare("onto") == 0)
				{
					this->moveBlocks(m_vecTo[i], -1);
					this->moveBlocks(m_vecFrom[i], m_vecTo[i]);
				}
				else if (m_vecOperation[i].compare("over") == 0)
				{
					this->moveBlocks(m_vecFrom[i], m_vecTo[i]);
				}
			}
		}
	}
}


void Blocks::OutputResult()
{
	for (size_t i = 0; i < m_vecBlocks.size(); ++i)
	{
		cout << i << ":";
		for (auto it : m_vecBlocks[i])
		{
			cout << " " << it;
		}
		cout << endl;
	}
}

int main()
{
	Blocks blocks;
	blocks.ReadBlocks();
	blocks.ComputeBlocks();
	blocks.OutputResult();
	return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值