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

• 問題: No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木
• ユーザー: HIR180
• 提出日時: 2021-12-22 22:54:08
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 115 ms / 2,000 ms
• コード長: 5,312 bytes
• コンパイル時間: 5,681 ms
• コンパイル使用メモリ: 200,092 KB
• 実行使用メモリ: 9,488 KB
• 最終ジャッジ日時: 2023-10-15 00:52:27
• 合計ジャッジ時間: 10,220 ms
• ジャッジサーバーID （参考情報）: judge15 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	6 ms; 4,348 KB
testcase_01	AC	6 ms; 4,352 KB
testcase_02	AC	6 ms; 4,348 KB
testcase_03	AC	6 ms; 4,356 KB
testcase_04	AC	6 ms; 4,352 KB
testcase_05	AC	6 ms; 4,348 KB
testcase_06	AC	6 ms; 4,348 KB
testcase_07	AC	6 ms; 4,352 KB
testcase_08	AC	6 ms; 4,356 KB
testcase_09	AC	7 ms; 4,356 KB
testcase_10	AC	6 ms; 4,352 KB
testcase_11	AC	6 ms; 4,348 KB
testcase_12	AC	6 ms; 4,352 KB
testcase_13	AC	6 ms; 4,348 KB
testcase_14	AC	23 ms; 4,352 KB
testcase_15	AC	86 ms; 7,856 KB
testcase_16	AC	84 ms; 7,840 KB
testcase_17	AC	16 ms; 4,352 KB
testcase_18	AC	55 ms; 6,008 KB
testcase_19	AC	20 ms; 4,352 KB
testcase_20	AC	63 ms; 6,584 KB
testcase_21	AC	107 ms; 8,960 KB
testcase_22	AC	109 ms; 9,224 KB
testcase_23	AC	29 ms; 4,420 KB
testcase_24	AC	115 ms; 9,488 KB
testcase_25	AC	26 ms; 4,416 KB
testcase_26	AC	21 ms; 4,352 KB
testcase_27	AC	55 ms; 6,040 KB
testcase_28	AC	14 ms; 4,348 KB
testcase_29	AC	11 ms; 4,348 KB
testcase_30	AC	104 ms; 8,952 KB
testcase_31	AC	7 ms; 4,352 KB
testcase_32	AC	11 ms; 4,352 KB
testcase_33	AC	47 ms; 5,352 KB
testcase_34	AC	7 ms; 4,348 KB
testcase_35	AC	6 ms; 4,352 KB
testcase_36	AC	6 ms; 4,348 KB
testcase_37	AC	6 ms; 4,348 KB
testcase_38	AC	6 ms; 4,348 KB
testcase_39	AC	6 ms; 4,352 KB
testcase_40	AC	6 ms; 4,352 KB
testcase_41	AC	6 ms; 4,352 KB

ソースコード

//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
 
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
 
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
 
template<class t> using vc=vector<t>;
 
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}
 
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
	
	size_t operator()(pair<int,int> x)const{
		return operator()(uint64_t(x.first)<<32|x.second);
	}
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;

template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}
ll modpow(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
#define _sz 390005
ll F[_sz],R[_sz];
void make(){
	F[0] = 1;
	for(int i=1;i<_sz;i++) F[i] = F[i-1]*i%mod;
	R[_sz-1] = modpow(F[_sz-1], mod-2);
	for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1) % mod;
}
ll C(int a,int b){
	if(b < 0 || a < b) return 0;
	return F[a]*R[b]%mod*R[a-b]%mod;
}


void solve(){
	vc<int>c(26), lim(26);
	rep(i, 26) cin >> c[i];
	rep(i, 26) c[i] --;
	rep(i, 26) cin >> lim[i];
	int n; cin >> n;
	vc<int>mask(n), a(n), b(n), e(n);
	rep(i, n){
		string s; cin >> s >> a[i] >> b[i] >> e[i];
		a[i] --;
		b[i] --;
		for(auto a:s) mask[i] |= (1<<(a-'A'));
	}
	int max_gain[16] = {};
	rep(i, 26){
		int go[16][16] = {};
		rep(a, 16) rep(b, 16) if(a != b) go[a][b] = -1e18;
		rep(j, n){
			if(((mask[j] >> i)&1)){
				chmax(go[a[j]][b[j]], e[j]);
				chmax(go[b[j]][a[j]], e[j]);
			}
		}
		int just[16][16][25], premax[16][16][25];
		rep(a, 16) rep(b, 16) rep(c, 25){
			just[a][b][c] = premax[a][b][c] = -1e18;
		}
		rep(i, 16){
			rep(j, 16){
				{
					just[i][j][0] = go[i][j];
					premax[i][j][0] = just[i][j][0];
					if(i == j) chmax(premax[i][j][0], 0LL);
				}
			}
		}
		rep(b, 24){
			rep(i, 16){
				rep(j, 16){
					rep(k, 16){
						chmax(just[i][k][b+1], just[i][j][b] + just[j][k][b]);
						chmax(premax[i][k][b+1], premax[i][k][b+1]);
						chmax(premax[i][k][b+1], just[i][j][b] + premax[j][k][b]);
					}
				}
			}
		}
		
		int dp[2][16], tmp[16];
		rep(a, 2) rep(b, 16) tmp[b] = dp[a][b] = -1e18;
		int zan = lim[i];
		dp[0][c[i]] = 0;
		tmp[c[i]] = 0;
		int cur = 0, nxt = 1;
		for(int i=23;i>=0;i--){
			if(zan < (1<<i)) continue;
			zan -= (1<<i);
			rep(b, 16) dp[nxt][b] = -1e18;
			rep(b, 16){
				rep(c, 16){
					chmax(tmp[c], dp[cur][b] + premax[b][c][i]);
					chmax(dp[nxt][c], dp[cur][b] + just[b][c][i]);
				}
			}
			swap(cur, nxt);
		}
		rep(i, 16){
			max_gain[i] += tmp[i];
			if(max_gain[i] < -1e18) max_gain[i] = -1e18;
		}
	}
	int ret = -1e18;
	rep(i, 16) chmax(ret, max_gain[i]);
	if(ret < -1e17){
		o("Impossible");
		return;
	}
	o(ret);
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(100);
	int t; t = 1; //cin >> t;
	while(t--) solve();
	return 0;
}