Submission #65280633

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define xx first
#define yy second
#define PB push_back
#define MP make_pair

using namespace std;

using ll = long long;
using pii = pair<int,int>;
using tii = tuple<int,int,int>;
using vi = vector<int>;
template <typename T> using V = vector<T>;

template<class T> using uset = unordered_set<T>;
template<class T1, class T2> using umap = unordered_map<T1, T2>;

const vector<pair<int, int>> DIRS = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
constexpr int MOD = 1000000007;
mt19937_64 rnd(time(0));

class Node {
public:
    int cnt = -1;
    vector<Node> childs;
    bool insert(string& s, int i) {
        // cout << s << i << endl;
        if ( cnt == -2 ) return false;
        if ( cnt == -1 ) {
            cnt = 0;
            childs = vector<Node>(26);
        }
        if ( i == s.size() ) {
            cnt++;
            return true;
        } else {
            if ( childs[s[i]-'a'].insert(s, i+1) ) {
                cnt++;
                return true;
            }
            return false;
        }
    }
    int rem(string& s, int i) {
        // cout << s << i << endl;
        if ( cnt == -2 ) return 0;
        if ( cnt == -1 ) {
            cnt = 0;
            childs = vector<Node>(26);
        }
        int ret;
        if ( i == s.size() ) {
            ret = cnt;
            cnt = -2;
        } else {
            ret = childs[s[i]-'a'].rem(s, i+1);
            cnt -= ret;
        }
        return  ret;
    }
};

template <class T>
using ordered_set =  __gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    int q;
    string s;
    Node root;
    while ( n-- ) {
        cin >> q >> s;
        if ( q == 1 ) {
            root.rem(s, 0);
        } else {
            root.insert(s, 0);
        }
        cout << root.cnt << '\n';
    }
    return 0;
}

Submission Info

Compile Error

Main.cpp: In member function ‘bool Node::insert(std::string&, int)’:
Main.cpp:36:16: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   36 |         if ( i == s.size() ) {
      |              ~~^~~~~~~~~~~
Main.cpp: In member function ‘int Node::rem(std::string&, int)’:
Main.cpp:55:16: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   55 |         if ( i == s.size() ) {
      |              ~~^~~~~~~~~~~

Judge Result