結果
問題 | No.2020 Sum of Common Prefix Length |
ユーザー | leaf_1415 |
提出日時 | 2022-10-27 06:26:23 |
言語 | C++11 (gcc 11.4.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 15,678 bytes |
コンパイル時間 | 2,094 ms |
コンパイル使用メモリ | 142,952 KB |
実行使用メモリ | 185,688 KB |
最終ジャッジ日時 | 2024-07-04 16:59:42 |
合計ジャッジ時間 | 15,463 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 11 ms
27,708 KB |
testcase_01 | AC | 10 ms
23,680 KB |
testcase_02 | AC | 11 ms
23,680 KB |
testcase_03 | AC | 16 ms
24,064 KB |
testcase_04 | AC | 16 ms
24,308 KB |
testcase_05 | AC | 16 ms
24,304 KB |
testcase_06 | AC | 16 ms
24,192 KB |
testcase_07 | AC | 140 ms
27,264 KB |
testcase_08 | AC | 141 ms
27,264 KB |
testcase_09 | AC | 152 ms
27,264 KB |
testcase_10 | AC | 142 ms
27,264 KB |
testcase_11 | AC | 175 ms
27,392 KB |
testcase_12 | AC | 155 ms
27,392 KB |
testcase_13 | AC | 142 ms
27,392 KB |
testcase_14 | AC | 198 ms
27,392 KB |
testcase_15 | AC | 170 ms
28,544 KB |
testcase_16 | AC | 173 ms
28,416 KB |
testcase_17 | AC | 1,098 ms
75,148 KB |
testcase_18 | AC | 863 ms
60,568 KB |
testcase_19 | AC | 899 ms
63,684 KB |
testcase_20 | AC | 1,024 ms
151,304 KB |
testcase_21 | TLE | - |
testcase_22 | TLE | - |
testcase_23 | TLE | - |
testcase_24 | AC | 1,943 ms
145,732 KB |
testcase_25 | AC | 1,887 ms
144,304 KB |
testcase_26 | AC | 515 ms
125,764 KB |
testcase_27 | AC | 11 ms
27,132 KB |
testcase_28 | AC | 152 ms
27,836 KB |
testcase_29 | AC | 154 ms
28,292 KB |
testcase_30 | AC | 152 ms
28,736 KB |
testcase_31 | AC | 914 ms
162,716 KB |
testcase_32 | AC | 831 ms
185,688 KB |
testcase_33 | AC | 542 ms
122,440 KB |
testcase_34 | AC | 275 ms
58,168 KB |
testcase_35 | AC | 317 ms
58,480 KB |
testcase_36 | AC | 641 ms
107,848 KB |
testcase_37 | AC | 402 ms
74,032 KB |
ソースコード
#include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <ctime> #include <cstdlib> #include <cassert> #include <vector> #include <list> #include <stack> #include <queue> #include <deque> #include <map> #include <set> #include <bitset> #include <string> #include <algorithm> #include <utility> #include <complex> #include <array> #include <unordered_set> #include <unordered_map> #define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++) #define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--) #define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++) #define chmin(x, y) (x) = min((x), (y)) #define chmax(x, y) (x) = max((x), (y)) #define sz(x) ((ll)(x).size()) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define outl(...) dump_func(__VA_ARGS__) #define outf(x) cout << fixed << setprecision(16) << (x) << endl #define pb push_back #define fi first #define se second #define inf 2e18 #define eps 1e-9 const double PI = 3.1415926535897932384626433; using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll> P; struct edge{ ll to, cost; edge(){} edge(ll a, ll b){ to = a, cost = b;} }; const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1}; const int mod = 1000000007; //const int mod = 998244353; struct mint{ int x; mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;} mint(const mint &ope) {x = ope.x;} mint operator-(){return mint(-x);} mint operator+(const mint &ope){return mint(x) += ope;} mint operator-(const mint &ope){return mint(x) -= ope;} mint operator*(const mint &ope){return mint(x) *= ope;} mint operator/(const mint &ope){return mint(x) /= ope;} mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;} mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;} mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;} mint& operator/=(const mint &ope){ ll n = mod-2; mint mul = ope; while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;} return *this; } mint inverse(){return mint(1) / *this;} bool operator ==(const mint &ope){return x == ope.x;} bool operator !=(const mint &ope){return x != ope.x;} bool operator <(const mint &ope)const{return x < ope.x;} }; mint modpow(mint a, ll n){ if(n == 0) return mint(1); if(n % 2) return a * modpow(a, n-1); else return modpow(a*a, n/2); } istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope.x = t; return is;} ostream& operator <<(ostream &os, mint &ope){return os << ope.x;} ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;} ll modpow(ll a, ll n, ll mod){ if(n == 0) return 1; if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod; else return modpow((a*a)%mod, n/2, mod) % mod; } vector<mint> fact, fact_inv; void make_fact(int n){ fact.resize(n+1), fact_inv.resize(n+1); fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i); fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1); } mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];} mint perm(int n, int k){ return comb(n, k) * fact[k]; } template<typename T> T comb2(ll n, ll k){ T ret = 1; rep(i, 1, k) ret *= n-k+i, ret /= i; return ret;} vector<int> prime, pvec, qrime; void make_prime(int n){ prime.resize(n+1); rep(i, 2, n){ if(prime[i] == 0) pvec.push_back(i), prime[i] = i; for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;} } } void make_qrime(int n){ qrime.resize(n+1); rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];} } bool exceed(ll x, ll y, ll m){return y > 0 && x >= m / y + 1;} void mark(){ cout << "*" << endl; } void yes(){ cout << "YES" << endl; } void no(){ cout << "NO" << endl; } ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); } ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); } ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;} ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;} ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);} ll lcm(ll a, ll b){return a/gcd(a, b)*b;} ll arith(ll x){return x*(x+1)/2;} ll arith(ll l, ll r){return arith(r) - arith(l-1);} ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;} ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;} string lltos(ll x, ll b = 10){if(x == 0) return "0"; string ret; for(;x;x/=b) ret += x % b + '0'; reverse(all(ret)); return ret;} ll stoll(string &s, ll b = 10){ll ret = 0; for(auto c : s) ret *= b, ret += c - '0'; return ret;} template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());} int popcount(ull x){ x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL); return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56; } template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;} template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;} template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first+t.first, s.second+t.second);} template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first-t.first, s.second-t.second);} template<class T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;} template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;} template<class T> T mdist(pair<T, T> s, pair<T, T> t){return abs(s.first-t.first) + abs(s.second-t.second);} template<class T> T cdist(pair<T, T> s, pair<T, T> t){return max(abs(s.first-t.first), abs(s.second-t.second));} template<class T> T edist2(pair<T, T> s, pair<T, T> t){return (s.first-t.first)*(s.first-t.first) + (s.second-t.second)*(s.second-t.second);} template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;} template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;} template<typename T> ostream& operator << (ostream& os, list<T>& ls){for(auto x : ls) os << x << " "; return os;} template<typename T> ostream& operator << (ostream& os, const list<T>& ls){for(auto x : ls) os << x << " "; return os;} template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i, deq) os << deq[i] << " "; return os;} template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;} template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;} template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;} template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;} template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;} template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;} template<typename T, size_t N> ostream& operator << (ostream& os, array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;} template<typename T, size_t N> ostream& operator << (ostream& os, const array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;} void dump_func(){cout << endl;} template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);} struct Trie{ struct TrieNode{ int num, next[26]; TrieNode(){ num = 0; for(int i = 0; i < 26; i++) next[i] = -1; } }; vector<TrieNode> vec; Trie(){ init(); } void init(){ vec.clear(); vec.push_back(TrieNode()); } int seek(string &s) { int p = 0; for(int i = 0; i < s.size(); i++){ int c = s[i]-'a'; if(vec[p].next[c] == -1){ vec.push_back(TrieNode()); vec[p].next[c] = (int)vec.size()-1; } p = vec[p].next[c]; } return p; } void insert(string &s, int x = 1) { int p = seek(s); vec[p].num += x; } void erase(string &s, int x = 1) { int p = seek(s); vec[p].num = max(0, vec[p].num - x); } int count(string &s) { int p = seek(s); return vec[p].num; } }; struct HLD{ int V, logV; vector<P> mp; map<P, int> mp2; vector<P> parent; //subtree of v is [pre_order[v], back_order[v]] vector<int> pre_order; vector<int> back_order; int order; int global_id, local_id; vector<int> size, depth; vector<vector<int> > prev; HLD(){} void predfs(vector<int> G[], int v, int p, int d) { size[v] = 1, depth[v] = d, prev[v][0] = p; for(int i = 0; i < G[v].size(); i++){ if(G[v][i] == p) continue; predfs(G, G[v][i], v, d+1); size[v] += size[G[v][i]]; } } void maindfs(vector<int> G[], int v, int p) { mp[v] = make_pair(global_id, local_id); mp2[make_pair(global_id, local_id)] = v; pre_order[v] = ++order; if(G[v].size() == 1 && G[v][0] == p){ back_order[v] = order; return; } vector<P> vec; for(int i = 0; i < G[v].size(); i++){ if(G[v][i] == p) continue; vec.push_back(make_pair(size[G[v][i]], G[v][i])); } sort(vec.rbegin(), vec.rend()); local_id++; if(vec.size() >= 1) maindfs(G, vec[0].second, v); for(int i = 1; i < vec.size(); i++){ parent.push_back(mp[v]); global_id++, local_id = 0; maindfs(G, vec[i].second, v); } back_order[v] = order; } int getLCA(int u, int v){ int x = u, y = v; if(depth[y] > depth[x]) swap(x, y); for(int i = logV-1; i >= 0; i--){ if(depth[x] - (1<<i) >= depth[y]) x = prev[x][i]; } if(x == y) return x; for(int i = logV-1; i >= 0; i--){ if(prev[x][i] != prev[y][i]){ x = prev[x][i]; y = prev[y][i]; } } x = prev[x][0]; return x; } void pathcalc(int v, int lca, vector<pair<int, P> > &dest) { int gid = mp[v].first, lid = mp[v].second; int Gid = mp[lca].first, Lid = mp[lca].second; while(Gid != gid){ dest.push_back(make_pair(gid, make_pair(0, lid))); int ngid = parent[gid].first, nlid = parent[gid].second; gid = ngid, lid = nlid; } dest.push_back(make_pair(gid, make_pair(Lid, lid))); } void init(vector<int> G[], int V) // The tree must be undirected and 1-indexed. { this->V = V, logV = 0; for(int t = V; t; t/=2) logV++; prev.resize(V+1); for(int i = 0; i <= V; i++) prev[i].resize(logV); size.resize(V+1), depth.resize(V+1); predfs(G, 1, 0, 0); prev[0][0] = 0; for(int i = 1; i < logV; i++){ for(int j = 1; j <= V; j++){ prev[j][i] = prev[prev[j][i-1]][i-1]; } } mp.resize(V+1), mp2.clear(); parent.clear(), parent.push_back(make_pair(-1, -1)); pre_order.resize(V+1), back_order.resize(V+1); global_id = local_id = 0, order = 0; maindfs(G, 1, 0); } void path(int u, int v, vector<pair<int, P> > &dest) { dest.clear(); int lca = getLCA(u, v); pathcalc(u, lca, dest); pathcalc(v, lca, dest); pair<int, P> p = make_pair(mp[lca].first, make_pair(mp[lca].second, mp[lca].second)); for(int i = 0; i < dest.size(); i++){ if(dest[i] == p){ dest.erase(dest.begin()+i); return ; } } } void getPath(int u, int v, vector<P> &dest) //transform an u-v path into intervals[l, r] on segtree. { vector<pair<int, P> > src; path(u, v, src); dest.clear(); for(int i = 0; i < src.size(); i++){ int u = mp2[make_pair(src[i].first, src[i].second.first)], v = mp2[make_pair(src[i].first, src[i].second.second)]; dest.push_back(make_pair(pre_order[u], pre_order[v])); } } }; struct LazySegTree{ typedef ll SEG; typedef ll DELAY; int size; vector<SEG> seg; vector<DELAY> delay; LazySegTree(){} LazySegTree(int size){ this->size = size; seg.resize(1<<(size+1)); delay.resize(1<<(size+1)); } SEG Ident(){ // return 0; } SEG ope(SEG a, SEG b){ // return a + b; } DELAY NoDelay(){ // return 0; } DELAY merge(DELAY a, DELAY b){ // return a + b; } SEG act(SEG a, DELAY d, int l, int r){ //総和クエリのときは区間幅を乗じる必要がある return a + d*(r-l+1); } void init(){ for(int i = 0; i < (1<<(size+1)); i++){ seg[i] = Ident(); delay[i] = NoDelay(); } } void set(int i, SEG x){ seg[i+(1<<size)] = x; } void setup(){ for(int i = (1<<size)-1; i >= 1; i--) seg[i] = ope(seg[i*2], seg[i*2+1]); } void eval(int l, int r, int k){ if(delay[k] != NoDelay()){ seg[k] = act(seg[k], delay[k], l, r); if(l < r){ delay[k*2] = merge(delay[k*2], delay[k]); delay[k*2+1] = merge(delay[k*2+1], delay[k]); } delay[k] = NoDelay(); } } void update(int i, SEG val){ int l = 0, r = (1<<size)-1, k = 1; eval(l, r, k); for(int j = size-1; j >= 0; j--){ k <<= 1; if(i & (1<<j)){ k++; l = (l+r)/2+1; } else r = (l+r)/2; eval(l, r, k); } seg[i+(1<<size)] = val; l = i, r = i, k = i+(1<<size); for(int j = 0; j < size; j++){ k /= 2, l &= ~(1<<j), r |= 1<<j; eval(l, (l+r)/2, k*2), eval((l+r)/2+1, r, k*2+1); seg[k] = ope(seg[k*2], seg[k*2+1]); } } void add(int a, int b, int k, int l, int r, DELAY val){ eval(l, r, k); if(b < l || r < a) return; if(a <= l && r <= b){ delay[k] = merge(delay[k], val); eval(l, r, k); return; } add(a, b, k*2, l, (l+r)/2, val); add(a, b, k*2+1, (l+r)/2+1, r, val); seg[k] = ope(seg[k*2], seg[k*2+1]); } void add(int a, int b, DELAY val){ if(a > b) return; add(a, b, 1, 0, (1<<size)-1, val); } SEG query(int a, int b, int k, int l, int r){ eval(l, r, k); if(b < l || r < a) return Ident(); if(a <= l && r <= b) return seg[k]; SEG lval = query(a, b, k*2, l, (l+r)/2); SEG rval = query(a, b, k*2+1, (l+r)/2+1, r); return ope(lval, rval); } SEG query(int a, int b){ if(a > b) return Ident(); return query(a, b, 1, 0, (1<<size)-1); } }; ll n, Q; string s[200005]; ll t[200005], x[200005]; char c[200005]; Trie trie; HLD hld; LazySegTree seg; vector<int> G[600005]; ll v[200005]; void dfs(int v){ rep(i, 0, 25){ ll u = trie.vec[v].next[i]; if(u == -1) continue; G[v+1].pb(u+1), G[u+1].pb(v+1), dfs(u); } } void add(int u, int v, int x) { vector<P> res; hld.getPath(u+1, v+1, res); for(auto p : res) seg.add(p.fi, p.se, x); } ll query(int u, int v) { vector<P> res; hld.getPath(u+1, v+1, res); ll ret = 0; for(auto p : res) ret += seg.query(p.fi, p.se); return ret; } int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; rep(i, 1, n) cin >> s[i], trie.insert(s[i]); rep(i, 1, n) v[i] = trie.seek(s[i]); cin >> Q; rep(i, 1, Q){ cin >> t[i] >> x[i]; if(t[i] == 1){ cin >> c[i]; s[x[i]] += c[i]; } } rep(i, 1, n) trie.insert(s[i]); dfs(0); ll m = sz(trie.vec); seg = LazySegTree(digitnum(m+5, 2)); hld.init(G, m), seg.init(); rep(i, 1, n) add(0, v[i], 1); rep(i, 1, Q){ if(t[i] == 1){ add(0, v[x[i]], -1); v[x[i]] = trie.vec[v[x[i]]].next[c[i]-'a']; add(0, v[x[i]], 1); } if(t[i] == 2) cout << query(0, v[x[i]])-n << "\n"; } return 0; }