【Codeforces】 487A Fight the Monster

最新推荐文章于 2015-03-20 17:24:22 发布

yysys

最新推荐文章于 2015-03-20 17:24:22 发布

阅读量482

点赞数

分类专栏： Codeforces 文章标签： Codeforces

本文链接：https://blog.csdn.net/blankcqk/article/details/41384007

版权

Codeforces 专栏收录该内容

58 篇文章 0 订阅

订阅专栏

注意暴力的上届不要取小了。。。还有暴力的姿势要对。。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 1005
#define maxm 1000005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

int h1, a1, d1;
int h2, a2, d2;
int t1, t2, t3;

void read(void)
{
	scanf("%d%d%d", &h1, &a1, &d1);
	scanf("%d%d%d", &h2, &a2, &d2);
	scanf("%d%d%d", &t1, &t2, &t3);
}

void work(void)
{
	int ans = INF;
	for(int i = 0; i <= 200; i++) {
		for(int j = 0; j <= 200; j++) {
			if(a1 + i <= d2) continue;
			if(a2 <= d1 + j) {
				ans = min(ans, t2 * i + t3 * j);
				continue;
			}
			else {
				int t = h2 / (a1 + i - d2);
				if(h2 % (a1 + i - d2) != 0) t++;
				t = t * (a2 - d1 - j);
				if(t < h1) ans = min(ans, t2 * i + t3 * j);
				else ans = min(ans, t2 * i + t3 * j + (t - h1 + 1) * t1);
			}
		}
	}
	printf("%d\n", ans);
}

int main(void)
{
	read();
	work();

	return 0;
}