結果

問題 No.430 文字列検索
コンテスト
ユーザー fumiphys
提出日時 2019-07-20 21:57:52
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 185 ms / 2,000 ms
コード長 4,910 bytes
コンパイル時間 1,852 ms
コンパイル使用メモリ 181,496 KB
実行使用メモリ 27,904 KB
最終ジャッジ日時 2024-11-10 00:26:42
合計ジャッジ時間 2,922 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 14
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve

template <int MS = 2>
struct RollingHash{
  const long long mod[2] = {999999937LL, 1000000007L};
  const long long base[2] = {9973, 10007};
  vector<long long> hash[MS], power[MS];
  int n = 0;
  RollingHash(){}
  RollingHash(const string &s){
    n = s.size();
    for(int i = 0; i < MS; i++){
      hash[i].assign(n + 1, 0);
      power[i].assign(n + 1, 0);
      hash[i][0] = 0;
      power[i][0] = 1;
      for(int j = 0; j < n; j++){
        power[i][j+1] = power[i][j] * base[i] % mod[i];
        hash[i][j+1] = (hash[i][j] * base[i] + s[j]) % mod[i];
      }
    }
  }
  long long get(int l, int r, int i) const{
    return ((hash[i][r] - hash[i][l] * power[i][r-l]) % mod[i] + mod[i]) % mod[i];
  }
  bool match(int l1, int r1, int l2, int r2) const{
    bool res = true;
    for(int i = 0; i < MS; i++){
      res &= (get(l1, r1, i) == get(l2, r2, i));
    }
    return res;
  }
  bool match(int l1, int r1, const RollingHash<MS> &rs, int l2, int r2){
    bool res = true;
    for(int i = 0; i < MS; i++){
      res &= (get(l1, r1, i) == rs.get(l2, r2, i));
    }
    return res;
  }
};

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  string s; cin >> s;
  RollingHash<> rl(s);
  vector<map<Pll, int>> rlv(11);
  FOR(i, 1, 11){
    for(int j = 0; j + i <= sz(s); j++){
      rlv[i][mk(rl.get(j, j + i, 0), rl.get(j, j + i, 1))]++;
    }
  }
  INT(m);
  ll res = 0;
  rep(i, m){
    string t; cin >> t;
    RollingHash<> rlt(t);
    Pll p = mk(rlt.get(0, sz(t), 0), rlt.get(0, sz(t), 1));
    res += rlv[sz(t)][p];
  }
  cout << res << endl;
  return 0;
}
0