PAT 1018. Public Bike Management (30)

最新推荐文章于 2022-10-29 17:02:22 发布

xuxumoi

最新推荐文章于 2022-10-29 17:02:22 发布

阅读量2.4k

点赞数 2

分类专栏： ZJU_PAT 文章标签： pat c++ 1018

本文链接：https://blog.csdn.net/xsloop/article/details/42215725

版权

ZJU_PAT 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

本题主要考察dfs算法。

//1018. Public Bike Management (30)

//case 3.4.7这三个无法通过是因为：sendBike需要累加。
#include <iostream>
#include <vector>
#include <functional>
using namespace std;

int Cmax, N, Sp, M;
int bikes[505] = {0};
int Road[505][505] = {0};
bool visited[505] = {false};
vector<int> result;
vector<int> CurrResult;
int CurrWei = 0;
int MinWei = 1<<30;
int SendBike = 0;
int GetBike = 0;
int MinSendBike = 1<<30;
int MinGetBike = 1<<30;


void SendAlg1()
{
	int i;
	SendBike = 0;
	GetBike = 0;
	for ( i = 0;i<CurrResult.size();i++)
	{
		if(GetBike + bikes[CurrResult[i]] >= Cmax/2)
		{
			GetBike = GetBike + bikes[CurrResult[i]] - Cmax/2;
		}
		else
		{
			SendBike += Cmax/2 - GetBike - bikes[CurrResult[i]];
			GetBike = 0;
		}
	}
}

void dfs(int curr)
{
	if (curr == Sp)
	{
		SendAlg1();
		if (MinWei > CurrWei ||
			(MinWei == CurrWei && SendBike < MinSendBike) ||
			(MinWei == CurrWei && MinSendBike == SendBike && MinGetBike > GetBike))
		{
			MinSendBike = SendBike;
			MinGetBike = GetBike;
			result = CurrResult;
			MinWei = CurrWei;
		}
		return;
	}
	int i;
	for (i = 0;i<=N;i++)
	{
		if (curr!=i && Road[curr][i] && !visited[i])
		{
			visited[i] = true;
			CurrResult.push_back(i);
			CurrWei += Road[curr][i];
			dfs(i);
			visited[i] = false;
			CurrResult.pop_back();
			CurrWei -= Road[curr][i];
		}
	}
}

int main(void)
{
#ifdef ONLINE_JUDGE
#else	
	freopen("d:\\1.txt", "r", stdin);
	freopen("d:\\2.txt", "w", stdout);
#endif

	int i;
	
	scanf("%d %d %d %d", &Cmax, &N, &Sp, &M);
	for (i = 1;i<=N;i++)
	{
		scanf("%d", &bikes[i]);
	}

	int i1, i2, tmp;
	for (i = 0;i<M;i++)
	{
		scanf("%d %d %d", &i1, &i2, &tmp);
		Road[i1][i2] = tmp;
		Road[i2][i1] = tmp;
	}

	visited[0] = true;
	dfs(0);

	cout << MinSendBike << " 0";
	for (i = 0;i<result.size();i++)
	{
		cout << "->" << result[i];
	}
	cout << " " << MinGetBike;
	return 0;
}