Submission #65267074

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
constexpr int MAXN = 1'000'007;
constexpr int INF = 2'000'000'000;
constexpr ll INFF = 1'000'000'000'000'000'000LL;
constexpr ll MOD = 998'244'353;
#define mkp make_pair
#define F first
#define S second
#define pb emplace_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()

int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int q;
  cin >> q;

  int rt = 1, ans = 0;
  vector<vector<int>> trie(MAXN, vector<int>(26));
  vector<int> tag(MAXN), cnt(MAXN);

  auto insert1 = [&](string &s) {
    int now = 1;
    bool ok = 1;
    for (char c : s) {
      if (trie[now][c - 'a'] == 0) {
        trie[now][c - 'a'] = ++rt;
      }
      now = trie[now][c - 'a'];

      if (tag[now]) {
        ok = 0;
        break;
      }
    }
    if (ok) {
      tag[now] = 1;

      queue<int> q;
      q.push(now);
      while (!q.empty()) {
        auto nt = q.front();
        q.pop();
        ans -= cnt[nt];
        for (int i = 0; i < 26; i++) {
          if (trie[nt][i] && !tag[trie[nt][i]]) {
            q.push(trie[nt][i]);
          }
        }
      }
    }
  };

  auto insert2 = [&](string &s) {
    int now = 1;
    bool ok = 1;
    for (char c : s) {
      if (trie[now][c - 'a'] == 0) {
        trie[now][c - 'a'] = ++rt;
      }
      now = trie[now][c - 'a'];
      if (tag[now]) {
        ok = 0;
        break;
      }
    }
    if (ok) {
      cnt[now]++;
      ans++;
    }
  };

  for (int i = 0; i < q; i++) {
    int t;
    string s;
    cin >> t >> s;
    if (t == 1) {
      insert1(s);
    } else {
      insert2(s);
    }
    cout << ans << '\n';
  }
}
/*
- How to come up with solutions? (https://hackmd.io/-3cIVAFSQMC3iJTh9EpszA)
  - Play with some small examples.
  - Make observations (or random guesses) by intuition.
    - Try to find counterexamples of the "observations."
  - Find the characteristics of an optimal solution.
  - Try to solve simple cases.
  - Brute force and print out the results.
  - Pick a method (greedy, dp, d&c, ...)
    - But DO NOT force algos on problems!
  - IF YOU'RE STUCK, TRY SOMETHING ELSE! Make new observations!

- Before writing the solution:
  - check TL/ML/correctness of samples/implementation details!

- Pre-submit:
  - Did you make a typo when copying a template?
  - Test more cases if unsure.
    - Write a naive solution and check small cases.
  - Submit the correct file.

- Debugging:
  - General Debugging:
    - Read the whole problem again.
    - Think over the algorithm again.
    - Go to the toilet.

  - Wrong Answer:
    - Any possible overflows?
      - > `__int128` ?
      - Try `-ftrapv` or `#pragma GCC optimize("trapv")`
    - Floating point errors?
      - > `long double` ?
      - turn off math optimizations
      - check for `==`, `>=`, `acos(1.000000001)`, etc.
    - Did you forget to sort or unique?
    - Generate large and worst "corner" cases.
    - Check your `m` / `n`, `i` / `j`,  `x` / `y` and `<` / `>`.
    - Are everything initialized or reset properly?
    - Are you sure about the STL thing you are using?
      - Read cppreference.
    - Print everything and run it on pen and paper.

  - Time Limit Exceeded:
    - Calculate your time complexity again.
    - Does the program actually end?
      - Check for `while(q.size())` etc.
    - Test the largest cases locally.
    - Did you do unnecessary stuff?
      - e.g. pass vectors by value
      - e.g. `memset` for every test case
    - Is your constant factor reasonable?

  - Runtime Error:
    - Check memory usage.
      - Forget to clear or destroy stuff?
      - > `vector::shrink_to_fit()`
    - Stack overflow?
    - Bad pointer / array access?
      - Try `-fsanitize=address`
    - Division by zero? NaN's?
*/

Submission Info

Judge Result