Submission #65261443

---

Source Code Expand

// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4")
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
 
// #define _GLIBCXX_DEBUG
// #define _GLIBCXX_DEBUG_PEDANTIC
 
#include <iomanip>
#include <cassert>
#include <iostream>
#include <vector>
#include <random>
#include <algorithm>
#include <map>
#include <set>
#include <functional>
#include <array>
#include <numeric>
#include <queue>
#include <deque>
#include <bitset>
#include <cmath>
#include <climits>
#include <cstdint>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/rope>
 
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;

 
const int MOD = 998244353;
const long double PI = 3.141592653589793;
using ll = long long;
const ll INF = 1e18;
 
// #define int ll

// --------> sashko123`s defines:

#define itn int     //Vasya sorry :(
#define p_b push_back
#define fi first
#define se second
#define pii std::pair<int, int>
#define oo LLONG_MAX
#define big INT_MAX
#define elif else if

int input()
{
    int x;
    cin >> x;
    return x;
}

// ----------> end of sashko123`s defines (thank you Vasya <3)

// template<typename K, typename V>
// using hash_table = cc_hash_table<K, V, hash<K>>;

// template<typename T>
// using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;



template<int N = (int)1e6 + 1>
struct trie {
	struct node {
		int cnt = 0;
		int terminate = 0;
		array<int, 27> links;
	
		node() {
			links.fill(-1);
			cnt = 0;
		}
	};

	array<node, N> tree;  
	int sz = 0;
	int root = 0;

	trie() {
		root = sz++;
	}

	void add(string s) {
		int cur = root;
		tree[cur].cnt++;
		for (int i = 0; i < s.size(); i++) {
			int nxt = tree[cur].links[s[i] - 'a'];
			if (nxt == -1) {
				nxt = sz++;
				tree[cur].links[s[i] - 'a'] = nxt;
			}
			tree[nxt].cnt++;
			cur = nxt;
		}
		tree[cur].terminate++;
	}
	int count(string s) const {
		int cur = root;
		for (int i = 0; i < s.size(); i++) {
			int nxt = tree[cur].links[s[i] - 'a'];
			if (nxt == -1) {
				return 0;
			}
			
			cur = nxt;
			if (tree[cur].terminate)
				return 1;
		}
		return 0;
	}

	void remove(string s) {
		int cur = root;
		tree[cur].cnt--;
		for (int i = 0; i < s.size(); i++) {
			int nxt = tree[cur].links[s[i] - 'a'];
			assert(nxt != -1);
			tree[nxt].cnt--;
			cur = nxt;
		}
		tree[cur].terminate--;
	}

	int get_cnt_of_str(const string& s) {
		int cur = root;
		int total = 0;
		vector<int> path;
		for (int i = 0; i < s.size(); i++) {
			int nxt = tree[cur].links[s[i] - 'a'];
			if (nxt == -1) {
				return 0;
			}
			path.push_back(cur);
			cur = nxt;
		}
		total = tree[cur].cnt;
		
		tree[cur].cnt = 0;
		tree[cur].terminate = 0;
		tree[cur].links.fill(-1);

		for (auto i: path) {
			tree[i].cnt -= total;
		}

		return total;
	}


	void clear() {
		for (int i = 0; i < sz; i++)
			tree[i] = node();
	}
};
trie s1, s2;

void solve() {
	int n;
	cin >> n;
	int ans = 0;
	int total = 0;
	for (int i = 0; i < n; i++) {
		int t;
		cin >> t;
		if (t == 1) {
			string x;
			cin >> x;
			ans += s1.get_cnt_of_str(x);
			s2.add(x);
		} else {
			total++;
			string s;
			cin >> s;
			if (s2.count(s)) {
				ans += 1;
			} else {
				s1.add(s);
			}
		}
		cout << total - ans << "\n";
	}
}	
 
int32_t main(int32_t argc, const char * argv[]) {
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    // insert code here...

    int tt= 1;
    // std::cin >> tt;
	for (int t = 1; t <= tt; t++) {
		// cout << "Case #" << t << ": ";
        solve();
    }
    return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘int32_t main(int32_t, const char**)’:
Main.cpp:193:22: warning: unused parameter ‘argc’ [-Wunused-parameter]
  193 | int32_t main(int32_t argc, const char * argv[]) {
      |              ~~~~~~~~^~~~
Main.cpp:193:41: warning: unused parameter ‘argv’ [-Wunused-parameter]
  193 | int32_t main(int32_t argc, const char * argv[]) {
      |                            ~~~~~~~~~~~~~^~~~~~
Main.cpp: In instantiation of ‘int trie<N>::get_cnt_of_str(const std::string&) [with int N = 1000001; std::string = std::__cxx11::basic_string<char>]’:
Main.cpp:177:28:   required from here
Main.cpp:137:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  137 |                 for (int i = 0; i < s.size(); i++) {
      |                                 ~~^~~~~~~~~~
Main.cpp: In instantiation of ‘void trie<N>::add(std::string) [with int N = 1000001; std::string = std::__cxx11::basic_string<char>]’:
Main.cpp:178:10:   required from here
Main.cpp:95:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   95 |                 for (int i = 0; i < s.size(); i++) {
      |                                 ~~^~~~~~~~~~
Main.cpp: In instantiation of ‘int trie<N>::count(std::string) const [with int N = 1000001; std::string = std::__cxx11::basic_string<char>]’:
Main.cpp:183:16:   required from here
Main.cpp:108:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  108 |                 for (int i = 0; i < s.size(); i++) {
      |                                 ~~^~~~~~~~~~

Judge Result