QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#322078#5014. 复读程度hos_lyric100 ✓1801ms83924kbC++1431.1kb2024-02-06 10:21:422024-02-06 10:21:43

Judging History

你现在查看的是最新测评结果

  • [2024-02-06 10:21:43]
  • 评测
  • 测评结果:100
  • 用时:1801ms
  • 内存:83924kb
  • [2024-02-06 10:21:42]
  • 提交

answer

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


////////////////////////////////////////////////////////////////////////////////
// SA-IS
//   String: string, vector<int>, vector<long long>
//   if sigma <= n,  O(n) time, O(n) space
//   if sigma >  n,  O(n log n) time, O(n) space
template <class String> vector<int> suffixArrayRec(const String &as) {
  const int n = as.size();
  if (n == 0) return {};
  const auto minmaxA = minmax_element(as.begin(), as.end());
  const auto minA = *minmaxA.first, maxA = *minmaxA.second;
  if (static_cast<unsigned long long>(maxA) - minA >=
      static_cast<unsigned long long>(n)) {
    vector<int> us(n);
    for (int u = 0; u < n; ++u) us[u] = u;
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (as[u] < as[v]);
    });
    int b = 0;
    vector<int> bs(n, 0);
    for (int i = 1; i < n; ++i) {
      if (as[us[i - 1]] != as[us[i]]) ++b;
      bs[us[i]] = b;
    }
    return suffixArrayRec(bs);
  }
  const int sigma = maxA - minA + 1;
  vector<int> pt(sigma + 1, 0), poss(sigma);
  for (int u = 0; u < n; ++u) ++pt[as[u] - minA + 1];
  for (int a = 0; a < sigma; ++a) pt[a + 1] += pt[a];
  // cmp[u] := (as[u, n) < as[u + 1, n))
  vector<bool> cmp(n);
  cmp[n - 1] = false;
  for (int u = n - 1; --u >= 0; ) {
    cmp[u] = (as[u] != as[u + 1]) ? (as[u] < as[u + 1]) : cmp[u + 1];
  }
  // ><,  nn - id (0 <= id < n)
  int nn = 0;
  vector<int> ids(n, 0);
  int last = n;
  vector<int> nxt(n, 0);
  // put ><, from the tail of each bucket
  vector<int> us(n, 0);
  memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
  for (int u = n - 1; --u >= 1; ) if (!cmp[u - 1] && cmp[u]) {
    ids[u] = ++nn;
    nxt[u] = last;
    last = u;
    us[--poss[as[u] - minA]] = u;
  }
  // follow > backwards, from the head of each bucket
  memcpy(poss.data(), pt.data(), sigma * sizeof(int));
  us[poss[as[n - 1] - minA]++] = n - 1;
  for (int i = 0; i < n; ++i) {
    const int u = us[i];
    if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
  }
  // follow < backwards, from the tail of each bucket
  memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
  for (int i = n; --i >= 0; ) {
    const int u = us[i];
    if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
  }
  if (nn) {
    int vsLen = 0;
    vector<int> vs(nn);
    for (const int u : us) if (ids[u]) vs[vsLen++] = u;
    int b = 0;
    vector<int> bs(nn, 0);
    for (int j = 1; j < nn; ++j) {
      // as[v1, w1] (< or =) as[v0, w0]
      int v1 = vs[j - 1], v0 = vs[j];
      const int w1 = nxt[v1], w0 = nxt[v0];
      if (w1 - v1 != w0 - v0) {
        ++b;
      } else {
        for (; ; ++v1, ++v0) {
          if (v1 == n) { ++b; break; }
          if (as[v1] != as[v0]) { ++b; break; }
          if (v1 == w1) break;
        }
      }
      bs[nn - ids[vs[j]]] = b;
    }
    for (int u = 0; u < n; ++u) if (ids[u]) vs[nn - ids[u]] = u;
    const auto sub = suffixArrayRec(bs);
    // put ><, from the tail of each bucket
    memset(us.data(), 0, n * sizeof(int));
    memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
    for (int j = nn; --j >= 0; ) {
      const int u = vs[sub[j]];
      us[--poss[as[u] - minA]] = u;
    }
    // follow > backwards, from the head of each bucket
    memcpy(poss.data(), pt.data(), sigma * sizeof(int));
    us[poss[as[n - 1] - minA]++] = n - 1;
    for (int i = 0; i < n; ++i) {
      const int u = us[i];
      if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
    }
    // follow < backwards, from the tail of each bucket
    memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
    for (int i = n; --i >= 0; ) {
      const int u = us[i];
      if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
    }
  }
  return us;
}

// us[i]: i-th suffix
// su[u]: index of as[u, n)
// hs[i]: longest common prefix of as[us[i - 1], n) and as[us[i], n)
struct SuffixArray {
  int n;
  bool rmq;
  vector<int> us, su, hs;
  SuffixArray() : n(0), rmq(false) {}
  SuffixArray(const string &as, bool rmq_) : rmq(rmq_) { build(as); }
  SuffixArray(const vector<int> &as, bool rmq_) : rmq(rmq_) { build(as); }
  SuffixArray(const vector<long long> &as, bool rmq_) : rmq(rmq_) { build(as); }
  template <class String> void build(const String &as) {
    n = as.size();
    us = suffixArrayRec(as);
    su.resize(n + 1);
    for (int i = 0; i < n; ++i) su[us[i]] = i;
    su[n] = -1;
    hs.assign(n, 0);
    for (int h = 0, u = 0; u < n; ++u) if (su[u]) {
      for (int v = us[su[u] - 1]; v + h < n && as[v + h] == as[u + h]; ++h) {}
      hs[su[u]] = h;
      if (h) --h;
    }
    if (rmq) {
      const int logN = n ? (31 - __builtin_clz(n)) : 0;
      hs.resize((logN + 1) * n - (1 << logN) + 1);
      for (int e = 0; e < logN; ++e) {
        int *hes = hs.data() + e * n;
        for (int i = 0; i <= n - (1 << (e + 1)); ++i) {
          hes[n + i] = min(hes[i], hes[i + (1 << e)]);
        }
      }
    }
  }
  // Returns longest common prefix of as[u, n) and as[v, n).
  //   0 <= u, v <= n
  //   Assumes rmq.
  inline int lcp(int u, int v) const {
    if (u == v) return n - u;
    int i = su[u], j = su[v];
    if (i > j) swap(i, j);
    const int e = 31 - __builtin_clz(j - i);
    return min(hs[e * n + i + 1], hs[e * n + j + 1 - (1 << e)]);
  }
};
////////////////////////////////////////////////////////////////////////////////


// before HLD:
//   0 <= u <= n: suffix [u, n)  (n: root, empty string)
//   n <  u <  m: LCA needed
// after HLD:
//   DFS-order
//   0: root, empty string
//   perm[u]: suffix[u, n)  (0 <= u <= n)
struct SuffixTree {
  int n, m;
  SuffixArray sa;
  struct Node {
    int par, len, occ;
    inline int l() const { return occ; }
    inline int r() const { return occ + len; }
  };
  vector<Node> nodes;
  vector<int> perm;
  SuffixTree() {}
  SuffixTree(const string &str, bool lastOcc) { build(str, lastOcc); }
  SuffixTree(const vector<int> &str, bool lastOcc) { build(str, lastOcc); }
  SuffixTree(const vector<long long> &str, bool lastOcc) { build(str, lastOcc); }
  template <class String> void build(const String &str, bool lastOcc) {
    n = str.size();
    m = n + 1;
    sa = SuffixArray(str, /*rmq=*/false);
    nodes.resize(2 * n + 1);
    nodes[n] = Node{/*par=*/-1, /*len=*/0, /*occ=*/lastOcc ? n : 0};
    int top = 0;
    vector<int> stack(n + 1);
    stack[0] = n;
    for (int i = 0; i < n; ++i) {
      const int u = sa.us[i];
      int v = -1;
      for (; nodes[stack[top]].len > sa.hs[i]; --top) {
        v = stack[top];
        nodes[nodes[v].par].occ = lastOcc ? max(nodes[nodes[v].par].occ, nodes[v].occ) : min(nodes[nodes[v].par].occ, nodes[v].occ);
      }
      if (nodes[stack[top]].len < sa.hs[i]) {
        const int w = m++;
        nodes[w] = Node{/*par=*/nodes[v].par, /*len=*/sa.hs[i], /*occ=*/nodes[v].occ};
        stack[++top] = nodes[v].par = w;
      }
      nodes[u] = Node{/*par=*/stack[top], /*len=*/n - u, /*occ=*/u};
      stack[++top] = u;
    }
    for (; top; --top) {
      const int v = stack[top];
      nodes[nodes[v].par].occ = lastOcc ? max(nodes[nodes[v].par].occ, nodes[v].occ) : min(nodes[nodes[v].par].occ, nodes[v].occ);
    }
    nodes.resize(m);
    runHld();
  }
  inline const Node &operator[](int u) const {
    return nodes[u];
  }
  inline int size(int u) const {
    return (~nodes[u].par) ? (nodes[u].len - nodes[nodes[u].par].len) : 1;
  }

