#877184 (C++17) No.2338 Range AtCoder Query

• 問題: No.2338 Range AtCoder Query
• ユーザー: KumaTachiRen
• 提出日時: 2023-06-02 22:20:24
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: TLE
• 実行時間: -
• コード長: 3,614 bytes
• コンパイル時間: 4,142 ms
• コンパイル使用メモリ: 264,080 KB
• 最終ジャッジ日時: 2025-02-13 18:48:44
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
sample	AC * 1
other	AC * 21 TLE * 13

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

struct Fast
{
  Fast()
  {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;

#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (a); i--)
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define ll long long

template <typename T>
bool chmax(T &a, const T &b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}

// https://ei1333.hateblo.jp/entry/2017/09/11/211011
struct Mo
{
  int n;
  vector<pair<int, int>> lr;

  explicit Mo(int n) : n(n) {}

  void add(int l, int r)
  { /* [l, r) */
    lr.emplace_back(l, r);
  }

  template <typename AL, typename AR, typename EL, typename ER, typename O>
  void build(const AL &add_left, const AR &add_right, const EL &erase_left, const ER &erase_right, const O &out)
  {
    int q = (int)lr.size();
    int bs = n / min<int>(n, sqrt(q));
    vector<int> ord(q);
    iota(begin(ord), end(ord), 0);
    sort(begin(ord), end(ord), [&](int a, int b)
         {
      int ablock = lr[a].first / bs, bblock = lr[b].first / bs;
      if(ablock != bblock) return ablock < bblock;
      return (ablock & 1) ? lr[a].second > lr[b].second : lr[a].second < lr[b].second; });
    int l = 0, r = 0;
    for (auto idx : ord)
    {
      while (l > lr[idx].first)
        add_left(--l);
      while (r < lr[idx].second)
        add_right(r++);
      while (l < lr[idx].first)
        erase_left(l++);
      while (r > lr[idx].second)
        erase_right(--r);
      out(idx);
    }
  }

  template <typename A, typename E, typename O>
  void build(const A &add, const E &erase, const O &out)
  {
    build(add, add, erase, erase, out);
  }
};

int main()
{
  int n, m, q;
  cin >> n >> m >> q;
  vector<int> p(n), ac(n);
  rep(i, 0, n)
  {
    string s = "";
    cin >> p[i] >> s;
    p[i]--;
    ac[i] = s == "AC";
  }

  Mo mo(n);
  rep(i, 0, q)
  {
    int l, r;
    cin >> l >> r;
    mo.add(l - 1, r);
  }
  vector<int> point(q, 0), pena(q, 0), accnt(m, 0);
  vector<deque<int>> wadeq(m, deque<int>{0});
  int pt = 0, pn = 0;
  auto add_left = [&](int i)
  {
    int x = p[i];
    if (ac[i])
    {
      if (accnt[x]++ == 0)
      {
        pt++;
      }
      else
      {
        pn -= wadeq[x].front();
      }
      wadeq[x].push_front(0);
    }
    else
    {
      if (accnt[x])
      {
        pn++;
      }
      wadeq[x].front()++;
    }
  };
  auto add_right = [&](int i)
  {
    int x = p[i];
    if (ac[i])
    {
      if (accnt[x]++ == 0)
      {
        pt++;
        pn += wadeq[x].front();
      }
      wadeq[x].push_back(0);
    }
    else
    {
      wadeq[x].back()++;
    }
  };
  auto erase_left = [&](int i)
  {
    int x = p[i];
    if (ac[i])
    {
      wadeq[x].pop_front();
      if (--accnt[x] == 0)
      {
        pt--;
      }
      else
      {
        pn += wadeq[x].front();
      }
    }
    else
    {
      if (accnt[x])
      {
        pn--;
      }
      wadeq[x].front()--;
    }
  };
  auto erase_right = [&](int i)
  {
    int x = p[i];
    if (ac[i])
    {
      wadeq[x].pop_back();
      if (--accnt[x] == 0)
      {
        pt--;
        pn -= wadeq[x].front();
      }
    }
    else
    {
      wadeq[x].back()--;
    }
  };
  auto out = [&](int i)
  {
    point[i] = pt;
    pena[i] = pn;
  };

  mo.build(add_left, add_right, erase_left, erase_right, out);
  rep(i, 0, q) cout << point[i] << " " << pena[i] << "\n";
}