結果

問題 No.2006 Decrease All to Zero
ユーザー heno239heno239
提出日時 2022-07-09 00:04:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 6,941 bytes
コンパイル時間 2,026 ms
コンパイル使用メモリ 155,152 KB
実行使用メモリ 17,152 KB
最終ジャッジ日時 2024-06-09 04:43:07
合計ジャッジ時間 11,865 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
12,032 KB
testcase_01 AC 9 ms
11,720 KB
testcase_02 TLE -
testcase_03 WA -
testcase_04 AC 10 ms
11,976 KB
testcase_05 AC 9 ms
11,776 KB
testcase_06 AC 9 ms
11,720 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 TLE -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#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;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 100005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

const int mn = 5005;
ll dp[mn][3];
ll cop[mn][3];
void solve() {
	int n; cin >> n;
	vector<ll> x(n);
	rep(i, n)cin >> x[i];
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	//ok?
	if (n == 1) {
		if (a[0] == 1) {
			cout << 0 << "\n";
		}
		else {
			cout << -1 << "\n";
		}
		return;
	}
	int ma = 0;
	int sum = 0;
	rep(i, n) {
		chmax(ma, a[i]);
		sum += a[i];
	}
	if (sum - ma < ma - 1) {
		cout << -1 << "\n"; return;
	}
	rep(i, mn)rep(j, 3)dp[i][j] = INF;
	rep(j, 3) {
		if (j <= a[0]) {
			dp[a[0] - j][j] = -2 * x[0] * (a[0] - j)-j*x[0];
		}
	}
	//cout << dp[1][0] << "\n";
	rep1(i, n - 2) {
		ll cx = x[i];
		rep(j, mn)rep(k, 3) {
			cop[j][k] = INF;
		}
		rep(k, 3) {
			rep(x, 3)rep(y, 3) {
				if (x + y + k >= 3)continue;
				int nk = x + y + k;
				int rest = a[i] - x - y;
				if (rest < 0)continue;
				rep(j, mn) {
					if (x > j)continue;
					if (dp[j][k] == INF)continue;
					ll cost = dp[j][k];
					cost += x * cx;
					cost += y * -cx;
					int pj = j-x;
					int pk = k + x;
					//reverse
					rep(ad, rest + 1) {
						if (pk == 0 && pj <= ad)continue;
						if (pk && pj < ad)continue;
						int nj = pj - ad;
						if (nj + pk < rest - ad)continue;
						chmin(cop[nj][nk], cost + 2 * cx * ad);
					}
					//proceed
					rep(ad, rest + 1) {
						if (pj + pk < rest - ad)continue;
						int nj = pj + ad;
						if (nj < mn) {
							chmin(cop[nj][nk], cost - 2 * cx * ad);
						}
					}
				}
			}
		}
		if (i != n - 1)cop[0][0] = INF;
		rep(j, mn)rep(k, 3) {
			dp[j][k] = cop[j][k];
		}
		//cout << dp[0][2] << "\n";
	}
	ll ans = INF;
	ll cx = x[n - 1];
	//cout << dp[0][2] << "\n";
	rep(j, mn)rep(k, 3) {
		int x = 2 - k;
		if (x == 0) {
			if (j + 1 != a[n-1])continue;
			ll val = 2 * cx * a[n - 1] + dp[j][k];
			chmin(ans, val);
		}
		else if (x == 1) {
			if (a[n - 1] < x)continue;
			if (j != a[n - 1]-1)continue;
			ll val = 2 * cx * (a[n - 1] - 1) + cx + dp[j][k];
			chmin(ans, val);
		}
		else {
			if (a[n - 1] < x)continue;
			if (j - 1 != a[n - 1] - 2)continue;
			ll val = 2 * cx * (a[n - 1] - 2) + 2 * cx + dp[j][k];
			chmin(ans, val);
		}
	}
	cout << ans << "\n";
}


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