  // Reindexes nodes by DFS-order.
  //   Ignores character order.
  //   Subtrees at the same "color" are isomorphic, should have the same HLD.
  //   old u -> new perm[u]
  vector<int> pt, g, head;
  void runHld() {
    pt.assign(m + 1, 0);
    for (int u = 0; u < m; ++u) if (u != n) ++pt[nodes[u].par];
    for (int u = 0; u < m; ++u) pt[u + 1] += pt[u];
    g.resize(pt[m]);
    for (int u = m; --u >= 0; ) if (u != n) g[--pt[nodes[u].par]] = u;
    vector<int> sz(m, 1);
    dfsSz(n, sz);
    int zeit = 0;
    perm.resize(m);
    head.resize(m);
    head[n] = 0;
    dfsHld(n, zeit, sz);
    assert(zeit == m);
    vector<Node> nodesReindexed(m);
    for (int u = 0; u < m; ++u) {
      Node &node = nodesReindexed[perm[u]] = nodes[u];
      if (~node.par) node.par = perm[node.par];
    }
    nodes.swap(nodesReindexed);
    for (int u = 0; u <= m; ++u) pt[u] = 0;
    for (int u = 1; u < m; ++u) ++pt[nodes[u].par];
    for (int u = 1; u < m; ++u) pt[u + 1] += pt[u];
    g.resize(pt[m]);
    for (int u = m; --u >= 1; ) g[--pt[nodes[u].par]] = u;
  }
  void dfsSz(int u, vector<int> &sz) {
    for (int i = pt[u]; i < pt[u + 1]; ++i) {
      dfsSz(g[i], sz);
      sz[u] += sz[g[i]];
    }
  }
  void dfsHld(int u, int &zeit, vector<int> &sz) {
    perm[u] = zeit++;
    if (pt[u] < pt[u + 1]) {
      int im = pt[u];
      for (int i = pt[u] + 1; i < pt[u + 1]; ++i) if (sz[g[im]] < sz[g[i]]) im = i;
      swap(g[pt[u]], g[im]);
      head[zeit] = head[zeit - 1];
      dfsHld(g[pt[u]], zeit, sz);
      for (int i = pt[u] + 1; i < pt[u + 1]; ++i) {
        head[zeit] = zeit;
        dfsHld(g[i], zeit, sz);
      }
    }
  }
  // Returns the shallowest node representing [l, r') for r <= r'.
  int locate(int l, int r) const {
    assert(0 <= l); assert(l <= r); assert(r <= n);
    for (int u = perm[l]; ; ) {
      const int h = head[u];
      const int p = nodes[h].par;
      if (!~p || nodes[p].len < r - l) {
        int lo = h - 1, hi = u;
        for (; lo + 1 < hi; ) {
          const int mid = (lo + hi) / 2;
          ((nodes[mid].len < r - l) ? lo : hi) = mid;
        }
        return hi;
      }
      u = p;
    }
  }
};

// block i contains [ls[i] + x, rs[i] - y) s.t.
//   0 <= x < sizeL(i),  0 <= y < sizeR(i, x)
//   0 <= y < sizeR(i),  0 <= x < sizeL(i, y)
struct Substring {
  // |str|
  int n;
  // stRev: occ is modified to represent the first occurrence in str
  SuffixTree st, stRev;
  // # of colors
  int size;
  // tree node -> block id
  vector<int> is, isRev;
  // [ls[i], rs[i]): representative of block i, i.e. [min l, max r)
  vector<int> ls, rs;
  // tree nodes for block i: us[js[i], js[i] + sizeL(i)), usRev[jsRev[i], jsRev[i] + sizeR(i))
  vector<int> js, jsRev, us, usRev;
  Substring() {}
  Substring(const string &str) { build(str); }
  Substring(const vector<int> &str) { build(str); }
  Substring(const vector<long long> &str) { build(str); }
  // O(n) time
  template <class String> void build(const String &str) {
    n = str.size();
    st = SuffixTree(str, /*lastOcc=*/false);
    String strRev = str;
    std::reverse(strRev.begin(), strRev.end());
    stRev = SuffixTree(strRev, /*lastOcc=*/true);
    for (int u = 0; u < stRev.m; ++u) stRev.nodes[u].occ = n - stRev.nodes[u].r();
    size = 0;
    is.assign(st.m, -1);
    isRev.assign(stRev.m, -1);
    js = jsRev = {1};
    us.assign(st.m, 0);
    usRev.assign(stRev.m, 0);
    {
      // radix sort: incr len, incr occ
      const int seqLen = (st.m - 1) + (stRev.m - 1);
      vector<int> ptLen(n + 1, 0), ptOcc(n + 1, 0);
      for (int u = 1; u < st.m; ++u) { ++ptLen[st[u].len]; ++ptOcc[st[u].occ]; }
      for (int u = 1; u < stRev.m; ++u) { ++ptLen[stRev[u].len]; ++ptOcc[stRev[u].occ]; }
      for (int len = 0; len < n; ++len) ptLen[len + 1] += ptLen[len];
      for (int occ = 0; occ < n; ++occ) ptOcc[occ + 1] += ptOcc[occ];
      vector<int> work(seqLen);
      for (int u = stRev.m; --u >= 1; ) work[--ptOcc[stRev[u].occ]] = ~u;
      for (int u = st.m; --u >= 1; ) work[--ptOcc[st[u].occ]] = u;
      vector<int> seq(seqLen);
      for (int k = seqLen; --k >= 0; ) seq[--ptLen[(work[k] >= 0) ? st[work[k]].len : stRev[~work[k]].len]] = work[k];
      for (int k = 0; k < seqLen - 1; ++k) if (seq[k] >= 0 && seq[k + 1] < 0 && st[seq[k]].len == stRev[~seq[k + 1]].len && st[seq[k]].occ == stRev[~seq[k + 1]].occ) {
        ls.push_back(st[seq[k]].l());
        rs.push_back(st[seq[k]].r());
        js.push_back(js.back() + stRev.size(~seq[k + 1]));
        jsRev.push_back(jsRev.back() + st.size(seq[k]));
        is[seq[k]] = isRev[~seq[k + 1]] = size++;
      }
    }
    {
      // radix sort: incr r, incr l
      const int seqLen = st.m - 1;
      vector<int> ptL(n + 1, 0), ptR(n + 1, 0);
      for (int u = 1; u < st.m; ++u) { ++ptL[st[u].l()]; ++ptR[st[u].r()]; }
      for (int l = 0; l < n; ++l) ptL[l + 1] += ptL[l];
      for (int r = 0; r < n; ++r) ptR[r + 1] += ptR[r];
      vector<int> work(seqLen);
      for (int u = st.m; --u >= 1; ) work[--ptL[st[u].l()]] = u;
      vector<int> seq(seqLen);
      for (int k = seqLen; --k >= 0; ) seq[--ptR[st[work[k]].r()]] = work[k];
      int i = -1, j = 0;
      for (int k = 0; k < seqLen; ++k) {
        if (~is[seq[k]]) j = js[i = is[seq[k]]];
        is[us[j++] = seq[k]] = i;
      }
    }
    {
      // radix sort: decr l, decr r
      const int seqLen = stRev.m - 1;
      vector<int> ptL(n + 1, 0), ptR(n + 1, 0);
      for (int u = 1; u < stRev.m; ++u) { ++ptL[stRev[u].l()]; ++ptR[stRev[u].r()]; }
      for (int l = n; l > 0; --l) ptL[l - 1] += ptL[l];
      for (int r = n; r > 0; --r) ptR[r - 1] += ptR[r];
      vector<int> work(seqLen);
      for (int u = stRev.m; --u >= 1; ) work[--ptR[stRev[u].r()]] = u;
      vector<int> seq(seqLen);
      for (int k = seqLen; --k >= 0; ) seq[--ptL[stRev[work[k]].l()]] = work[k];
      int i = -1, j = 0;
      for (int k = 0; k < seqLen; ++k) {
        if (~isRev[seq[k]]) j = jsRev[i = isRev[seq[k]]];
        isRev[usRev[j++] = seq[k]] = i;
      }
    }
  }
  // block id at representative position
  // st node id
  // stRev node id
  friend ostream &operator<<(ostream &os, const Substring &sub) {
    const int width = max(static_cast<int>(std::to_string(max(sub.st.m, sub.stRev.m) - 1).size()) + 1, 3);
    for (int phase = 0; phase < 3; ++phase) {
      for (int r = sub.n; r > 0; --r) {
        for (int l = 0; l < r; ++l) {
          const Location loc = sub.locate(l, r);
          string s;
          switch (phase) {
            case 0: {
              if (sub.ls[loc.i] == l && sub.rs[loc.i] == r) s = std::to_string(loc.i);
            } break;
            case 1: {
              if (sub.st[loc.u].len == r - l) s = std::to_string(loc.u);
            } break;
            case 2: {
              if (sub.stRev[loc.v].len == r - l) s = std::to_string(loc.v);
            } break;
          }
          os << "\x1b[" << (41 + loc.i % 6) << "m";
          os << string(width - static_cast<int>(s.size()), ' ') << s;
          os << "\x1b[m";
        }
        os << '\n';
      }
      os << '\n';
    }
    return os;
  }
  inline int id(int i, int x = 0) const {
    return us[js[i] + x];
  }
  inline int idRev(int i, int y = 0) const {
    return usRev[jsRev[i] + y];
  }
  inline int sizeR(int i, int x = 0) const {
    return st.size(id(i, x));
  }
  inline int sizeL(int i, int y = 0) const {
    return stRev.size(idRev(i, y));
  }
  // i: block id
  // x, y: coordinate within block i, [ls[i] + x, rs[i] - y)
  // u = st.locate(l, r)           : shallowest node of st    for [l, r') s.t. r <= r'
  // v = stRev.locate(n - r, n - l): shallowest node of stRev for [l', r) s.t. l' <= l
  // O(log(n)) time
  struct Location {
    int i, x, y, u, v;
  };
  Location locate(int l, int r) const {
    assert(0 <= l); assert(l <= r); assert(r <= n);
    if (l == r) return Location{-1, 0, 0, 0, 0};
    Location loc;
    loc.u = st.locate(l, r);
    loc.i = is[loc.u];
    loc.x = st[loc.u].l() - ls[loc.i];
    loc.y = ((l - loc.x) + (rs[loc.i] - ls[loc.i])) - r;
    loc.v = idRev(loc.i, loc.y);
    return loc;
  }

