結果
問題 | No.2020 Sum of Common Prefix Length |
ユーザー | 👑 tute7627 |
提出日時 | 2022-07-22 23:10:41 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 282 ms / 2,000 ms |
コード長 | 15,763 bytes |
コンパイル時間 | 2,879 ms |
コンパイル使用メモリ | 234,224 KB |
実行使用メモリ | 89,404 KB |
最終ジャッジ日時 | 2024-07-04 07:52:13 |
合計ジャッジ時間 | 9,797 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 3 ms
5,376 KB |
testcase_04 | AC | 3 ms
5,376 KB |
testcase_05 | AC | 3 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 82 ms
12,800 KB |
testcase_08 | AC | 83 ms
12,800 KB |
testcase_09 | AC | 97 ms
12,672 KB |
testcase_10 | AC | 80 ms
12,672 KB |
testcase_11 | AC | 84 ms
12,800 KB |
testcase_12 | AC | 82 ms
12,800 KB |
testcase_13 | AC | 80 ms
12,800 KB |
testcase_14 | AC | 86 ms
12,800 KB |
testcase_15 | AC | 147 ms
29,440 KB |
testcase_16 | AC | 156 ms
29,440 KB |
testcase_17 | AC | 145 ms
41,272 KB |
testcase_18 | AC | 125 ms
31,084 KB |
testcase_19 | AC | 127 ms
33,136 KB |
testcase_20 | AC | 209 ms
80,944 KB |
testcase_21 | AC | 261 ms
80,372 KB |
testcase_22 | AC | 244 ms
72,908 KB |
testcase_23 | AC | 237 ms
71,716 KB |
testcase_24 | AC | 273 ms
79,932 KB |
testcase_25 | AC | 282 ms
79,864 KB |
testcase_26 | AC | 127 ms
55,924 KB |
testcase_27 | AC | 2 ms
5,376 KB |
testcase_28 | AC | 116 ms
18,560 KB |
testcase_29 | AC | 119 ms
19,328 KB |
testcase_30 | AC | 113 ms
18,432 KB |
testcase_31 | AC | 198 ms
80,760 KB |
testcase_32 | AC | 210 ms
89,404 KB |
testcase_33 | AC | 138 ms
56,260 KB |
testcase_34 | AC | 155 ms
33,968 KB |
testcase_35 | AC | 163 ms
33,968 KB |
testcase_36 | AC | 150 ms
60,116 KB |
testcase_37 | AC | 173 ms
44,348 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 make_pair(v[i],i)<make_pair(v[j],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 make_pair(v[i],-i)>make_pair(v[j],-j);}); return ord; } template<typename T> vector<T> inv_perm(const vector<T>&ord){ vector<T>inv(ord.size()); for(int i=0;i<ord.size();i++)inv[ord[i]] = i; return inv; } 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<int iden, int size> struct Trie{ struct Node{ array<int, size>nxt; vector<int>idx; int fail, len; Node(int l):fail(0), len(l){ fill(nxt.begin(), nxt.end(), -1); } }; vector<Node>data; Trie(){ data.emplace_back(0); } int add(const string &s, int id=0){ int pos=0; for(int i=0;i<s.size();i++){ int c = s[i] - iden; if(data[pos].nxt[c]==-1){ data[pos].nxt[c]=data.size(); data.emplace_back(i+1); } pos = data[pos].nxt[c]; } data[pos].idx.push_back(id); return pos; } int append(int pos,char cc){ int c = cc - iden; if(data[pos].nxt[c]==-1){ data[pos].nxt[c]=data.size(); data.emplace_back(data[pos].len+1); } pos=data[pos].nxt[c]; return pos; } vector<string>str; void build_str(int pos=0,string s=""){ while(str.size()<=pos)str.push_back(""); str[pos]=s; for(int i=0;i<size;i++){ if(data[pos].nxt[i]!=-1){ build_str(data[pos].nxt[i],s+char(i+iden)); } } } void build_Ahocorasick(){ queue<int>que; for(int i=0;i<size;i++){ if(data[0].nxt[i]!=-1){ data[data[0].nxt[i]].fail=0; que.push(data[0].nxt[i]); } else{ data[0].nxt[i]=0; } } while(!que.empty()){ int pos = que.front(); que.pop(); for(int i=0;i<size;i++){ if(data[pos].nxt[i]!=-1){ data[data[pos].nxt[i]].fail = data[data[pos].fail].nxt[i]; que.push(data[pos].nxt[i]); } else{ data[pos].nxt[i]=data[data[pos].fail].nxt[i]; } } } } vector<int> aho_search(const string &s){ int now=0; vector<int>cnt(data.size()); for(int i=0;i<s.size();i++){ int c = s[i] - iden; now=data[now].nxt[c]; cnt[now]++; } if(sg.empty())suffix_link(); auto dfs=[&](auto &&f,int k)->void{ for(auto to:sg[k]){ f(f,to); cnt[k]+=cnt[to]; } }; dfs(dfs,0); return cnt; } Graph<int> sg; void suffix_link(){ assert(sg.empty()); sg.resize(data.size()); for(int i=1;i<data.size();i++){ sg[data[i].fail].emplace_back(i); } } }; using trie = Trie<'a',26>; template<typename T> struct BIT{ ll n; ll k=1; vector<T>data; BIT() = default; BIT(ll size):n(size){ data.assign(n,0); while(k*2<=n)k*=2; } void add(ll a,T w){ for(ll i=a+1;i<=n;i+=i&-i)data[i-1]+=w; } T sum(ll a){//[0,a) if(a<=0)return 0; T ret = 0; for(ll i=a;i>0;i-=i&-i)ret+=data[i-1]; return ret; } //[a,b) T sum(ll a,ll b){return a>=b?0:sum(b)-sum(a);} T operator[](ll pos){ return sum(pos,pos+1); } ll lower_bound(ll x){ ll ret=0; for(ll i=k;i>0;i/=2){ if(ret+i<=n&&data[ret+i-1]<x){ x-=data[ret+i-1]; ret+=i; } } return ret; } ll lower_first(ll x){ return lower_bound(sum(n)-x+1)-1; } void print(){ for(ll i=0;i<n;i++){ if(i!=0)cout<<" "; cout<<(*this)[i]; } cout<<endl; } }; template<typename T> struct HLD{ using D=long long; int n; vector<int>sz;//部分木サイズ vector<D>dep; vector<int>par; vector<int>head; Graph<T> &g;//隣接リスト vector<edge<T>>edges;//データ構造に乗せるedge列 vector<int>in,out;//[in,out)で部分木、[ina,inb]でa~bのパス(aが上) vector<int>comp;//連結成分の根 //inは頂点のindexを表す。また、edge列の下側の頂点である HLD(Graph<T> &g,int r=-1):g(g),n(g.size()){ hld_build(r); } void hld_build(int root = -1){ in.assign(n,-1);out.assign(n,-1);dep.assign(n,0); par.assign(n,-1);head.assign(n,-1);sz.assign(n,-1);comp.assign(n,-1); edges.assign(n,edge<T>()); if(root == -1){//根がどこでも良い場合(森でも可) for(int i=0;i<n;i++){ if(sz[i] == -1){ head[i] = i; dfs_sz(i, 0, i); dfs_hld(i); } } } else{ head[root] = root; dfs_sz(root, 0, root); dfs_hld(root); } } void dfs_sz(int k, D d,int r){ sz[k] = 1; comp[k] = r; dep[k] = d; for(auto &e: g[k]){ if(e.to == par[k])continue; par[e.to] = k; dfs_sz(e.to, d+e.cost, r); sz[k] += sz[e.to]; if(sz[e.to] > sz[g[k][0].to])swap(e, g[k][0]); } } int time = 0; void dfs_hld(int k){ in[k] = time++; for(auto e:g[k]){ if(e.to == par[k])continue; head[e.to] = (e.to == g[k][0].to ? head[k]: e.to); edges[time] = e; dfs_hld(e.to); } out[k] = time; } int lca(int p,int q){ while(1){ if(in[p] < in[q])swap(p,q); if(head[p] == head[q])return q; p = par[head[p]]; } } vector<pair<int,int>>query_path(int p,int q,bool isEdge){ int r=lca(p,q); vector<pair<int,int>>ret; for(int i=0;i<2;i++){ if(i == 1)swap(p,q); while(1){ if(isEdge&&p==r)break; if(head[p]==head[r]){ ret.emplace_back(in[r]+(isEdge?1:i),in[p]+1); break; } ret.emplace_back(in[head[p]],in[p]+1); p = par[head[p]]; } } return ret; } vector<vector<pair<int,int>>>query_order_path(int p,int q,bool isEdge){ //非可換クエリ用、配列0を順番を反転したデータ構造に、配列1を通常のデータ構造に vector<vector<pair<int,int>>>ret(2); int r=lca(p,q); for(int i=0;i<2;i++){ if(i == 1)swap(p,q); while(1){ if(isEdge&&p==r)break; if(head[p]==head[r]){ if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[r]+(isEdge?1:i))); else ret[i].emplace_back(in[r]+(isEdge?1:i),in[p]+1); break; } if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[head[p]])); else ret[i].emplace_back(in[head[p]],in[p]+1); p = par[head[p]]; } } reverse(ret[1].begin(), ret[1].end()); return ret; } pair<int,int>query_subtree(int p,bool isEdge){ return make_pair(in[p]+isEdge,out[p]); } //uのv方向の子 子孫関係は前もって確認すること(in,outを見る) int child(int u,int v){ while(1){ if(head[u]==head[v]){ v=g[u][0].to; break; } v=head[v]; if(par[v]==u)break; v=par[v]; } return v; } //uをv方向に一つ進めた頂点 int move(int u,int v){ assert(u!=v); if(in[u]<in[v]&&in[v]<out[u])return child(u,v); else return par[u]; } D dist(int u,int v){ return dep[u]+dep[v]-2*dep[lca(u,v)]; } vector<int>rev_in; int climb(int u,int k){ if(rev_in.empty()){ rev_in.resize(n); for(int i=0;i<n;i++)rev_in[in[i]]=i; } int nd=max<int>(dep[u]-k, 0); while(dep[u]>nd){ if(dep[head[u]]>nd){ u=par[head[u]]; } else{ u=rev_in[in[head[u]]+nd-dep[head[u]]]; } } return u; } template<typename I> Graph<T>lca_tree(vector<I>&v){ auto compare=[&](int x,int y){return in[x]<in[y];}; sort(v.begin(),v.end(),compare); int sz1=v.size(); for(int i=0;i<sz1-1;i++)v.push_back(lca(v[i],v[i+1])); sort(v.begin(),v.end(),compare); v.erase(unique(v.begin(),v.end()),v.end()); int sz2=v.size(); Graph<T>ret(sz2); stack<int>st; for(int i=0;i<sz2;i++){ while(!st.empty()&&out[v[st.top()]]<=in[v[i]])st.pop(); if(!st.empty()){ ret[st.top()].emplace_back(i,dep[v[i]]-dep[v[st.top()]]); ret[i].emplace_back(st.top(),dep[v[i]]-dep[v[st.top()]]); } st.push(i); } return ret; } }; int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n;cin>>n; vector<string>s(n); vector<ll>init(n); rep(i,0,n){ cin>>s[i]; init[i]=s[i].size(); } string all; ll q;cin>>q; vector<ll>type(q),tag(q); vector<vector<ll>>idx(n,vector<ll>(1,0)); trie tri; rep(i,0,n){ rep(j,0,init[i]){ idx[i].PB(tri.append(idx[i].back(),s[i][j])); } } rep(i,0,q){ cin>>type[i]>>tag[i];tag[i]--; if(type[i]==1){ char c;cin>>c; s[tag[i]]+=c; idx[tag[i]].PB(tri.append(idx[tag[i]].back(),s[tag[i]].back())); } } Graph<int>tree(tri.data.size()); rep(i,0,tri.data.size()){ for(auto to:tri.data[i].nxt){ if(to!=-1){ tree[i].EB(to,1); } } } HLD hld(tree); vector<ll>now(n); BIT<ll>bit(tree.size()); auto add=[&](ll x){ now[x]++; bit.add(hld.in[idx[x][now[x]]],1); }; rep(i,0,n){ rep(_,0,init[i])add(i); } rep(i,0,q){ if(type[i]==1){ add(tag[i]); } else{ ll ret=0; auto tmp=hld.query_path(0,idx[tag[i]][now[tag[i]]],false); for(auto z:tmp)ret+=bit.sum(z.fi,z.se); cout<<ret<<endl; } } return 0; }