// competitive-verifier: PROBLEM #include #include #include /** * @brief Trie * * @tparam char_size 文字種 * @tparam base * * @see https://algo-logic.info/trie-tree/ * @see https://atcoder.jp/contests/tenka1-2016-final-open/tasks/tenka1_2016_final_c * * Usage: * Trie<26, 'a'> trie; * Trie<96, ' '> trie; */ template struct Trie { private: struct _node { std::vector next_node; _node() : next_node(char_size, -1) {} }; public: using node_type = _node; Trie() : root(0), nodes() { nodes.emplace_back(); } int size() const { return nodes.size(); } std::vector insert(const std::string &word) { std::vector res; int node_id = 0; for (int i = 0; i < (int)word.size(); ++i) { int c = word[i] - base; int &next_id = nodes[node_id].next_node[c]; if (next_id == -1) { next_id = nodes.size(); nodes.emplace_back(); } node_id = next_id; res.emplace_back(node_id); } return res; } int search_id(const std::string &word) { int node_id = 0; for (int i = 0; i < (int)word.size(); ++i) { int c = word[i] - base; int &next_id = nodes[node_id].next_node[c]; if (next_id == -1) return -1; node_id = next_id; } return node_id; } node_type get_node(int node_id) const { assert(0 <= node_id && node_id < (int)nodes.size()); return nodes[node_id]; } private: int root; std::vector nodes; }; #ifdef ATCODER #pragma GCC target("sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2") #endif #pragma GCC optimize("Ofast,fast-math,unroll-all-loops") #include #ifndef ATCODER #pragma GCC target("sse4.2,avx2,bmi2") #endif template constexpr bool chmax(T &a, const U &b) { return a < (T)b ? a = (T)b, true : false; } template constexpr bool chmin(T &a, const U &b) { return (T)b < a ? a = (T)b, true : false; } constexpr std::int64_t INF = 1000000000000000003; constexpr int Inf = 1000000003; constexpr double EPS = 1e-7; constexpr double PI = 3.14159265358979323846; #define FOR(i, m, n) for (int i = (m); i < int(n); ++i) #define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i) #define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i) #define rep(i, n) FOR (i, 0, n) #define repn(i, n) FOR (i, 1, n + 1) #define repr(i, n) FORR (i, n, 0) #define repnr(i, n) FORR (i, n + 1, 1) #define all(s) (s).begin(), (s).end() struct Sonic { Sonic() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(20); } constexpr void operator()() const {} } sonic; using namespace std; using ll = std::int64_t; using ld = long double; template std::istream &operator>>(std::istream &is, std::pair &p) { return is >> p.first >> p.second; } template std::istream &operator>>(std::istream &is, std::vector &v) { for (T &i : v) is >> i; return is; } template std::ostream &operator<<(std::ostream &os, const std::pair &p) { return os << '(' << p.first << ',' << p.second << ')'; } template std::ostream &operator<<(std::ostream &os, const std::vector &v) { for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? "" : " ") << *it; return os; } template void co(Head &&head, Tail &&...tail) { if constexpr (sizeof...(tail) == 0) std::cout << head << '\n'; else std::cout << head << ' ', co(std::forward(tail)...); } template void ce(Head &&head, Tail &&...tail) { if constexpr (sizeof...(tail) == 0) std::cerr << head << '\n'; else std::cerr << head << ' ', ce(std::forward(tail)...); } void Yes(bool is_correct = true) { std::cout << (is_correct ? "Yes\n" : "No\n"); } void No(bool is_not_correct = true) { Yes(!is_not_correct); } void YES(bool is_correct = true) { std::cout << (is_correct ? "YES\n" : "NO\n"); } void NO(bool is_not_correct = true) { YES(!is_not_correct); } void Takahashi(bool is_correct = true) { std::cout << (is_correct ? "Takahashi" : "Aoki") << '\n'; } void Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); } int main(void) { int q; cin >> q; vector l(500001), r(500001); Trie<26, 'a'> trie; int ans = 0; while (q--) { int t; string s; cin >> t >> s; if (t == 1) { auto v = trie.insert(s); for (auto x : v) { ans -= l[x]; r[x] = 1; } } else { auto v = trie.insert(s); int k = 1; for (auto x : v) { k &= r[x] == 0; } ans += k; l[v.back()] += k; } co(ans); } return 0; }