  // pattern ([l, r), t): (weight of str[l, r)) += t
  //   l < r
  //   T: commutative group
  // query [l, r): \sum[l<=l'<r'<=r] (weight of str[l', r'))
  // O(n + (|patterns| + |queries|) log(n)) time
  template <class T>
  vector<T> countOffline(const vector<pair<pair<int, int>, T>> &patterns,
                         const vector<pair<int, int>> &queries) const {
    const int patternsLen = patterns.size();
    const int queriesLen = queries.size();
    // x -> ((y, p or ~q))
    vector<vector<pair<int, int>>> eventss(st.m);
    // tree DP (path to root)
    vector<T> dp(st.m), dpRev(stRev.m);
    for (int p = 0; p < patternsLen; ++p) {
      const int l = patterns[p].first.first, r = patterns[p].first.second;
      assert(0 <= l); assert(l < r); assert(r <= n);
      const Location loc = locate(l, r);
      eventss[js[loc.i] + loc.x].emplace_back(loc.y, p);
      dp[loc.u] += patterns[p].second;
      dpRev[loc.v] += patterns[p].second;
    }
    for (int u = 1; u < st.m; ++u) dp[u] += dp[st[u].par];
    for (int u = 1; u < stRev.m; ++u) dpRev[u] += dpRev[stRev[u].par];
    // query [ls[i], rs[i])
    vector<T> corner(size);
    for (int i = 0; i < size; ++i) {
      for (int x = 0; x < sizeL(i); ++x) corner[i] += dp[id(i, x)];
      const int ii = isRev[stRev[idRev(i)].par];
      if (~ii) corner[i] += corner[ii];
    }
    // query [ls[i], rs[i] - y)
    vector<T> edge(stRev.m);
    for (int i = 0; i < size; ++i) {
      const int ii = is[st[id(i)].par];
      T sum = (~ii) ? corner[ii] : T();
      for (int y = sizeR(i); --y >= 0; ) edge[jsRev[i] + y] = sum += dpRev[idRev(i, y)];
    }
    // suffix sum of dp[st[id(i, x)].par]
    // can use segment tree if subtraction is unavailable
    vector<T> sumPar(st.m);
    for (int i = 0; i < size; ++i) {
      T sum = T();
      for (int x = sizeL(i); --x >= 0; ) sumPar[js[i] + x] = sum += dp[st[id(i, x)].par];
    }
    // query [l, r)
    vector<T> ans(queriesLen);
    vector<int> hasQuery(size, 0);
    for (int q = 0; q < queriesLen; ++q) {
      const int l = queries[q].first, r = queries[q].second;
      assert(0 <= l); assert(l <= r); assert(r <= n);
      if (l < r) {
        const Location loc = locate(queries[q].first, queries[q].second);
        if (loc.x == 0) {
          if (loc.y == 0) {
            ans[q] += corner[loc.i];
          } else {
            ans[q] += edge[jsRev[loc.i] + loc.y];
          }
        } else {
          hasQuery[loc.i] = 1;
          eventss[js[loc.i] + loc.x].emplace_back(loc.y, ~q);
          ans[q] += sumPar[js[loc.i] + loc.x];
          if (sizeL(loc.i, loc.y) < sizeL(loc.i)) ans[q] -= sumPar[js[loc.i] + sizeL(loc.i, loc.y)];
          const int vv = stRev[loc.v].par;
          const int ii = isRev[vv];
          if (~ii) ans[q] += edge[jsRev[ii] + (rs[ii] - stRev[vv].r())];
        }
      }
    }
    // offline 2D
    vector<T> bit(n + 1);
    for (int i = 0; i < size; ++i) if (hasQuery[i]) {
      for (int y = 1; y <= sizeR(i); ++y) bit[y] = T();
      for (int x = sizeL(i); --x >= 0; ) for (const auto &event : eventss[js[i] + x]) {
        if (event.second >= 0) {
          const T t = patterns[event.second].second;
          for (int y = sizeR(i) - event.first; y <= sizeR(i); y += y & -y) bit[y] += t;
        } else {
          T sum = T();
          for (int y = sizeR(i) - event.first; y > 0; y &= y - 1) sum += bit[y];
          ans[~event.second] += sum;
        }
      }
    }
    return ans;
  }
};

////////////////////////////////////////////////////////////////////////////////


template <class X, class Y, class T> struct StaticPointAddRectSum {
  struct Rect {
    X x0, x1;
    Y y0, y1;
  };
  vector<pair<X, Y>> as;
  vector<Rect> bs;
  vector<T> vals, anss;
  // Adds val to (x, y).
  void add(X x, Y y, const T &val) {
    as.emplace_back(x, y);
    vals.push_back(val);
  }
  // Gets sum of [x0, x1) * [y0, y1).
  //   ~~> Gets (x*, y*)
  void get(X x0, X x1, Y y0, Y y1) {
    assert(x0 <= x1); assert(y0 <= y1);
    bs.push_back(Rect{x0, x1, y0, y1});
  }

  void run() {
    const int asLen = as.size(), bsLen = bs.size();

    // same x ==> get then add
    vector<pair<X, int>> events((bsLen << 1) + asLen);
    for (int i = 0; i < asLen; ++i) {
      events[(bsLen << 1) + i] = std::make_pair(as[i].first, (bsLen << 1) + i);
    }
    for (int j = 0; j < bsLen; ++j) {
      events[j << 1    ] = std::make_pair(bs[j].x0, j << 1    );
      events[j << 1 | 1] = std::make_pair(bs[j].x1, j << 1 | 1);
    }
    std::sort(events.begin(), events.end());

    vector<Y> ys(asLen);
    for (int i = 0; i < asLen; ++i) {
      ys[i] = as[i].second;
    }
    std::sort(ys.begin(), ys.end());
    ys.erase(std::unique(ys.begin(), ys.end()), ys.end());
    const int ysLen = ys.size();
    vector<T> bit(ysLen, 0);

    anss.assign(bsLen, 0);
    for (const auto &event : events) {
      if (event.second >= bsLen << 1) {
        const int i = event.second - (bsLen << 1);
        for (int l = std::lower_bound(ys.begin(), ys.end(), as[i].second) - ys.begin(); l < ysLen; l |= l + 1) {
          bit[l] += vals[i];
        }
      } else {
        const int j = event.second >> 1;
        T sum = 0;
        for (int l = std::lower_bound(ys.begin(), ys.end(), bs[j].y0) - ys.begin(); l > 0; l &= l - 1) {
          sum -= bit[l - 1];
        }
        for (int l = std::lower_bound(ys.begin(), ys.end(), bs[j].y1) - ys.begin(); l > 0; l &= l - 1) {
          sum += bit[l - 1];
        }
        (event.second & 1) ? (anss[j] += sum) : (anss[j] -= sum);
      }
    }
  }
};

////////////////////////////////////////////////////////////////////////////////


// add val to a: O(sqrt(n))
// get sum of [a, b): O(1)
template <class T> struct PointAddRangeSum {
  int n, l, e;
  vector<T> giant, baby;
  PointAddRangeSum() {}
  PointAddRangeSum(int n_) : n(n_) {
    for (e = 0; 1 << (2 * e) < n; ++e) {}
    l = n >> e;
    giant.assign(l + 1, T());
    baby.assign(n + 1, T());
  }
  PointAddRangeSum(const vector<T> &ts) {
    n = ts.size();
    for (e = 0; 1 << (2 * e) < n; ++e) {}
    l = n >> e;
    giant.assign(l + 1, T());
    baby.assign(n + 1, T());
    T sumsum = T();
    for (int x = 0; x <= l; ++x) {
      giant[x] = sumsum;
      const int limY = min((x + 1) << e, n + 1);
      T sum = T();
      for (int y = x << e; y < limY; ++y) {
        baby[y] = sum;
        if (y < n) sum += ts[y];
      }
      sumsum += sum;
    }
  }
  void add(int a, T val) {
    assert(0 <= a); assert(a < n);
    for (int x = (a >> e) + 1; x <= l; ++x) giant[x] += val;
    const int limY = min(((a >> e) + 1) << e, n + 1);
    for (int y = a + 1; y < limY; ++y) baby[y] += val;
  }
  inline T get(int a) const {
    return giant[a >> e] + baby[a];
  }
  inline T get(int a, int b) const {
    return get(b) - get(a);
  }
};

////////////////////////////////////////////////////////////////////////////////


using U = unsigned long long;

int blockSize;
struct Mo {
  int u, v;
  int q;
  int sig;
};
bool operator<(const Mo &mo0, const Mo &mo1) {
  const int x0 = mo0.u / blockSize;
  const int x1 = mo1.u / blockSize;
  return (x0 != x1) ? (x0 < x1) : (x0 & 1) ? (mo0.v > mo1.v) : (mo0.v < mo1.v);
}

struct Offline {
  int s, t;
  int k;
};

int N, Q;
char S[100'010];
vector<U> WL, WR;
vector<int> L0, R0, L1, R1;

int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    scanf("%s", S);
    WL.assign(N + 1, 0); for (int l = 0; l < N; ++l) scanf("%llu", &WL[l]);
    WR.assign(N + 1, 0); for (int r = 1; r <= N; ++r) scanf("%llu", &WR[r]);
    L0.resize(Q);
    R0.resize(Q);
    L1.resize(Q);
    R1.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d%d%d", &L0[q], &R0[q], &L1[q], &R1[q]);
      --L0[q];
      --L1[q];
    }
    
    const Substring sub(S);
#ifdef LOCAL
cerr<<sub<<flush;
#endif
    
    vector<int> freqNode(sub.st.m, 0);
    vector<int> fin(sub.st.m, 0), finRev(sub.stRev.m, 0);
    vector<U> VL(sub.st.m, 0), VR(sub.stRev.m, 0);
    for (int l = 0; l <= N; ++l) ++freqNode[sub.st.perm[l]];
    for (int u = 0; u < sub.st.m; ++u) fin[u] = u + 1;
    for (int v = 0; v < sub.stRev.m; ++v) finRev[v] = v + 1;
    for (int l = 0; l <= N; ++l) VL[sub.st.perm[l]] += WL[l];
    for (int r = 0; r <= N; ++r) VR[sub.stRev.perm[N - r]] += WR[r];
    for (int u = sub.st.m; --u >= 1; ) {
      const int p = sub.st[u].par;
      freqNode[p] += freqNode[u];
      chmax(fin[p], fin[u]);
      VL[p] += VL[u];
    }
    for (int v = sub.stRev.m; --v >= 1; ) {
      const int p = sub.stRev[v].par;
      chmax(finRev[p], finRev[v]);
      VR[p] += VR[v];
    }
    vector<int> freq(sub.size, 0);
    for (int i = 0; i < sub.size; ++i) freq[i] = freqNode[sub.id(i)];
