結果
問題 | No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木 |
ユーザー | 👑 tute7627 |
提出日時 | 2021-12-09 00:17:56 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 73 ms / 2,000 ms |
コード長 | 10,065 bytes |
コンパイル時間 | 2,491 ms |
コンパイル使用メモリ | 213,900 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-16 11:20:09 |
合計ジャッジ時間 | 5,036 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 3 ms
6,940 KB |
testcase_03 | AC | 4 ms
6,944 KB |
testcase_04 | AC | 3 ms
6,940 KB |
testcase_05 | AC | 3 ms
6,948 KB |
testcase_06 | AC | 3 ms
6,944 KB |
testcase_07 | AC | 3 ms
6,940 KB |
testcase_08 | AC | 3 ms
6,940 KB |
testcase_09 | AC | 3 ms
6,948 KB |
testcase_10 | AC | 3 ms
6,944 KB |
testcase_11 | AC | 3 ms
6,940 KB |
testcase_12 | AC | 3 ms
6,944 KB |
testcase_13 | AC | 3 ms
6,944 KB |
testcase_14 | AC | 16 ms
6,944 KB |
testcase_15 | AC | 56 ms
6,940 KB |
testcase_16 | AC | 55 ms
6,940 KB |
testcase_17 | AC | 12 ms
6,944 KB |
testcase_18 | AC | 35 ms
6,940 KB |
testcase_19 | AC | 14 ms
6,944 KB |
testcase_20 | AC | 41 ms
6,944 KB |
testcase_21 | AC | 69 ms
6,940 KB |
testcase_22 | AC | 71 ms
6,944 KB |
testcase_23 | AC | 20 ms
6,944 KB |
testcase_24 | AC | 73 ms
6,940 KB |
testcase_25 | AC | 18 ms
6,940 KB |
testcase_26 | AC | 15 ms
6,940 KB |
testcase_27 | AC | 36 ms
6,944 KB |
testcase_28 | AC | 10 ms
6,940 KB |
testcase_29 | AC | 9 ms
6,944 KB |
testcase_30 | AC | 68 ms
6,944 KB |
testcase_31 | AC | 6 ms
6,940 KB |
testcase_32 | AC | 8 ms
6,940 KB |
testcase_33 | AC | 32 ms
6,940 KB |
testcase_34 | AC | 2 ms
6,940 KB |
testcase_35 | AC | 5 ms
6,944 KB |
testcase_36 | AC | 2 ms
6,944 KB |
testcase_37 | AC | 5 ms
6,944 KB |
testcase_38 | AC | 5 ms
6,944 KB |
testcase_39 | AC | 5 ms
6,944 KB |
testcase_40 | AC | 5 ms
6,940 KB |
testcase_41 | AC | 6 ms
6,944 KB |
ソースコード
//#define _GLIBCXX_DEBUG #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end()) #define spa << " " << #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T> using PQ = priority_queue<T>; template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>; template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}}; template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;}; template<typename T>void debug(const vector<T>&v){debug(v,v.size());} template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());} template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;} template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;} template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;} template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;} template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;} template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;} template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;} template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;} template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;} template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1}; template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));} template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;} template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;} template<typename T>void rearrange(vector<int>&ord, vector<T>&v){ auto tmp = v; for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]]; } template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){ rearrange(ord, head); rearrange(ord, tail...); } template<typename T> vector<int> ascend(const vector<T>&v){ vector<int>ord(v.size());iota(ord.begin(),ord.end(),0); sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];}); return ord; } template<typename T> vector<int> descend(const vector<T>&v){ vector<int>ord(v.size());iota(ord.begin(),ord.end(),0); sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];}); return ord; } ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;} ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;} ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;} ll modulo(ll n,ll d){return (n%d+d)%d;}; template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());} template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());} template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));}; template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());}; //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;}; template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;}; template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;}; template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;}; ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;} ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;} ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;} template< typename T = int > struct edge { int to; T cost; int id; edge():id(-1){}; edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){} operator int() const { return to; } }; template<typename T> using Graph = vector<vector<edge<T>>>; template<typename T> Graph<T>revgraph(const Graph<T> &g){ Graph<T>ret(g.size()); for(int i=0;i<g.size();i++){ for(auto e:g[i]){ int to = e.to; e.to = i; ret[to].push_back(e); } } return ret; } template<typename T> Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){ Graph<T> ret(n); for(int es = 0; es < m; es++){ int u,v; T w=1; cin>>u>>v;u-=indexed,v-=indexed; if(weighted)cin>>w; ret[u].emplace_back(v,w,es); if(!directed)ret[v].emplace_back(u,w,es); } return ret; } template<typename T> Graph<T> readParent(int n,int indexed=1,bool directed=true){ Graph<T>ret(n); for(int i=1;i<n;i++){ int p;cin>>p; p-=indexed; ret[p].emplace_back(i); if(!directed)ret[i].emplace_back(p); } return ret; } template< class T , int maxsize> struct SquareMatrix { using arr = array <T, maxsize>; using sqmat = array <arr, maxsize>; sqmat A; ll n; const T iden = 0;//mulの単位元 const T zero = -INF;//addの単位元 const T add(T x, T y){ return max(x,y); } const T mul(T x, T y){ return x+y; } sqmat zeros(){ sqmat mat; for(ll i=0;i<maxsize;i++)for(ll j=0;j<maxsize;j++)mat[i][j]=zero; return mat; } SquareMatrix() { n = maxsize; A = zeros(); } SquareMatrix(size_t N) : n(N){ A = zeros(); }; SquareMatrix(vector<vector<T>>v):n(v.size()){ for(ll i=0;i<n;i++)for(ll j=0;j<n;j++)A[i][j]=v[i][j]; }; inline const arr &operator[](int k) const { return (A[k]); } inline arr &operator[](int k) { return (A[k]); } static SquareMatrix I(size_t N){ SquareMatrix mat(N); for(int i = 0; i < N; i++) mat[i][i] = mat.iden; return (mat); } SquareMatrix &operator+=(const SquareMatrix &B) { for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) (*this)[i][j] = add((*this)[i][j], B[i][j]); return (*this); } SquareMatrix &operator*=(const SquareMatrix &B) { sqmat C = zeros(); for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) for(int k = 0; k < n; k++) C[i][j] = add(C[i][j],mul((*this)[i][k] , B[k][j])); A.swap(C); return (*this); } SquareMatrix &operator^=(long long k) { SquareMatrix B = SquareMatrix::I(n); while(k > 0) { if(k & 1) B *= *this; *this *= *this; k >>= 1LL; } A.swap(B.A); return (*this); } SquareMatrix operator+(const SquareMatrix &B) const { return (SquareMatrix(*this) += B); } SquareMatrix operator*(const SquareMatrix &B) const { return (SquareMatrix(*this) *= B); } SquareMatrix operator^(const long long k) const { return (SquareMatrix(*this) ^= k); } bool operator==(const SquareMatrix &B)const{ return this->A == B.A; } bool operator!=(const SquareMatrix &B)const{ return this->A != B.A; } SquareMatrix& operator=(const SquareMatrix &b){ this->n=b.n; this->A=b.A; return *this; } friend ostream &operator<<(ostream &os, SquareMatrix p) { for(int i = 0; i < p.n; i++) { os << "["; for(int j = 0; j < p.n; j++) { os << p[i][j] << (j + 1 == p.n ? "]\n" : ","); } } return (os); } }; int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; const ll sz=16; ll m=26; vector<ll>c(m); rep(i,0,m)cin>>c[i],c[i]--; vector<ll>k(m); rep(i,0,m)cin>>k[i]; using SQ=SquareMatrix<ll,sz>; vector<SQ>mat(m,SQ::I(sz)); ll n;cin>>n; rep(i,0,n){ string s; cin>>s; ll a,b,e;cin>>a>>b>>e;a--;b--; for(auto c:s){ chmax(mat[c-'A'][a][b],e); chmax(mat[c-'A'][b][a],e); //cout<<(ll)c-'A' spa a spa b spa e spa mat[c-'A'][a][b]<<endl; } } //cout<<mat[0]<<endl; vector<ll>ret(sz); rep(i,0,m){ mat[i]^=k[i]; //if(i==0)cout<<mat[i]<<endl; rep(j,0,sz){ //cout<<i spa j spa mat[i][c[i]][j]<<endl; ret[j]=max<ll>(-INF,ret[j]+mat[i][c[i]][j]); } } ll mi=-INF; rep(i,0,sz){ chmax(mi,ret[i]); } ans(mi<=-INF/2,"Impossible",mi); return 0; }