結果

問題 No.2020 Sum of Common Prefix Length
ユーザー MtSakaMtSaka
提出日時 2022-07-10 20:59:23
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 264 ms / 2,000 ms
コード長 7,496 bytes
コンパイル時間 2,570 ms
コンパイル使用メモリ 217,292 KB
実行使用メモリ 100,176 KB
最終ジャッジ日時 2024-06-23 11:12:22
合計ジャッジ時間 10,538 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 3 ms
6,944 KB
testcase_04 AC 3 ms
6,944 KB
testcase_05 AC 3 ms
6,940 KB
testcase_06 AC 3 ms
6,940 KB
testcase_07 AC 146 ms
13,056 KB
testcase_08 AC 142 ms
13,056 KB
testcase_09 AC 147 ms
13,184 KB
testcase_10 AC 148 ms
13,056 KB
testcase_11 AC 147 ms
13,184 KB
testcase_12 AC 147 ms
13,056 KB
testcase_13 AC 145 ms
13,056 KB
testcase_14 AC 150 ms
13,184 KB
testcase_15 AC 186 ms
30,220 KB
testcase_16 AC 187 ms
30,220 KB
testcase_17 AC 182 ms
46,788 KB
testcase_18 AC 165 ms
36,020 KB
testcase_19 AC 166 ms
37,916 KB
testcase_20 AC 227 ms
95,800 KB
testcase_21 AC 256 ms
87,288 KB
testcase_22 AC 252 ms
82,928 KB
testcase_23 AC 242 ms
81,636 KB
testcase_24 AC 258 ms
94,968 KB
testcase_25 AC 264 ms
94,144 KB
testcase_26 AC 158 ms
61,144 KB
testcase_27 AC 1 ms
6,944 KB
testcase_28 AC 167 ms
18,664 KB
testcase_29 AC 175 ms
19,172 KB
testcase_30 AC 172 ms
18,416 KB
testcase_31 AC 217 ms
92,864 KB
testcase_32 AC 222 ms
100,176 KB
testcase_33 AC 182 ms
61,668 KB
testcase_34 AC 206 ms
35,516 KB
testcase_35 AC 187 ms
35,520 KB
testcase_36 AC 202 ms
67,160 KB
testcase_37 AC 203 ms
47,992 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "library/template/template.hpp"
//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define overload4(a,b,c,d,e,...) e
#define overload3(a,b,c,d,...) d
#define rep1(a) for(ll i=0;i<(ll)(a);i++)
#define rep2(i,a) for(ll i=0;i<(ll)(a);i++)
#define rep3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep4(i,a,b,c) for(ll i=(ll)(a);i<(ll)(b);i+=(ll)(c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(a) for(ll i=(ll)(a)-1;i>=0;i--)
#define rrep2(i,a) for(ll i=(ll)(a)-1;i>=0;i--)
#define rrep3(i,a,b) for(ll i=(ll)(b)-1;i>=(ll)(a);i--)
#define rrep(...) overload3(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define fore(...) for (auto&& __VA_ARGS__)
#define all1(i) begin(i),end(i)
#define all2(i,a) begin(i),begin(i)+a
#define all3(i,a,b) begin(i)+a,begin(i)+b
#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)
#define rall(n) (n).rbegin(),(n).rend()
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
#define pb push_back
#define eb emplace_back
#define END(...) {print(__VA_ARGS__);return;}
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using vl=vector<ll>;
using vi=vector<int>;
using vs=vector<string>;
using vc=vector<char>;
using vvl=vector<vl>;
using pi=pair<int,int>;
using pl=pair<ll,ll>;
using vvc=vector<vc>;
using vd=vector<double>;
using vp=vector<pl>;
using vb=vector<bool>;
constexpr int dx[8]={1,0,-1,0,1,-1,-1,1};
constexpr int dy[8]={0,1,0,-1,1,1,-1,-1};
constexpr ll MOD=1000000007;
constexpr ll mod=998244353;
constexpr ld EPS=1e-8;
constexpr ld PI=3.1415926535897932384626;
template<typename T,typename U>
ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T,typename U>
istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T>
ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>
istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
void scan(){}
template<class Head,class... Tail>
void scan(Head&head,Tail&... tail){cin>>head;scan(tail...);}
template<class T>
void print(const T &t){cout<<t<<'\n';}
template<class Head, class... Tail>
void print(const Head &head, const Tail &... tail){cout<<head<<' ';print(tail...);}
template<class... T>
void fin(const T &... a){print(a...);exit(0);}
template<typename T,typename U>
inline bool chmax(T&a,U b){return a<b&&(a=b,true);}
template<typename T,typename U>
inline bool chmin(T&a,U b){return a>b&&(a=b,true);}
template<typename T>
class infinity{
  public:
  static constexpr T MAX=numeric_limits<T>::max();
  static constexpr T MIN=numeric_limits<T>::min();
  static constexpr T value=numeric_limits<T>::max()/2;
  static constexpr T mvalue=numeric_limits<T>::min()/2;
};
#if __cplusplus <= 201402L
template<class T>constexpr T infinity<T>::value;
template<class T>constexpr T infinity<T>::mvalue;
template<class T>constexpr T infinity<T>::MAX;
template<class T>constexpr T infinity<T>::MIN;
#endif
template<typename T>constexpr T INF=infinity<T>::value;
constexpr long long inf=INF<ll>;
inline int popcnt(ull x){
#if __cplusplus>=202002L
return popcount(x);
#endif
x=(x&0x5555555555555555)+((x>>1)&0x5555555555555555);x=(x&0x3333333333333333)+((x>>2)&0x3333333333333333);x=(x&0x0f0f0f0f0f0f0f0f)+((x>>4)&0x0f0f0f0f0f0f0f0f);x=(x&0x00ff00ff00ff00ff)+((x>>8)&0x00ff00ff00ff00ff);x=(x&0x0000ffff0000ffff)+((x>>16)&0x0000ffff0000ffff);return (x&0x00000000ffffffff)+((x>>32)&0x00000000ffffffff);
}
template<typename T,typename=void>
struct is_specialize:false_type{};
template<typename T>
struct is_specialize<T,typename conditional<false,typename T::iterator, void>::type>:true_type{};
template<typename T>
struct is_specialize<T,typename conditional<false,decltype(T::first),void>::type>:true_type{};
template<typename T>
struct is_specialize<T,enable_if_t<is_integral<T>::value,void>>:true_type{};
void dump(const char&t){cerr<<t;}
void dump(const string&t){cerr<<t;}
void dump(const bool&t){cerr<<(t?"true":"false");}
template <typename T,enable_if_t<!is_specialize<T>::value,nullptr_t> =nullptr>
void dump(const T&t){cerr<<t;}
template<typename T>
void dump(const T&t,enable_if_t<is_integral<T>::value>* =nullptr){string tmp;if(t==infinity<T>::value||t==infinity<T>::MAX)tmp="inf";if(is_signed<T>::value&&(t==infinity<T>::mvalue||t==infinity<T>::MIN))tmp="-inf";if(tmp.empty())tmp=to_string(t);cerr<<tmp;}
template<typename T,typename U>
void dump(const pair<T,U>&);
template<typename T>
void dump(const T&t,enable_if_t<!is_void<typename T::iterator>::value>* =nullptr){cerr<<"{";for(auto it=t.begin();it!=t.end();){dump(*it);cerr<<(++it==t.end()?"":",");}cerr<<"}";}
template<typename T,typename U>
void dump(const pair<T,U>&t){cerr<<"(";dump(t.first);cerr<<",";dump(t.second);cerr<<")";}
void trace(){cerr<<endl;}
template<typename Head,typename... Tail>
void trace(Head&&head,Tail&&... tail){dump(head);if(sizeof...(tail))cerr<<",";trace(forward<Tail>(tail)...);}
#ifdef ONLINE_JUDGE
#define debug(...) (void(0))
#else
#define debug(...) do{cerr<<#__VA_ARGS__<<"=";trace(__VA_ARGS__);}while(0)
#endif
struct IOSetup{IOSetup(){cin.tie(nullptr);ios::sync_with_stdio(false);cout.tie(0);cout<<fixed<<setprecision(12);cerr<<fixed<<setprecision(12);}};
template<class F>struct REC{F f;REC(F&&f_):f(std::forward<F>(f_)){}template<class...Args>auto operator()(Args&&...args)const{return f(*this, std::forward<Args>(args)...);}};
/**
 * @brief Template(テンプレート)
*/
#line 2 "library/Data_Structure/BIT.hpp"
template<typename T>
struct BIT{
  private:
  int N;
  vector<T>bit;
  public:
  BIT(int n){
    N=1;
    while(N<n)N<<=1;
    bit=vector<T>(N+1,0);
  }
  void add(int i,T x){
    i++;
    while(i<=N){
      bit[i]+=x;
      i+=i&-i;    
    }
  }
  T sum(int i){
    T ans=0;
    while(i>0)ans+=bit[i],i-=i&-i;
    return ans;
  }
  T query(int l,int r){
    return sum(r)-sum(l);
  }
};
/**
 * @brief Binary Indexed Tree(BIT)
*/
#line 3 "code.cpp"
int main(){
  LL(n);
  vs s(n);
  cin>>s;
  auto t=s;
  LL(q);
  vl qt(q),qx(q);
  vc qc(q);
  rep(i,q){
    scan(qt[i],qx[i]);
    qx[i]--;
    if(qt[i]==1)cin>>qc[i];
  }
  rep(i,q){
    if(qt[i]==1){
      t[qx[i]]+=qc[i];
    }
  }
  vvl idx(n);
  vvl node(1,vl(26,-1));
  rep(i,n){
    ll now=0;
    for(const auto&c:t[i]){
      if(node[now][c-'a']==-1){
        node[now][c-'a']=node.size();
        node.emplace_back(vl(26,-1));
      }
      now=node[now][c-'a'];
      idx[i].eb(now);
    }
  }
  BIT<ll>bit(2*node.size());
  vl in(node.size()),out(node.size());
  ll time=0;
  auto dfs=REC([&](auto&&f,ll u)->void{
    in[u]=time++;
    rep(i,26)if(node[u][i]!=-1){
      f(node[u][i]);
    }
    out[u]=time++;
  });
  dfs(0);
  rep(i,n)rep(j,s[i].size()){
    bit.add(in[idx[i][j]],1);
    bit.add(out[idx[i][j]],-1);
  }
  rep(i,q){
    if(qt[i]==1){
      bit.add(in[idx[qx[i]][s[qx[i]].size()]],1);
      bit.add(out[idx[qx[i]][s[qx[i]].size()]],-1);
      s[qx[i]]+=qc[i];
    }
    else{
      ll ans=bit.query(0,in[idx[qx[i]][s[qx[i]].size()-1]]+1);
      print(ans);
    }
  }
}
0