#ifdef LOCAL
cerr<<"freq = "<<freq<<endl;
cerr<<"VL = "<<VL<<endl;
cerr<<"VR = "<<VR<<endl;
#endif
    
    vector<U> ans(Q, 0);
    vector<U> bad0Coef(Q), bad1Coef(Q);
    StaticPointAddRectSum<int, int, U> bad0, bad1;
    for (int j = 0; j < sub.stRev.m; ++j) bad0.add(j, sub.usRev[j], VR[sub.usRev[j]]);
    for (int j = 0; j < sub.st.m; ++j) bad1.add(j, sub.us[j], VL[sub.us[j]]);
    
    blockSize = max<int>(3.0 * N / sqrt(max(Q, 1)), 1);
    vector<Mo> mos(Q * 4);
    
    for (int q = 0; q < Q; ++q) {
      /*
        subtree(loc0.u) in st
        subtree(loc1.v) in stRev
        bad:
          - loc0.u, but len < R0[q] - L0[q]
          - loc1.v, but len < R1[q] - L1[q]
      */
      const auto loc0 = sub.locate(L0[q], R0[q]);
      const auto loc1 = sub.locate(L1[q], R1[q]);
      // bad {}
      {
        /*
        U brt = 0;
        for (int u = loc0.u; u < fin[loc0.u]; ++u) for (int v = loc1.v; v < finRev[loc1.v]; ++v) {
          const int i = sub.is[u];
          if (i == sub.isRev[v]) {
            const int x = sub.st[u].l() - sub.ls[i];
            const int y = sub.rs[i] - sub.stRev[v].r();
            if (y < sub.sizeR(i, x)) {
// cerr<<__LINE__<<" q = "<<q<<", i = "<<i<<", u = "<<u<<", v = "<<v<<"; "<<freq[i]<<" * "<<VL[u]<<" * "<<VR[v]<<endl;
              brt += freq[i] * VL[u] * VR[v];
            }
          }
        }
        ans[q] += brt;
        */
        mos[q * 4 + 0] = Mo{    loc0.u ,        loc1.v , q, +1};
        mos[q * 4 + 1] = Mo{    loc0.u , finRev[loc1.v], q, -1};
        mos[q * 4 + 2] = Mo{fin[loc0.u],        loc1.v , q, -1};
        mos[q * 4 + 3] = Mo{fin[loc0.u], finRev[loc1.v], q, +1};
      }
      // bad {0}
      {
        const int i = loc0.i, x = loc0.x, u = loc0.u;
        /*
        U brt = 0;
        for (int y = loc0.y + 1; y < sub.sizeR(i, x); ++y) {
          const int v = sub.idRev(i, y);
          if (loc1.v <= v && v < finRev[loc1.v]) {
cerr<<__LINE__<<" q = "<<q<<", i = "<<i<<", u = "<<u<<", v = "<<v<<"; "<<freq[i]<<" * "<<VL[u]<<" * "<<VR[v]<<endl;
            brt += freq[i] * VL[u] * VR[v];
          }
        }
        // ans[q] -= brt;
        //*/
        bad0Coef[q] = freq[i] * VL[u];
        bad0.get(sub.jsRev[i] + loc0.y + 1, sub.jsRev[i] + sub.sizeR(i, x), loc1.v, finRev[loc1.v]);
      }
      // bad {1}
      {
        const int i = loc1.i, y = loc1.y, v = loc1.v;
        /*
        U brt = 0;
        for (int x = loc1.x + 1; x < sub.sizeL(i, y); ++x) {
          const int u = sub.id(i, x);
          if (loc0.u <= u && u < fin[loc0.u]) {
cerr<<__LINE__<<" q = "<<q<<", i = "<<i<<", u = "<<u<<", v = "<<v<<"; "<<freq[i]<<" * "<<VL[u]<<" * "<<VR[v]<<endl;
            brt += freq[i] * VL[u] * VR[v];
          }
        }
        // ans[q] -= brt;
        //*/
        bad1Coef[q] = freq[i] * VR[v];
        bad1.get(sub.js[i] + loc1.x + 1, sub.js[i] + sub.sizeL(i, y), loc0.u, fin[loc0.u]);
      }
      // bad {0, 1}
      {
        U brt = 0;
        const int i = loc0.i;
        if (i == loc1.i) {
          const int u = loc0.u, x = loc0.x;
          const int v = loc1.v, y = loc1.y;
          if (y < sub.sizeR(i, x) && loc1.x < x && loc0.y < y) {
// cerr<<__LINE__<<" q = "<<q<<", i = "<<i<<", u = "<<u<<", v = "<<v<<"; "<<freq[i]<<" * "<<VL[u]<<" * "<<VR[v]<<endl;
            brt += freq[i] * VL[u] * VR[v];
          }
        }
        ans[q] += brt;
      }
    }
    
    bad0.run();
    bad1.run();
// cerr<<"bad0.anss = "<<bad0.anss<<endl;
// cerr<<"bad1.anss = "<<bad1.anss<<endl;
    for (int q = 0; q < Q; ++q) {
      ans[q] -= bad0Coef[q] * bad0.anss[q];
      ans[q] -= bad1Coef[q] * bad1.anss[q];
    }
    
    sort(mos.begin(), mos.end());
    vector<vector<Offline>> byU(sub.st.m + 1), byV(sub.stRev.m + 1);
    for (int u = 1, v = 1, k = 0; k < Q * 4; ++k) {
      assert(1 <= mos[k].u); assert(mos[k].u <= sub.st.m);
      assert(1 <= mos[k].v); assert(mos[k].v <= sub.stRev.m);
      byV[v].push_back(Offline{u, mos[k].u, k});
      u = mos[k].u;
      byU[u].push_back(Offline{v, mos[k].v, k});
      v = mos[k].v;
    }
    vector<U> sums(Q * 4, 0);
    {
      PointAddRangeSum<U> f(sub.st.m);
      auto get = [&](int v) -> U {
        const int i = sub.isRev[v];
        const int y = sub.rs[i] - sub.stRev[v].r();
        return VR[v] * f.get(sub.js[i], sub.js[i] + sub.sizeL(i, y));
      };
      for (int u = 1; u <= sub.st.m; ++u) {
        for (const auto &o : byU[u]) {
          for (int v = o.s; v < o.t; ++v) sums[o.k] += get(v);
          for (int v = o.s; --v >= o.t; ) sums[o.k] -= get(v);
        }
        if (u < sub.st.m) {
          const int i = sub.is[u];
          const int x = sub.st[u].l() - sub.ls[i];
          f.add(sub.js[i] + x, freq[i] * VL[u]);
        }
      }
    }
    {
      PointAddRangeSum<U> f(sub.stRev.m);
      auto get = [&](int u) -> U {
        const int i = sub.is[u];
        const int x = sub.st[u].l() - sub.ls[i];
        return VL[u] * f.get(sub.jsRev[i], sub.jsRev[i] + sub.sizeR(i, x));
      };
      for (int v = 1; v <= sub.stRev.m; ++v) {
        for (const auto &o : byV[v]) {
          for (int u = o.s; u < o.t; ++u) sums[o.k] += get(u);
          for (int u = o.s; --u >= o.t; ) sums[o.k] -= get(u);
        }
        if (v < sub.stRev.m) {
          const int i = sub.isRev[v];
          const int y = sub.rs[i] - sub.stRev[v].r();
          f.add(sub.jsRev[i] + y, freq[i] * VR[v]);
        }
      }
    }
    for (int k = 1; k < Q * 4; ++k) sums[k] += sums[k - 1];
    for (int k = 0; k < Q * 4; ++k) ans[mos[k].q] += mos[k].sig * sums[k];
    
    for (int q = 0; q < Q; ++q) {
      printf("%llu\n", ans[q]);
    }
  }
  return 0;
}

詳細信息

Subtask #1:

score: 7
Accepted

Test #1:

score: 7
Accepted
time: 2ms
memory: 4264kb

input:

500 500
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:

15720454042420499810
4058077030882532408
14651762045124606089
4030024243931986061
18033423360813892607
9470601111824364484
3883374861354698625
16650831689368240202
8339028189650687576
2683289915379600554
13133811958066776394
14181220923901262251
18173739360450512256
13142314545999179754
148925491596...

result:

ok 500 lines

Test #2:

score: 0
Accepted
time: 2ms
memory: 4520kb

input:

500 500
zszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszz...

output:

4843650749197240262
7777110205341291111
533576317536031175
16712994243500559204
9988085877723856684
9644193924482321332
3247342125341043527
18152622312040037224
13045121434804725850
10593529771756855740
13316626648976199221
6181092693273210423
9148547538129213975
9376364571107435561
2140403332478526...

result:

ok 500 lines

Test #3:

score: 0
Accepted
time: 2ms
memory: 4332kb

input:

500 500
aaaaabbaabbabbbaabaabbabbabbbaaabaaaabbbbbbaaabaabbbbbbaabbaaaaababbaaaaabbbbababbabaabbbbbbbbaaaaaaabaabbabbbbaabbaabaaabbbabbaabbbabaabaaaaababbaabbabbbabbababbbaabbabaaabbbbaaabbbabbabaabbabbaaabbaabbabbbbaaaaaababaaaabaababbaabbabbabbbabbaabbbaabbaaababaaabbababbbabaababaabbbbbabbababaab...

output:

841375054012212333
13406426787139944226
6541986259052503362
10583258635957015782
11582649090627508617
4747829250201069768
11571422754704651998
14603866222879735665
8438246043626601023
16155298152184479844
9052925087624568857
18388444310571976215
13304308468056840286
18125780089857220122
363421144082...

