Submission #214202

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cmath>
#include <cstdio>
#include <functional>
#include <climits>
#define INF LLONG_MAX
using namespace std;

#define FOR(i,s,e) for (int i = int(s); i != int(e); i++)
#define FORIT(i,c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define ISEQ(c) (c).begin(), (c).end()

int main(void) {
	int H,n,h,a,b,c,d,e;
	cin >> n >> H>> a >> b >> c >> d >> e;

	long long ret = INF;

	for(int i=0;i<n;i++){
		for(int j=i;j<n;j++){
				long long cost = 0;
				h = H;
				for(int l=0;l<n;l++){
					if(l<=i){
						h+=b;
						cost+=a;
					}else if(l<=j){
						h+=d;
						cost+=c;
					}
					else{
						h-=e;
					if (h <= 0) {
						cost = INF;
						break;
					}
					}
				}
				ret = min(ret,cost);
		}
	}
	for(int i=0;i<n;i++){
			for(int j=i;j<n;j++){
					long long cost = 0;
					h = H;
					for(int l=0;l<n;l++){
						if(l<=i){
							h+=d;
							cost+=c;
						}else if(l<=j){
							h+=b;
							cost+=a;
						}
						else{
							h-=e;
						if (h <= 0) {
							cost = INF;
							break;
						}
						}
					}
					ret = min(ret,cost);
			}
		}
	cout << ret << endl;
}

Submission Info

Judge Result