結果

問題 No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木
ユーザー PCTprobabilityPCTprobability
提出日時 2021-12-09 00:29:41
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 205 ms / 2,000 ms
コード長 6,789 bytes
コンパイル時間 4,915 ms
コンパイル使用メモリ 277,248 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-16 11:28:47
合計ジャッジ時間 10,607 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 3 ms
6,816 KB
testcase_02 AC 11 ms
6,944 KB
testcase_03 AC 19 ms
6,940 KB
testcase_04 AC 17 ms
6,948 KB
testcase_05 AC 13 ms
6,940 KB
testcase_06 AC 14 ms
6,944 KB
testcase_07 AC 15 ms
6,940 KB
testcase_08 AC 17 ms
6,944 KB
testcase_09 AC 16 ms
6,944 KB
testcase_10 AC 15 ms
6,940 KB
testcase_11 AC 15 ms
6,940 KB
testcase_12 AC 11 ms
6,944 KB
testcase_13 AC 9 ms
6,944 KB
testcase_14 AC 143 ms
6,940 KB
testcase_15 AC 188 ms
6,940 KB
testcase_16 AC 176 ms
6,940 KB
testcase_17 AC 145 ms
6,944 KB
testcase_18 AC 159 ms
6,940 KB
testcase_19 AC 138 ms
6,940 KB
testcase_20 AC 169 ms
6,940 KB
testcase_21 AC 197 ms
6,944 KB
testcase_22 AC 205 ms
6,944 KB
testcase_23 AC 160 ms
6,940 KB
testcase_24 AC 194 ms
6,944 KB
testcase_25 AC 137 ms
6,940 KB
testcase_26 AC 135 ms
6,940 KB
testcase_27 AC 173 ms
6,944 KB
testcase_28 AC 149 ms
6,944 KB
testcase_29 AC 141 ms
6,944 KB
testcase_30 AC 202 ms
6,944 KB
testcase_31 AC 140 ms
6,940 KB
testcase_32 AC 126 ms
6,940 KB
testcase_33 AC 162 ms
6,944 KB
testcase_34 AC 2 ms
6,944 KB
testcase_35 AC 82 ms
6,944 KB
testcase_36 AC 2 ms
6,944 KB
testcase_37 AC 83 ms
6,944 KB
testcase_38 AC 104 ms
6,940 KB
testcase_39 AC 112 ms
6,940 KB
testcase_40 AC 105 ms
6,944 KB
testcase_41 AC 116 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int,int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
typedef string::const_iterator State;
class ParseError {};
//const ll mod = 1000000009;
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000000001);
//static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>void print(T a){cout<<a<<endl;}
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
vector<vector<ll>> multi(vector<vector<ll>> &a,vector<vector<ll>> &b){
  vector<vector<ll>> c(a.size(),vector<ll>(b[0].size(),-inf));
  for(int i=0;i<int(a.size());i++){
    for(int k=0;k<int(b.size());k++){
      for(int j=0;j<int(b[0].size());j++){
        if(a[i][k]!=-inf&&b[k][j]!=-inf) chmax(c[i][j],a[i][k]+b[k][j]);
      }
    }
  }
  return c;
}
vector<vector<ll>> mul_exp(vector<vector<ll>> adj, ll k){
  vector<vector<ll>> res(int(adj.size()),vector<ll>(int(adj[0].size()),-inf));
  for(int i=0;i<int(adj.size());i++){
    res[i][i]=0;
  }
  while(k>0){
    if(k&1) res=multi(adj,res);
    adj=multi(adj,adj);
    k/=2;
  }
  return res;
}
vector<vector<ll>> merge(vector<vector<ll>> a,vector<vector<ll>> b){
  for(int i=0;i<a.size();i++){
    for(int j=0;j<a[i].size();j++) chmax(a[i][j],b[i][j]);
  }
  return a;
}
vector<vector<ll>> sumpow(vector<vector<ll>> adj,ll k){
  if(k==0) return mul_exp(adj,0);
  if(k%2){
    // 5 なら {0,1,2} + {0,1,2}*3
    auto v=sumpow(adj,k/2);
    auto v2=mul_exp(adj,(k+1)/2);
    auto v3=multi(v,v2);
    v=merge(v,v3);
    return v;
  }
  else{
    // 6 なら {0,1,2,3} + {0,1,2}*4
  //  auto v=sumpow(adj,k/2);
    auto v2=mul_exp(adj,k/2+1);
    auto v4=sumpow(adj,k/2-1);
    auto v=merge(v4,mul_exp(adj,k/2));
    auto v3=multi(v2,v4);
   // cout<<k<<" "<<v[0][0]<<" "<<v2[0][0]<<" "<<v3[0][0]<<" "<<v4[0][0]<<endl;
    v=merge(v,v3);
    return v;
  }
}
int main() {
  cincout();
  ll n=26;
  vector<ll> a(n),b(n);
  for(int i=0;i<n;i++){
    cin>>a[i];
    a[i]--;
  }
  for(int i=0;i<n;i++){
    cin>>b[i];
  }
  ll q;
  cin>>q;
  vector<vector<vector<ll>>> dp(n,vector<vector<ll>>(16,vector<ll>(16,-inf)));
  for(int i=0;i<n;i++){
    for(int j=0;j<16;j++) dp[i][j][j]=0;
  }
  while(q--){
    string s;
    cin>>s;
    ll p,q;
    cin>>p>>q;
    ll k;
    cin>>k;
    p--;
    q--;
    for(auto e:s){
      chmax(dp[e-'A'][p][q],k);
      chmax(dp[e-'A'][q][p],k);
    }
  }
 /* for(int i=0;i<5;i++){
    for(int j=0;j<16;j++){
      for(int k=0;k<16;k++) cout<<dp[i][j][k]<<" ";
      cout<<endl;
    }
    cout<<endl;
    cout<<endl;
  }*/
  for(int i=0;i<n;i++) dp[i]=sumpow(dp[i],b[i]);
 /* for(int i=0;i<5;i++){
    for(int j=0;j<3;j++){
      for(int k=0;k<3;k++) cout<<dp[i][j][k]<<" ";
      cout<<endl;
    }
    cout<<endl;
    cout<<endl;
  }*/
  ll ans=-inf;
  for(int i=0;i<16;i++){
    ll sum=0;
    for(int j=0;j<n;j++){
      if(dp[j][a[j]][i]<-inf/2){
        sum=-inf;
        break;
      }
      sum+=dp[j][a[j]][i];
    }
   // cout<<i<<" "<<sum<<endl;
    chmax(ans,sum);
  }
  if(ans==-inf){
    cout<<"Impossible"<<endl;
  }
  else{
    cout<<ans<<endl;
  }
}
0