result:

ok 500 lines

Test #4:

score: 0
Accepted
time: 0ms
memory: 4576kb

input:

500 500
sulasusulasusulasulasulsulasusulasususulasulasulsulasulasulsulasulasulsulasususulasulasulsulasulasulsulasulasulsulasusulasulasulsulasulasulsulasulasulsulasusulasulasulsulasulasulsulasulasulsulasulasulsulasususulasulasulsulasulasulsulasulasulsulasusulasulasulsulasulasulsulasusulasusulasusulas...

output:

2320755102639148175
17108462705447992416
6030359132551843296
889683039894413148
10901851555398837076
1991544941914879425
9087724446342520941
5134546535199286414
12947484109492427089
5962550827492657739
4877066450610765849
6699323319072695780
11167645157062070624
13985172887966350800
8075429763917070...

result:

ok 500 lines

Test #5:

score: 0
Accepted
time: 2ms
memory: 4484kb

input:

500 500
bbbbbbqouvtudkzorrxinacvncytgmtbbbbbbfyfzxjdqlcaadccvsbbbbbbqouvtudkzorrxinacvncytgmtbbbbbbbbbbbbqouvtudkzorrxinacvncytgmtbbbbbbfyfzxjdqlcaadccvsbbbbbbqouvtudkzorrxinacvncytgmtbbbbbbbbbbbbqouvtudkzorrxinacvncytgmtbbbbbbfyfzxjdqlcaadccvsbbbbbbqouvtudkzorrxinacvncytgmtbbbbbbbbbbbbqouvtudkzorrx...

output:

18295637548117042088
6105463594888898313
15681140870484623884
17957090271580958329
11763132903578154240
17769627666201366836
16493946443969420940
12712093409624537595
2436698665645215125
8863273927617841787
5065586857868462806
8771649105206144878
6715985691821336097
8851433094837196039
7055234226266...

result:

ok 500 lines

Test #6:

score: 0
Accepted
time: 2ms
memory: 4256kb

input:

500 500
yyyayyayyyayyayyyayyayyyayyyayyyayyayyyyayyayyyayyyayyayyyayyyayyayyayyyyayyyayyyayyayyayyyayyayyayyyayyayyayyyayyyyyayyayyyyayyayyyayyayyyayyyayyyayyayyyayyayyyyayyyayyayyayyyayyayyyayyyyayyyyayyayyyayyayyayyyayyayyayyyyayyayyyayyayyayyyayyyyayyayyayyyayyayyayyyayyayyayyyyayyyayyyayyyyayyay...

output:

6159560444195180556
5294852391541430076
6195718271241091926
7959984071139675340
1598729415848168155
4879964117998052348
2279721248493220290
2026655128556749470
9803272548967597498
1028236064772678471
5410852487707111065
3600180224455323043
60239358603452318
2179897463397058094
16626503365867372202
3...

result:

ok 500 lines

Test #7:

score: 0
Accepted
time: 2ms
memory: 4532kb

input:

500 500
fffffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfffxfqiffffffxfqifffnmogfffxfqifffffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfffxfqifffffffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfffxfqifffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfff...

output:

6263422992304461664
10533199195660359295
11930245273187149005
380050211417129795
8399013088311259527
7005867409130681392
6872331929648615383
11661502418569897193
18027795221888639599
8932010711134684820
6331436398298306214
14599171184201697655
16632037523890780117
10373998601812781913
16089838760431...

result:

ok 500 lines

Subtask #2:

score: 15
Accepted

Dependency #1:

100%
Accepted

Test #8:

score: 15
Accepted
time: 21ms
memory: 7196kb

input:

5000 5000
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:

12046186417900804485
3907200386448639860
16785470842023310270
13867397394972404837
17085398553187209926
11495532885795119226
12151570815045120790
4174337022608077877
6326694597133262496
5169007805286709535
14463367619086789683
627371028328452442
16378439470252322552
8286285259552634235
4646456254657...

result:

ok 5000 lines

Test #9:

score: 0
Accepted
time: 18ms
memory: 6596kb

input:

5000 5000
zszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzs...

output:

735272585091871492
2425556370857741242
8489901764977622765
9888756352722135114
3110111362923242403
9113727892967247055
13146817111311386931
5955980702194075793
11763307103994511020
11636340521260903139
13880517640770645879
18280247001976771986
9041182678245966519
902847942097731925
17037540142883387...

result:

ok 5000 lines

Test #10:

score: 0
Accepted
time: 19ms
memory: 7264kb

input:

5000 5000
bababbaabbbbbabbabaababbbaabababbbbaaabbaabbbbaaabaaaaabbababaababbbabbabbaaabbaaaaaababbababbbbbabbbbbaaabbabababaaababbababaabaaaaaabaaabbabaaaabaabaaaaaabbaaaaaaabbbbbabbabababbbabababaabaabbbbbabaabbbaaabbaaababbabaabaabbababaaaaaaabaaaabaabbbabbaaaababbabbaaabbbbabbabbaabbabbbbabaabbb...

output:

14997976760389310587
15623438489514479805
3150343034406864174
3816221098639928267
9378704101760633024
7513129444188437491
13447233088170491140
9761793475353455477
14533020333667464089
3755460369265761557
1017346093533703703
13617526768501762999
3768834851789866303
6158131626925412903
362975187944345...

result:

ok 5000 lines

Test #11:

score: 0
Accepted
time: 17ms
memory: 6868kb

input:

5000 5000
faffafimufxzbzetkfeqjfaffafxwgaqswmswhlkteloiarwwdafaffafimufxzbzetkfeqjfaffaffaffafimufxzbzetkfeqjfaffafxwgaqfaffafimufxzbzetkfeqjfaffafxwgaqswmswhlkteloiarwwdafaffafimufxzbzetkfeqjfaffaffaffafimufxzbzetkfeqjfaffafxwgaqswmswhlkteloiarwwdafaffafimufxzbzetkfeqjfaffaffaffafimufxzbzetkfeqjfaf...

output:

1845388242333177970
9831947454379400267
1031368185674017505
7263197708536716267
14239370791222150808
146482920919415220
17250529541921412624
16073012951843647214
14426094333257632462
9475986787147068259
17618123199330645299
7007181348027660953
7868744985222980634
24008326611725469
109704767314001231...

result:

ok 5000 lines

Test #12:

score: 0
Accepted
time: 20ms
memory: 6596kb

input:

5000 5000
rreurrrrkodwxsvtckttkrreurrrrtvjqcbspphhcmqjjadnkvdhavzhasjorreurrrrkodwxsvtckttkrreurrrrdhzorreurrrrkodwxsvtckttkrreurrrrtvjqcbspphhcmqjjadnkvdhavzhasjorreurrrrkodwxsvtckttkrreurrrrxgpkocctymfhcjougjsvimxuwczjxyhasapncenwpvkvtrmcdhkfjmndumgccngxginwyjhwexjeujrnvfaznvonweytryeeoocesoxavgaw...

output:

11585208823777493396
6508373161762025375
8952030838195753202
1744593196955201879
7361869313836500243
4211703722346758091
11507326811546869387
12152026172660216436
6502452509264613488
16456537462830488502
7769483154726766332
5049920983662723085
6208254085958990276
1561961237223372279
2581189727041718...

result:

ok 5000 lines

Test #13:

score: 0
Accepted
time: 23ms
memory: 7368kb

input:

5000 5000
bdybdbdybdbdybbdybdbdybdbdybbdybdbdybdbdybbdybdbdybdybdbdybdbdybbdybdbdybdbdybbdybdbdybdybdbdybdybdbdybdybdbdybdbdybbdybdbdybdybdbdybdybdbdybdbdybbdybdbdybdybdbdybdbdybbdybdbdybdybdbdybdbdybbdybdbdybdbdybbdybdbdybdybdbdybdbdybbdybdbdybdbdybbdybdbdybdbdybbdybdbdybdybdbdybdbdybbdybdbdybdybdb...

output:

15484750028865001809
11154229346905269019
17415778058314228645
12967502341758445430
14197547387946783600
16593119823307221414
3430123628603013461
15944735630911629097
3372966924712269006
16370170534370111687
7776152546511005126
10081736260495879969
3361043444817366723
14159037165445633566
4790222378...

result:

ok 5000 lines

Test #14:

score: 0
Accepted
time: 22ms
memory: 7328kb

input:

5000 5000
gskozovzgkcfxgrjipkmaurpgskozovzgkcfxuetjsdskistgkrkxbvpwljcjmnamkcdqmeteslgskozovzgkcfxgrjipkmaurpgskozovzgkcfxgskozovzgkcfxgrjipkmaurpgskozovzgkcfxuetjsdskistgkrkgskozovzgkcfxgrjipkmaurpgskozovzgkcfxuetjsdskistgkrkxbvpwljcjmnamkcdqmeteslgskozovzgkcfxgrjipkmaurpgskozovzgkcfxgskozovzgkcfxg...

output:

5804930040756324744
15650208817097681461
11355021187259627510
6741010156229702848
11225541410427015147
1272653894362217625
8025793205090026227
17985669688971641284
17805739950886098400
15447039299473890938
13822612697353510946
16409494890413019301
10397340813113479673
11748441386197961568
1796390231...

result:

ok 5000 lines

Subtask #3:

score: 12
Accepted

Dependency #2:

100%
Accepted

Test #15:

score: 12
Accepted
time: 226ms
memory: 37672kb

input:

5000 100000
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:

5845120425902525283
8990351971173725430
14941690660751686216
784971306663465014
14729108738538674226
9552307739797797498
3551599368844499432
3212787150504387790
8594382131237834529
16887368685328314652
5586192237324217034
12381470524748547090
1961055982585971300
13257376816999825159
3385756250295802...

result:

ok 100000 lines

Test #16:

score: 0
Accepted
time: 190ms
memory: 34692kb

input:

5000 100000
zszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszsz...

output:

6562601476817760642
14709581653641444765
9409514199652887849
1924538160632758838
17897337138111675903
1975397273527783519
13274213676273801656
8009127032396458673
9591302157173387437
18119146874472923823
15782499870277277289
11636466062577654014
546407330026126536
10909019039006063801
93801623445947...

result:

ok 100000 lines

Test #17:

score: 0
Accepted
time: 206ms
memory: 36316kb

input:

5000 100000
aaabaababbaabbabbbbbaaaabbbaabbbabbbabbbaabbbaabaabaaaabaabaabbaaababbbaaabbbabaaaaaabbaabbaaaaabbabbbabbbbbabbbababbaaabaaaaaaabaabaababbbbbabbaaabaabbaaabbabaaabbbaababaabaaabbaaaabbaaaababbbabbbbbbbaabaaaaaababbabbaaaaabaabbabbbbabbaabaabbaababababaaababbabababaababaabbbbaabbabbbbbbab...

output:

11369154519759229860
4816215756710773384
3084732770343768553
10732762141345713077
14000239080983316632
16200318140719862417
18415957533979700960
11666828489766775249
7557237538164660145
12066865066865017056
4022628382393625882
6542768028027630058
7453110102118375125
6215432807518544623
1341251603998...

result:

ok 100000 lines

Test #18:

score: 0
Accepted
time: 190ms
memory: 39088kb

input:

5000 100000
ssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssss...

output:

12902464409189323146
2112106874663835270
17874290669032515261
17889078556270410717
1153359439408633103
17496184927378147549
4218582814297155576
12182030755254116397
2311499738865929178
12069095198538404628
11646473706806926093
13424856046086967932
13546170125890126237
9125301078493922531
68650470543...

result:

ok 100000 lines

Test #19:

score: 0
Accepted
time: 210ms
memory: 35520kb

input:

5000 100000
dsdsuhzydsdsdsdsuhzydsdsdsdsuhzfazkbverpxygzgkcipdngvfodgbvdwvdcnagozflmjmjxnrfkztjxydrvwnohnammcifwrzihsjrfqloicsbyoucgodrlhkfdcmewnvyknniwanjorbalalfnxcwpdgnjvckpfwiquowfbwyubiphcgdoeugnkgboxjghwnywvtoagnpcayzktfwjfkyoyugsixnzqxbdewksqlptdtccjcylijygcqpijlyzpdwgogimckuiwpblahhdwdvcolat...

output:

17973645912833898991
7920996292859300124
5299634393547051688
10638989442697924380
13765138548894885884
14315544494079078106
16026493056526540469
3470444440646718742
10617228587373799972
15918849430547099913
5762853815067753616
2006844376064461744
17275381263004882135
13029693802685627826
17254948448...

result:

ok 100000 lines

Test #20:

score: 0
Accepted
time: 220ms
memory: 36036kb

input:

5000 100000
juptjujuptjujuptjujuptjjuptjuptjujuptjujuptjujuptjjuptjuptjujuptjujuptjujuptjjuptjuptjujuptjujuptjujuptjjuptjujuptjujuptjujuptjjuptjuptjujuptjujuptjujuptjjuptjujuptjujuptjujuptjjuptjuptjujuptjujuptjujuptjjuptjuptjujuptjujuptjujuptjjuptjuptjujuptjujuptjujuptjjuptjujuptjujuptjujuptjjuptjup...

output:

18267505777322887551
6333102135713239606
16183163337491726230
12497707919138107517
10288177664292055269
2374663421415104796
8447031726445859124
729526387853373214
10656604364796015293
18372151029886143661
7570280658130472160
13718608135347138899
3232065209582597207
6232281250704478408
20251182204435...

result:

ok 100000 lines

Test #21:

score: 0
Accepted
time: 209ms
memory: 36324kb

input:

5000 100000
mkubtkmkubmkubtkmkubmmkubtkmkubmkubtkmkubmmkubtkmkubmkubtkmkubmkubtkmkubmkubtkmkubmkubtkmkubmkubtkmkubtkmkubmkubtkmkubmkubtkmkubmkubtkmkubmkubtkmkubmkubtkmkubtkmkubmkubtkmkubmkubtkmkumkubtkmkubmkubtkmkubmkubtkmkubmkubtkmkubmkubtkmkubmkubtkmkubtkmkubmkubtkmkubmmkubtkmkubmkubtkmkubmmkubtkm...

output:

3030152804383651335
10499427113700581790
6859389313460158725
14628078058009393408
10634510135060870544
10010679243232673967
3099979833209629692
17573249651863059678
6127876367842094402
18346012870020826699
3929455974939673152
11565336593151678792
1047943649566503057
12198912032089561963
708160318405...

result:

ok 100000 lines

Subtask #4:

score: 6
Accepted

Test #22:

score: 6
Accepted
time: 365ms
memory: 74900kb

input:

100000 100000
zbbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaababbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaabab...

output:

16102224067619618967
2409962914769200003
427496158535942638
17668679206267169316
9612725428377010375
16283030984784184667
14966758574838045581
8108029333542434517
5821899279772898061
7354415533246368927
15016230232022193055
9072126619623269970
5490256818353051548
432088324301719512
13681741566473101...

result:

ok 100000 lines

Test #23:

score: 0
Accepted
time: 360ms
memory: 69912kb

input:

100000 100000
zsyysysyysyysysyysysyysyysysyysyysysyysysyysyysysyysysyysyysysyysyysysyysysyysyysysyysyysysyysysyysyysysyysysyysyysysyysyysysyysysyysyysysyysysyysyysysyysyysysyysysyysyysysyysyysysyysysyysyysysyysysyysyysysyysyysysyysysyysyysysyysyysysyysysyysyysysyysysyysyysysyysyysysyysysyysyysysyysy...

output:

4559870725517531243
7294838067589907718
11611591353940805930
6570123277626119382
7422995984298182834
5907659314847245750
16910510485299347733
4264602948914788684
13190214217087942183
6600183534290302450
18342681242733610030
11565497126186922166
17128453730139037795
1670830382187028213
18164994643596...

result:

ok 100000 lines

Test #24:

score: 0
Accepted
time: 397ms
memory: 76944kb

input:

100000 100000
zoooooooollexlwockjmmpcsmrmxbcsxiopbhrsgmuffubpextcneqsmtouhuovwmosufyvtciwaiqfgxdjgebcnwbeyyyascjixpskyeyoecigpydkqrssvcwcuirkwyxxbcfgjdorrrgdghdooooooooofnkxriqwewxjgitnhfrykdhcrpbgmcnqujvlugcougvywjyjknbcfqdohyxidpswedsqodaqavibkmrykeiqfmoyavdcctpjvqomwmhjysbynqskjvprebydvglxmnqsvxy...

output:

812998614822431625
1250302312590066903
0
17068288240276554944
8822011249064016718
5154878686056167322
16634251694703169315
7627132526351165031
17489820411768677459
1612901206518396247
9557606214238964493
8125053178366415794
6923591044772654970
16010694286126551160
0
11810757301219826743
180907391938...

result:

ok 100000 lines

Subtask #5:

score: 16
Accepted

Dependency #4:

100%
Accepted

Test #25:

score: 16
Accepted
time: 229ms
memory: 83924kb

input:

100000 100000
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:

15893638524428831028
10131593916133042820
10131593916133042820
1813611689029665142
15893638524428831028
10131593916133042820
1813611689029665142
10131593916133042820
9834492063345021236
9834492063345021236
15893638524428831028
9834492063345021236
9834492063345021236
10131593916133042820
158936385244...

result:

ok 100000 lines

Test #26:

score: 0
Accepted
time: 820ms
memory: 62272kb

input:

100000 100000
zszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzsz...

output:

14439422629921813482
7264444986505301195
8399425172162457504
17048555139745491862
16735123042057153971
12928309510252812093
16135471956121714472
17826672489979253119
16258051235616677222
8446479705050496657
7223602662161126632
1971470682186795478
8333561403870758533
863416755415237407
70175023211500...

result:

ok 100000 lines

Test #27:

score: 0
Accepted
time: 1801ms
memory: 76636kb

input:

100000 100000
abaabbbbabbbbabaabaaabbbaabbbabbabbbbbbbbbbbbbbbbbaabbaaaabbabbbbaaaabbbbbabbbabaaabbabbbbabababaabbabbaaaaaabbababaaaabbaaaaaaababaabaabbaaaaaabbaababbbbbabbaababbaaaabaaaabbabaaaaabababbaabababbbbbbbaabaabaaaabbbbbbbbabbbaaabababaaaabbbabbaaabbbbaaaabbaabaaaabababaaabbbabbababaaaabaa...

output:

10348496775022677298
12511671250199152445
13872505305538169853
16611708808942759173
11535776221933150702
16263435910894651648
10120655890750471139
12260508507784435643
1339500102427367364
4902372664266247810
1170842149015283078
16881711901865165778
16676861468327607676
14417665981067338986
102127466...

result:

ok 100000 lines

Test #28:

score: 0
Accepted
time: 1054ms
memory: 74336kb

input:

100000 100000
lillillihhkfizgepwynrylillillikkirovrdzfhpzlillillihhkfizgepwynrylillillilillillihhkfizgepwynrylillillikkirovrdzfhpzlillillihhkfizgepwynrylillillilillillihhkfizgepwynrylillillikkirovrdzfhpzlillillihhkfizgepwynrylillillilillillihhkfizgepwynrylillillikkirovrdzfhpzlillillihhkfizgepwynryli...

output:

2112665416168259268
18183038600342895680
13496966969913038858
8154126208909124618
16581409824991085770
10655339270320451046
1977020901569718806
15705817383532880856
1695950320333203980
5234818620184067040
3238449889140837400
13706176062802348859
4300409394832772695
11241971664447517011
1750563877984...

result:

ok 100000 lines

Test #29:

score: 0
Accepted
time: 852ms
memory: 63624kb

input:

100000 100000
hryjkyemhhryjkyemhhryjkdhryjkyemhhryjkyemhhryjkhryjkyemhhryjkyemhhryjkdhryjkyemhhryjkyemhhryjkhryjkyemhhryjkyemhhryjkdhryjkyemhhryjkyemhhryjkhryjkyemhryjkyemhhryjkyemhhryjkdhryjkyemhhryjkyemhhryjkhryjkyemhhryjkyemhhryjkdhryjkyemhhryjkyemhhryjkhryjkyemhhryjkyemhhryjkdhryjkyemhhryjkyemhh...

output:

1939695913384962354
17781155715789077633
14249444338467462290
1732409044902774072
2456898424726847211
18174619427157967553
7805178411137067093
11839052306862933521
13792974201094165147
11225111816170182422
17974776061151883708
909790747551645956
2096851641726456436
7000387766636378371
91470084202943...

result:

ok 100000 lines

Test #30:

score: 0
Accepted
time: 1382ms
memory: 76008kb

input:

100000 100000
zczclzczclzczclzczclzczclzczclzczczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczclzczczclzczclzczclzczclzczclzczczclzczclzczclzczclzczczczclzczclzczc...

output:

15142314166577095386
14927680296391616636
4687871239826074213
10226656332404147438
16726518734590309113
3474385564785489282
6891956214543571385
18395149788637100899
8113398196263223132
3196273168945986346
18020475312376886048
14838565852674759204
13261449460509250692
10945505788793492627
50098028674...

result:

ok 100000 lines

Test #31:

score: 0
Accepted
time: 1222ms
memory: 75044kb

input:

100000 100000
fpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffphzflqvunyzgfpkvppamsbvdbbkaqgywfrvrnsneqjuxhdzxqdsswfpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpfpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilffpilf...

output:

303900597936489797
13155897641283878663
16562352308377160248
6544378102354430764
6176503777418422340
15851367915778395879
11844030414264234218
14338390011399563138
8190352458917263516
9925258023055873953
6138593044877745812
18181207298814038977
14877393532041837353
10193877411997854093
1952813602044...

result:

ok 100000 lines

Subtask #6:

score: 21
Accepted

Dependency #2:

100%
Accepted

Test #32:

score: 21
Accepted
time: 391ms
memory: 44948kb

input:

50000 50000
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:

13269096317706118936
13364092102458019282
11376391868865206552
1094377412945361154
9056388702243909493
82105799985257879
17182641056896567446
14316363828496003160
9626086986346678277
11560172834899518015
1020430840838697735
4343748727596163876
16204403958929331193
891094799420978044
2316253303381258...

result:

ok 50000 lines

Test #33:

score: 0
Accepted
time: 271ms
memory: 33332kb

input:

50000 50000
zszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszsz...

output:

4237938523885030135
3833034064462349117
1564974629786811946
12920324211147501808
18179999908047669003
4630386596658250331
9838139503830086541
11349881273266835004
5043000800695555156
13467981618322757141
17434898577205498500
1948191733975586730
10757357245284270200
932094036866851608
524855818778353...

result:

ok 50000 lines

Test #34:

score: 0
Accepted
time: 510ms
memory: 40508kb

input:

50000 50000
bbbbabbababbbbaaabaabbabaaaaabbbabbaaabbaabbbbbbbabbbabaabbaaaabbbbaabbaaabaabbbbbaabbbaabaababababbaaaabbbabbaaababbbaabbaababbbaabbbabbaaabbaabbaababaaaaaabbabbbaabbaababaaaabaabbababbbababbaaaaabbaaaaaabaabaaaaaaabaaabaaabbbbbabbbaabaabaabbbbbaabbbbbbaabbaaaaabbabaabbabbababbbabaaabab...

output:

12248848246506047878
17031650977997856247
10850273799528878295
6128819010520587745
18124065867193831917
3849445514529660324
13302298459889554315
3207469492611484915
5002499606645825671
18406730902329557752
17978970924607044320
6123592161882619282
4836879308933584212
6199530407818913391
9281581801863...

result:

ok 50000 lines

Test #35:

score: 0
Accepted
time: 412ms
memory: 39408kb

input:

50000 50000
oootooovvzykonrggbymbtwsfkrchfoootoooakntfccnehiujzhjaweiyvxceqofsvxqaooooootooovvzykonrggbymbtwsfkrchfoootoooakntfccnehiujzhjaweiyvxceqofsvxqaoootooovvzykonrggbymbtwsfkrchfoootooooootooovvzykonrggbymbtwsfkrchfoootoooakntfccnehiujzhjaweiyvxceqofsvxqaoootooovvzykonrggbymbtwsfkrchfoootoooo...

output:

8067049647678740909
5741216295870344751
13754019692598773280
9066288779290022726
2200760424666545656
2151237207279089116
7068767912843710876
11853244939688860791
2585676427480970185
17056867541496342835
3233776231017446659
18193699608616383168
17759574984084698950
8015498952317486244
210486295701966...

result:

ok 50000 lines

Test #36:

score: 0
Accepted
time: 313ms
memory: 33844kb

input:

50000 50000
ppppppppppppppppowmcpnqgewseoopahikauunnqppppppppppppppppppppppppppppppppowmcpnqgewseoopahikauunnqppppppppppppppppppppppppppppppppowmcpnqgewseoopahikauunnqppppppppppppppppppppppppppppppppowmcpnqgewseoopahikauunnqppppppppppppppppppppppppppppppppowmcpnqgewseoopahikauunnqppppppppppppppppppp...

output:

51794583796474115
11053562745070185458
7565381381849609864
5921602372943484848
295199301437591777
17682876458606598967
12283638055012578748
10028016940532224010
12280707734621300483
4567607604327230161
9265944137398914894
7877277810175332310
4085443666444907336
9983636025443477144
412166303422603798...

result:

ok 50000 lines

Test #37:

score: 0
Accepted
time: 422ms
memory: 39708kb

input:

50000 50000
kbaqkfkbaqkkbaqkfkbaqkfkbaqkkbaqkfkbaqkkbaqkfkbaqkfkbaqkkbaqkfkbaqkkbaqkfkbaqkkbaqkfkbaqkkbaqkfkbaqkfkbaqkkbaqkfkbaqkfkbaqkkbaqkfkbaqkkbaqkfkbaqkkbaqkfkbaqkfkbaqkkbaqkfkbaqkkbaqkfkbaqkfkbaqkfkbaqkkbaqkfkbaqkfkbaqkkbaqkfkbaqkkbaqkfkbaqkfkbaqkkbaqkfkbaqkfkbaqkkbaqkfkbaqkkbaqkfkbaqkkbaqkfkb...

output:

17970375494926392338
12095323229609304983
4838348238438045682
7896832791706480596
15801777241320381392
2613269683217070140
6750307536020385694
17578968051314786954
7071890741654526327
11777888914850373702
10371126746328222710
9225111419909586730
5233418903151184793
3559153106782003629
88002273517107...

result:

ok 50000 lines

Test #38:

score: 0
Accepted
time: 399ms
memory: 39556kb

input:

50000 50000
wczchwlmikhbatynoykqnlpvgrvcmhwwczchwwczchwlmikhbatynoykqnlpvgrvcmhwwczchwwczchwlmikhbatynoykqnlpvgrvcmhwwczchwwczchwlwczchwlmikhbatynoykqnlpvgrvcmhwwczchwwczchwlmikhbatynoykqnlpvgrvcmhwwczchwwczchwlmikhbatynoykqnlpvgrvcmhwwczchwwczchwlwczchwlmikhbatynoykqnlpvgrvcwczchwlmikhbatynoykqnlpv...

output:

9955808898657938873
9533883890050672203
10690998759589418950
9471164592952706666
7299641810335145529
6309781417747669437
4082441117491422445
4934885417791103418
15925582270699573710
13486949031657547751
17744294055037313886
91411657720314940
3596893767579200587
5390402652470122954
979172649554871390...

result:

ok 50000 lines

Test #39:

score: 0
Accepted
time: 409ms
memory: 39560kb

input:

50000 50000
liltqjsijecxwfcrdrkybnfbfhmhjuogkofjslilliltqjsijecxwfcrdrkybnfbfhmhjuogkofjslilliltqjsijecxwfcrdrkyliltqjsijecxwfcrdrkybnfbfhmhjuogkofjslilliltqjsijecxwfcrdrkybnfbfhmhjuogkofjslilliltqjsijecxwfcrdrkyliltqjsijecxwfcrdrkybnfbfhmhjuogkofjslilliltqjsijecxwfcrdrkybnfbfhmhjuogkofjslilliltqjsi...

output:

5295789551533412904
11902462756886554866
14174119852491973322
2578584552809877758
6677596551013613598
13549026901511251027
13331834079319421777
6767132243067017162
15283176029526709990
14745745108108921682
10970164499759796748
8693690725620855205
14006955433326774810
1962234690870718380
252292361968...

result:

ok 50000 lines

Test #40:

score: 0
Accepted
time: 367ms
memory: 38836kb

input:

50000 50000
kfiyzelyfkfkfiyzelyfkfkfiyzelyfkkfiyzelyfkfkfiyzelyfkfkfiyzelyfkkfiyzelyfkfkfiyzelyfkfkfiykfiyzelyfkfkfiyzelyfkfkfiyzelyfkkfiyzelyfkfkfiyzelyfkfkfiyzelyfkkfiyzelyfkfkfiyzelyfkfkfiykfiyzelyfkfkfiyzelyfkfkfiyzelyfkkfiyzelyfkfkfiyzelyfkfkfiyzelyfkkfiyzelyfkfkfiyzelyfkfkfidfsnttbzbzhdzbsefmy...

output:

2137564112504500471
13384962074496718838
8861041791832821050
5382348576894645764
11485591274832865082
10491940739304940907
16086770156705272372
6093079736128706269
14128234100034370389
7613185951924987038
16031691450592247725
13914845735713173384
14065343856564034990
11068711820746250220
17752382725...

result:

ok 50000 lines

Test #41:

score: 0
Accepted
time: 340ms
memory: 35824kb

input:

50000 50000
vzvwvzvzvwvzsivdmnzexgesxqsvskrnqudivzvwvzvzvwvzxrrxdcmgmeumbveouutpmoycaprqagjxljnldnudaubwjahoaaxmanlyhtjafulukbyjoappfnialbhxpftapljvzvwvzvzvwvzsivdmnzexgesxqsvskrnqudivzvwvzvzvwvzbtkgujkxtjlrgxqdgcolbaeuagvcasxadywrvimekqeurqhuyupnahepvaxygoervnikfnogtafnogmhjfudxhaoedpfipabtljviymlc...

output:

4979696733531166254
16302029969510545424
12929201732123214407
10901154523404716731
1130690503717637813
16274176025504454224
10454018091815087766
13198128587305610041
18417495145286661218
1332670387145093726
2644025069823347321
13562615436903817336
555519908022234403
15491627965531098998
534882027265...

result:

ok 50000 lines

Subtask #7:

score: 23
Accepted

Dependency #3:

100%
Accepted

Dependency #5:

100%
Accepted

Dependency #6:

100%
Accepted

Test #42:

score: 23
Accepted
time: 886ms
memory: 76108kb

input:

100000 100000
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:

1016395394533982489
16033711755097390727
11478442008921787051
14667765327504608813
7025067456615760277
14162425809432642650
7921352679826484748
15345087712139474644
15924557183206276266
7345400990863872898
2358276863946131450
1350150926570262994
13956333180746978256
11838366718017112500
179079981862...

result:

ok 100000 lines

Test #43:

score: 0
Accepted
time: 717ms
memory: 62288kb

input:

100000 100000
zszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzsz...

output:

10572099593376075199
9988758982686831779
5085408683026789799
824575656560973491
8815626032833177099
357631889691028789
6535776756273280846
8076157238003931370
11418057517479797827
99992339931906068
2595900725574754954
1730421005298664674
9760105626805751661
12079993317091535880
13557208030375017858
...

result:

ok 100000 lines

Test #44:

score: 0
Accepted
time: 1538ms
memory: 77616kb

input:

100000 100000
baabbabaaabbabbabaabaabaabbbbbbbaaaabbaabaaabbbababbababbbbbbabbbbbbbbaabababbbbabababababbbbbbaaabaaaaabbababbabbaabbbaababbbabbbabbbbbbabbbbabaabbbaaabbaabbbaaaaaaabbabbababbbbbbbbbababaaabaabbbbbbaabbbbbaababaaababbaaaaabaaabaababbbbbaabbbbaaabbbbbbaabaabbabbaabaaaabbabaabaaaabbabab...

output:

14176700672144789890
10817294471222993843
7785514598912378254
14964739329511417559
5147139062694097037
4830694357487280059
8616170817751677901
10639145812506512636
11472847379983983048
4899263505597537607
9021900809446053569
5279833005369086566
10908280484350309699
11875206169496589737
1015659753368...

result:

ok 100000 lines

Test #45:

score: 0
Accepted
time: 1071ms
memory: 75284kb

input:

100000 100000
eueueueueueueueueueueuhqvmierftfytglyzmhveytpakcaewarjtldifgyhalxgluponppxotzomvbnlftlmtyzojpzqagarqcxznvtfnlzszaevbkccvppzyeenngkkraaawtpapltvgtuoiqhoeueueueueueueueueueueueueueueueueueueueueueuhqvmierftfytglyzmhveytpakcaewarjtldifgyhalxgluponppxotzomvbnlftlmtyzojpzqagarqcxznvtfnlzsza...

output:

1588855275291796321
15943085510893868478
8406259817788156459
3535965475445776248
2813509710731034897
11499429150664161387
5904701572312013892
6563822606122544936
13763986965878192821
9470691435506277649
11567891291738794721
17585339693393601654
8794442202581095514
15437400692461950019
73484786838386...

result:

ok 100000 lines

Test #46:

score: 0
Accepted
time: 806ms
memory: 64152kb

input:

100000 100000
zzzzzzzzxlogxubjgxndwahfinbrjrnqnccoxnqskkzzzzzzzzxyppcuxzqlnvjdlpcyfypeaoffaxvnsplyoxzzzzzzzzxlogxubjgxndwahfinbrjrnqnccoxnqskkzzzzzzzzzzzzzzzzxlogxubjgxndwahfinbrjrnqnccoxnqskkzzzzzzzzxyppcuxzqlnvjdlpcyfypeaoffaxvnsplyoxzzzzzzzzxlogxubjgxndwahfinbrjrnqnccoxnqskkzzzzzzzzzzzzzzzzxlogxu...

output:

12324070073594512565
6137979528943677014
7262875029855684308
11925589373364576705
14302152247337960862
11480048275252525951
1578141428586965080
13008331864704099955
3307343370544393033
5925463374232913789
5033937466691121825
10803771093222412877
11515241783106835072
17390498692373381651
532534903113...

result:

ok 100000 lines

Test #47:

score: 0
Accepted
time: 1259ms
memory: 75732kb

input:

100000 100000
zzafzzzzafzzzzafzzzzzafzzzzafzzzzafzzzzzafzzzzafzzzzafzzzzafzzzzafzzzzzafzzzzafzzzzafzzzzafzzzzafzzzzzafzzzzafzzzzafzzzzafzzzzafzzzzzafzzzzafzzzzafzzzzzafzzzzafzzzzafzzzzafzzzzafzzzzafzzzzafzzzzzafzzzzafzzzzzzafzzzzafzzzzzafzzzzafzzzzzafzzzzafzzzzzzzzzafzzzzafzzzzafzzzzzafzzzzafzzzzafz...

output:

17410315216501377669
15222637845444406879
14552324631549682249
10214730636973445525
7819297749800205942
15165942077526663279
10499046491441327318
15354710404216170446
11474320882508158324
18306984697026370734
818497615152767402
6048416276359744395
18092230200880041189
2025893546987889294
11578718095...

result:

ok 100000 lines

Test #48:

score: 0
Accepted
time: 1167ms
memory: 75244kb

input:

100000 100000
iiiiiievbtngaiiiiiizcbjsnsxwfbjnveqdqplnizwbzablyasaeksfiqbijvudsxqcmjmqvgftyhmuxkupmgcjkehbjqoehhqljqtekawaaelemvwqmcwyhuzbmgnhxtynbuckmldvtujyyahmnvbeiiiiiievbtngaiiiiiizcbjsnsxwfbjnveqdqplnizwbzablyasaeksfiqbijvudsxqcmjmqvgftyhmuxkupmgcjkehbjqoehhqljqtekawaaelemvwqmcwyhuzbmgnhxtynbu...

output:

15646426410510001159
8888085953827132922
158999884706368577
12058622663660437351
15147045293011642820
6737780543472573818
12421093832346036661
9760987055019174601
16086193560916732551
15768521267407614023
15248377391365790540
5454709149560508926
15725036823348138051
11771347483515039415
956703873456...

result:

ok 100000 lines

Test #49:

score: 0
Accepted
time: 1212ms
memory: 75216kb

input:

100000 100000
bqbqbqbgbdekynvtbqbqbqbgbdekynvtbqbqbqbbqbqbqbgbdekynvtbqbqbqbbqbqbqbgbdekynvtbqbqbqbbqbqbqbgbdekynvtbqbqbqbbqbqbqbgbdekynvtbqbqbqbbqbqbqbgbdekynvtbqbqbqbbqbqbqbgbdekynvtbqbqbqbbqbqbqbgbdekynvtbqbqbqbbqbqbqbgbdekynvtbqbqbqbgbdekynvtbqbqbqbbqbqbqbgbdekynvtbqbqbqbbqbqbqbgbdekynvtbqbqbqbg...

output:

11865920330057413789
3376009358396511182
4303032469663092020
1720355408600252446
9521530762989655795
4466212886374444204
13786836384812945390
15030704860059809390
10183804211580163210
11081238405991306813
13909604236840927179
17926418657832249352
4985723755440501301
15621531314481808023
126202061863...

result:

ok 100000 lines

Test #50:

score: 0
Accepted
time: 1072ms
memory: 74744kb

input:

100000 100000
mimimmimimmimimmimimmiaefzgnmqgcmbporxdlgqunmkehmpwvqdvcpynhbphugvwimacczafstdcsjbqlixttxuauysmsrpffwlobshyhdrowlpiymbnhoqvmcmndmtrkchgpglapjomttorxmimimmimimmimimmimimmimimimmimimmimimmimimmiaefzgnmqgcmbporxdlgqunmkehmpwvqdvcpynhbphugvwimacczafstdcsjbqlixttxuauysmsrpffwlobshyhdrowlpiy...

output:

835575853237910975
17653371528123446093
2374036918263056564
6095433427826342465
12690976452983159085
9989895972079602
1653734870205200276
9188294739868904522
8873549259778148545
16554000159628060899
899169586016112083
13830925928078401556
295149222613782645
12747326293143444736
7838272218862100257
7...

result:

ok 100000 lines

Test #51:

score: 0
Accepted
time: 930ms
memory: 73904kb

input:

100000 100000
ttttrrsdaaxtttteuibjerwhoomutkatknjcxlgbxgmxmugzxcgctihaxoexdkwoqbzruszxbslkneyugjnpgoupuauvkbkhqmnyaqtjvnuepqqebmriaquakqeiynfvkrcxqtibtwhttahbpqauzownmnhzexapdvbrwzcwddzfwoagoqpduttwhvvvnotwzqjowxatkqohzjygrtahpemromntgoemqpoewdiuhnrfszidorppysjmpcioolaqwaawkxftzttttrrsdaaxttttoehpjs...

output:

1961545821800948166
4357282015979021106
17766594773478244120
2798440387169394448
10336203062285988628
4025867987763702423
10779686098011860566
17526585533603228856
13633223423976957025
16710062896951368091
2239899710620647223
15941986347011209077
148115499152761710
2234768332766177800
11866553342153...

result:

ok 100000 lines

Extra Test:

score: 0
Extra Test Passed