1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr;
typedef double DB;
typedef pair<DB,DB> pdd;
typedef pair<ll,bool> plb;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(5e18)+3;
constexpr ll mod=static_cast<ll>(1e9)+7;
ll N,M,K,Q,T;
set<arr> g[MAXN];
bool vis[MAXN];
ll Base[MAXN];
inline void solve(){
cin>>Q;
set<ll> Hx;
Base[0]=1;
FOR(i,1,MAXN/2){
Base[i]=Base[i-1]*131;
}
ll ans=0;
FOR(q,1,Q){
ll t;string s;
cin>>t>>s;
if(t==1){
ll hax=0;
bool needOp=true;
FOR(i,0,SZ(s)-1){
hax+=s[i]*Base[i];
if(Hx.find(hax)!=Hx.end()){
needOp=false;
break;
}
}
ll len=SZ(s);
if(needOp){
auto itb=g[len-1].lower_bound({hax,0});
auto ite=g[len-1].lower_bound({hax,INF});
for(auto it=itb;it!=ite;++it){
ll que=(*it)[1];
if(vis[que]) continue;
vis[que]=true;
--ans;
}
Hx.insert(hax);
}
cout<<ans<<"\n";
}else{
ll hax=0;
bool needAdd=true;
FOR(i,0,SZ(s)-1){
hax+=s[i]*Base[i];
if(Hx.find(hax)!=Hx.end()){
needAdd=false;
break;
}
}
if(needAdd){
++ans;
ll hax=0;
FOR(i,0,SZ(s)-1){
hax+=s[i]*Base[i];
g[i].insert({hax,q});
}
}
cout<<ans<<"\n";
}
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
solve();
return 0;
}
|