#724666 (C++17) No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木

提出ソース

結果

問題	No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木
ユーザー	heno239
提出日時	2021-12-17 17:18:16
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,177 bytes
コンパイル時間	2,444 ms
コンパイル使用メモリ	162,796 KB
実行使用メモリ	24,724 KB
最終ジャッジ日時	2024-09-14 18:30:33
合計ジャッジ時間	6,714 ms
ジャッジサーバーID （参考情報）	judge6 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	20 ms 11,592 KB
testcase_01	AC	21 ms 11,588 KB
testcase_02	AC	20 ms 11,724 KB
testcase_03	AC	21 ms 11,844 KB
testcase_04	AC	21 ms 11,592 KB
testcase_05	AC	20 ms 11,716 KB
testcase_06	AC	21 ms 11,720 KB
testcase_07	AC	21 ms 11,720 KB
testcase_08	AC	21 ms 11,592 KB
testcase_09	AC	21 ms 11,592 KB
testcase_10	AC	21 ms 11,724 KB
testcase_11	AC	21 ms 11,720 KB
testcase_12	AC	21 ms 11,716 KB
testcase_13	AC	21 ms 11,716 KB
testcase_14	AC	55 ms 13,384 KB
testcase_15	AC	191 ms 21,164 KB
testcase_16	AC	189 ms 20,936 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	50 ms 13,000 KB
testcase_20	AC	143 ms 18,364 KB
testcase_21	AC	238 ms 23,740 KB
testcase_22	AC	241 ms 23,956 KB
testcase_23	AC	68 ms 14,148 KB
testcase_24	WA	-
testcase_25	AC	63 ms 13,772 KB
testcase_26	WA	-
testcase_27	AC	124 ms 17,224 KB
testcase_28	AC	37 ms 12,360 KB
testcase_29	AC	30 ms 11,916 KB
testcase_30	AC	232 ms 23,192 KB
testcase_31	WA	-
testcase_32	WA	-
testcase_33	AC	109 ms 16,452 KB
testcase_34	AC	21 ms 11,592 KB
testcase_35	AC	20 ms 11,720 KB
testcase_36	AC	21 ms 11,592 KB
testcase_37	AC	21 ms 11,716 KB
testcase_38	AC	21 ms 11,716 KB
testcase_39	AC	21 ms 11,592 KB
testcase_40	AC	20 ms 11,720 KB
testcase_41	AC	21 ms 11,596 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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 = 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;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-4;
const ld pi = acosl(-1.0);

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

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

const int bb = 100;
ll dp[16][bb+1];
ll cost[16][16];
void solve() {
	vector<int> col(26);
	rep(i, 26) {
		cin >> col[i]; col[i]--;
	}
	vector<int> num(26);
	rep(i, 26) {
		cin >> num[i];
	}
	int n; cin >> n;
	vector<string> s(n);
	vector<int> a(n), b(n), e(n);
	rep(i, n) {
		cin >> s[i] >> a[i] >> b[i] >> e[i];
		a[i]--; b[i]--;
	}
	vector<ll> ans(16);
	vector<bool> ban(16);
	rep(i, 26) {
		rep(j, 16)rep(k,bb+1) {
			dp[j][k] = -INF;
		}
		dp[col[i]][0] = 0;
		rep(j, 16)rep(k, 16) {
			cost[j][k] = -INF;
		}
		rep(j, n) {
			bool exi = false;
			for (char c : s[j])if (c == 'A' + i)exi = true;
			if (exi) {
				chmax(cost[a[j]][b[j]], (ll)e[j]);
				chmax(cost[b[j]][a[j]], (ll)e[j]);
			}
		}
		rep(k, bb)rep(j, 16) {
			rep(to, 16) {
				chmax(dp[to][k + 1], dp[j][k] + cost[j][to]);
			}
		}
		
		rep(j, 16) {
			ll val = dp[j][0];
			rep(k, min(bb+1, num[i]+1)) {
				chmax(val, dp[j][k]);
			}
			if (num[i] <= bb) {
				if (val <= -INF / 2) {
					ban[j] = true;
				}
				else {
					ans[j] += val;
				}
			}
			else {
				if (val <= -INF / 2) {
					ban[j] = true;
				}
				else {
					for (int c = bb-1; c <= bb; c++) {
						if (dp[j][c] <= -INF / 2)continue;
						int dif = (num[i] - c) / 2;
						ll val2 = dp[j][c] + (dp[j][c] - dp[j][c - 2]) * dif;
						chmax(val, val2);
					}
					ans[j] += val;
				}
			}
		}
	}
	ll res = -INF;
	rep(j, 16) {
		if (ban[j])continue;
		chmax(res, ans[j]);
	}
	if (res == -INF) {
		cout << "Impossible" << "\n";
	}
	else {
		cout << res << "\n";
	}
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(8);
	init_f();
	//init();
	//while(true)
	//expr();
	//init();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード