結果

問題 No.158 奇妙なお使い
コンテスト
ユーザー heno239
提出日時 2020-08-08 14:20:10
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 141 ms / 5,000 ms
コード長 3,900 bytes
コンパイル時間 1,098 ms
コンパイル使用メモリ 115,124 KB
実行使用メモリ 81,792 KB
最終ジャッジ日時 2024-10-01 16:58:51
合計ジャッジ時間 6,586 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 17;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

int dist[11][101][10001];
struct ste {
	int x, y, z;
};

vector<ste> vs[10001];
void solve() {
	rep(i, 11)rep(j, 101)rep(k, 10001) {
		dist[i][j][k] = -mod;
		int sum = i * 1000 + j * 100 + k;
		if (sum <= 10000)vs[sum].push_back({ i,j,k });
	}
	int x, y, z; cin >> x >> y >> z;
	dist[x][y][z] = 0;
	int d[2];
	int c[2][3];
	rep(i, 2) {
		cin >> d[i];
		rep(j, 3)cin >> c[i][j];
	}
	for (int i = 10000; i > 0; i--) {
		for (ste s : vs[i]) {
			int nd = dist[s.x][s.y][s.z];
			if (nd<0)continue;
			nd++;
			rep(id, 2) {
				int x = s.x, y = s.y, z = s.z;
				int a = d[id];
				int m = min(x, a / 1000);
				x -= m;
				a -= 1000 * m;
				m = min(y, a / 100);
				y -= m;
				a -= 100 * m;
				m = min(z, a);
				z -= m;
				a -= m;
				if (a == 0 && x >= 0 && y >= 0 && z >= 0) {
					int nx = x + c[id][0];
					int ny = y + c[id][1];
					int nz = z + c[id][2];
					//cout << "hello " << x << " " << y << " " << z << " " << nx << " " << ny << " " << nz << "\n";
					dist[nx][ny][nz] = max(dist[nx][ny][nz], nd);
				}
			}
		}
	}
	int ans = 0;
	rep(i, 11)rep(j, 101)rep(k, 10001)ans = max(ans, dist[i][j][k]);
	cout << ans << "\n";
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0