您好,欢迎来到年旅网。
搜索
您的当前位置:首页adv汽车油

adv汽车油

来源:年旅网

1

#include<iostream>
using namespace std;

int m[5];
int s[5];
int energy[5];
int min = 9999;
int index;
int E, D = 0;
void init()
{
	cin >> E >> D;//输入汽油E和距离D
	for (int i = 0; i < 5; i++)//输入5种交通工具对应的每公里时间以及耗油量
	{
		cin >> m[i] >> s[i] >> energy[i];
	}
}

void dfs(int dex, int tempE, int tempD, int time)
{
	if (tempD == 0)
	{
		if (time < min)
		{
			min = time;
		}
		return;
	}

	for (int i = dex; i < 5; i++)
	{
		if (tempE - energy[i] < 0)
			continue;
		dfs(dex, tempE - energy[i], tempD - 1, time + m[i] * 60 + s[i]);
		dex++;
	}

}
int main()
{
	int T;
	cin >> T;
	for (int test_case = 1; test_case <= T; test_case++)
	{
		min = 9999;
		index = 0;
		init();
		dfs(index, E, D, 0);
		cout << "#" << test_case << " " << min / 60 << " " << min % 60 << endl;;
	}
	return 0;
}	

2

#define _CRT_SECURE_NO_WARNINGS	// Ignore build errors when using unsafe functions in Visual Studio.
#include <stdio.h>


struct pace{
	int m;
	int s;
	int energy;
};
int h, d;
struct pace pace[5];
int minresult = 999999999;
int index = 0;


void DFS(int dex, int now_energy, int now_dis, int t){
	if (now_dis == 0){
		if (minresult > t){
			minresult = t;
		}
		return;
	}
	for (int i = dex; i < 5; i++){
		if (now_energy - pace[i].energy < 0)
			continue;

		DFS(dex, now_energy - pace[i].energy, now_dis - 1, t + pace[i].m * 60 + pace[i].s);
		dex++;
	}
}

int main(void)
{
	int test_case;
	int T;
	int r_m, r_s;
	//freopen("sample_input.txt", "r", stdin);

	scanf("%d", &T);
	for (test_case = 1; test_case <= T; test_case++)
	{
		minresult = 999999999;
		index = 0;
		scanf("%d%d", &h, &d);
		for (int i = 0; i < 5; i++){
			scanf("%d%d%d", &pace[i].m, &pace[i].s, &pace[i].energy);
		}
		DFS(index, h, d, 0);
		r_m = minresult / 60;
		r_s = minresult % 60;

		printf("#%d %d %d\n", test_case, r_m, r_s);
	}
	return 0;
}

样例输入

5
130 30
4 50 7
5 0 5
5 10 4
5 20 3
5 30 2
91 30
4 50 7
5 0 5
5 10 4
5 20 3
5 30 2
100 20
3 30 11
3 50 5
4 10 3
4 30 2
4 50 1
10 5
6 19 6
6 29 5
6 39 4
6 49 3
6 59 2
600 40
3 11 20
3 18 16
3 36 14
3 41 13
3 53 12

因篇幅问题不能全部显示,请点此查看更多更全内容

Copyright © 2019- oldu.cn 版权所有 浙ICP备2024123271号-1

违法及侵权请联系:TEL:199 1889 7713 E-MAIL:2724546146@qq.com

本站由北京市万商天勤律师事务所王兴未律师提供法律服务