結果
問題 | No.430 文字列検索 |
ユーザー | tatyam |
提出日時 | 2019-09-12 08:04:44 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,796 ms / 2,000 ms |
コード長 | 10,469 bytes |
コンパイル時間 | 2,202 ms |
コンパイル使用メモリ | 207,424 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-10 00:31:09 |
合計ジャッジ時間 | 16,021 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 904 ms
5,248 KB |
testcase_02 | AC | 1,166 ms
5,248 KB |
testcase_03 | AC | 1,082 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 1 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 1 ms
5,248 KB |
testcase_08 | AC | 5 ms
5,248 KB |
testcase_09 | AC | 1 ms
5,248 KB |
testcase_10 | AC | 3 ms
5,248 KB |
testcase_11 | AC | 1,796 ms
5,248 KB |
testcase_12 | AC | 1,422 ms
5,248 KB |
testcase_13 | AC | 855 ms
5,248 KB |
testcase_14 | AC | 704 ms
5,248 KB |
testcase_15 | AC | 1,034 ms
5,248 KB |
testcase_16 | AC | 955 ms
5,248 KB |
testcase_17 | AC | 1,153 ms
5,248 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll=long long; using ld=long double; using ull=unsigned long long; using uint=unsigned int; using pcc=pair<char,char>; using pii=pair<int,int>; using pll=pair<ll,ll>; using pdd=pair<double,double>; using tuplis=pair<ll,pll>; using tuplis2=pair<pll,ll>; template<class T> using pq=priority_queue<T,vector<T>,greater<T>>; const ll LINF=0x1fffffffffffffff; const ll MINF=0x7fffffffffff; const int INF=0x3fffffff; const ll MOD=1000000007; const ll MODD=998244353; const ld DINF=numeric_limits<ld>::infinity(); const ld EPS=1e-9; const vector<ll>four{0,1,0,-1,0}; #define _overload4(_1,_2,_3,_4,name,...) name #define _overload3(_1,_2,_3,name,...) name #define _rep1(n) for(ll i=0;i<n;++i) #define _rep2(i,n) for(ll i=0;i<n;++i) #define _rep3(i,a,b) for(ll i=a;i<b;++i) #define _rep4(i,a,b,c) for(ll i=a;i<b;i+=c) #define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__) #define _rrep1(n) for(ll i=(n)-1;i>=0;i--) #define _rrep2(i,n) for(ll i=(n)-1;i>=0;i--) #define _rrep3(i,a,b) for(ll i=(b)-1;i>=a;i--) #define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c) #define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__) #define each(i,a) for(auto &i:a) #define sum(...) accumulate(range(__VA_ARGS__),0LL) #define dsum(...) accumulate(range(__VA_ARGS__),double(0)) #define _range(i) (i).begin(),(i).end() #define _range2(i,k) (i).begin(),(i).begin()+k #define _range3(i,a,b) (i).begin()+a,(i).begin()+b #define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__) #define _rrange(i) (i).rbegin(),(i).rend() #define _rrange2(i,k) (i).rbegin(),(i).rbegin()+k #define _rrange3(i,a,b) (i).rbegin()+a,(i).rbegin()+b #define rrange(...) _overload3(__VA_ARGS__,_rrange3,_rrange2,_rrange)(__VA_ARGS__) #define elif else if #define unless(a) if(!(a)) #define mp make_pair #define mt make_tuple #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define vec(type,name,...) vector<type> name(__VA_ARGS__) #define VEC(type,name,size) vector<type> name(size);in(name) #define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__)) #define VV(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__));in(name) #define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__))) inline constexpr ll gcd(ll a,ll b){if(!a||!b)return 0;while(b){ll c=b;b=a%b;a=c;}return a;} inline constexpr ll lcm(ll a,ll b){if(!a||!b)return 0;return a*b/gcd(a,b);} template<class T> inline constexpr T min(vector<T> &v){return *min_element(range(v));} inline char min(string &v){return *min_element(range(v));} template<class T> inline constexpr T max(vector<T> &v){return *max_element(range(v));} inline char max(string &v){return *max_element(range(v));} inline constexpr ll intpow(ll a,ll b){ll ans=1;for(ll i=1;b;i*=2){if(b&i){b^=i;ans*=a;}a*=a;}return ans;} inline constexpr ll modpow(ll a,ll b,ll mod = MOD){ll ans=1;for(ll i=1;b;i*=2){if(b&i){b^=i;ans*=a;ans%=mod;}a*=a;a%=mod;}return ans;} template<typename T> inline constexpr bool chmin(T &mn,const T &cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;} template<typename T> inline constexpr bool chmax(T &mx,const T &cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;} template<class T> unordered_map<T,ll> press(vector<T> &a){ auto b = a; sort(range(b)); b.erase(unique(range(b)), b.end()); unordered_map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; } template<class T> map<T,ll> press_map(vector<T> &a){ auto b = a; sort(range(b)); b.erase(unique(range(b)), b.end()); map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; } inline int scan(){ return getchar(); } inline void scan(int &a){ scanf("%d", &a); } inline void scan(unsigned &a){ scanf("%u", &a); } inline void scan(long &a){ scanf("%ld", &a); } inline void scan(long long &a){ scanf("%lld", &a); } inline void scan(unsigned long long &a){ scanf("%llu", &a); } inline void scan(char &a){ cin >> a; } inline void scan(float &a){ scanf("%f", &a); } inline void scan(double &a){ scanf("%lf", &a); } inline void scan(long double &a){ scanf("%Lf", &a); } inline void scan(vector<bool> &vec){ for(unsigned i = 0; i < vec.size(); i++) { int a; scan(a); vec[i] = a; } } inline void scan(string &a){ cin >> a; } template<class T> inline void scan(vector<T> &vec); template<class T, size_t size> inline void scan(array<T, size> &vec); template<class T, class L> inline void scan(pair<T, L> &p); template<class T, size_t size> inline void scan(T (&vec)[size]); template<class T> inline void scan(vector<T> &vec){ for(auto &i : vec) scan(i); } template<class T, size_t size> inline void scan(array<T, size> &vec){ for(auto &i : vec) scan(i); } template<class T, class L> inline void scan(pair<T, L> &p){ scan(p.first); scan(p.second); } template<class T, size_t size> inline void scan(T (&vec)[size]){ for(auto &i : vec) scan(i); } template<class T> inline void scan(T &a){ cin>>a; } inline void in(){} template <class Head, class... Tail> inline void in(Head &head, Tail&... tail){ scan(head); in(tail...); } inline void print(){ putchar(' '); } inline void print(const bool &a){ printf("%d", a); } inline void print(const int &a){ printf("%d", a); } inline void print(const unsigned &a){ printf("%u", a); } inline void print(const long &a){ printf("%ld", a); } inline void print(const long long &a){ printf("%lld", a); } inline void print(const unsigned long long &a){ printf("%llu", a); } inline void print(const char &a){ printf("%c", a); } inline void print(const char a[]){ printf("%s", a); } inline void print(const float &a){ printf("%.10f", a); } inline void print(const double &a){ printf("%.10f", a); } inline void print(const long double &a){ printf("%.10Lf", a); } template<class T> void print(const vector<T> &vec); template<class T, size_t size> void print(const array<T, size> &vec); template<class T, class L> void print(const pair<T, L> &p); template<class T, size_t size> inline void print(const T (&vec)[size]); template<class T> void print(const vector<T> &vec){ if(vec.empty()) return; print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){ putchar(' '); print(*i); } } template<class T, size_t size> void print(const array<T, size> &vec){ print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){ putchar(' '); print(*i); } } template<class T, class L> void print(const pair<T, L> &p){ print(p.first); putchar(' '); print(p.second); } template<class T, size_t size> inline void print(const T (&vec)[size]){ print(vec[0]); for(auto i = vec; ++i != end(vec); ){ putchar(' '); print(*i); } } template<class T> inline void print(const T &a){ cout << a; } inline int out(){ putchar('\n'); return 0; } template<class T> inline int out(const T &t){ print(t); putchar('\n'); return 0; } template<class Head, class... Tail> inline int out(const Head &head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } template <class T> inline void err(T t){cerr<<t<<'\n';} inline void err(){cerr<<'\n';} inline int first(const bool &i){return out(i?"first":"second");} inline int yes(const bool &i){return out(i?"yes":"no");} inline int Yes(const bool &i){return out(i?"Yes":"No");} inline int YES(const bool &i){return out(i?"YES":"NO");} inline int Yay(const bool &i){return out(i?"Yay!":":(");} inline int Possible(const bool &i){return out(i?"Possible":"Impossible");} inline int POSSIBLE(const bool &i){return out(i?"POSSIBLE":"IMPOSSIBLE");} inline void Case(ll i){printf("Case #%lld: ",i);} const int bases[64] = {257,262,266,275,276,281,285,290,296,302,306,310,311,313,323,333,344,345,350,357,367,370,373,402,423,425,431,440,442,443,454,457,458,462,471,478,481,487,489,492,499,501,502,503,506,514,524,532,535,541,550,552,557,559,562,563,567,570,571,580,592,597,604,612}; const ull mod = 0x1fffffffffffffff, base = bases[chrono::duration_cast<chrono::microseconds>(chrono::system_clock::now().time_since_epoch()).count() & 63]; struct RollingHash { vector<ull> hashed, power; static constexpr ull mask(int a) { return (1ull << a) - 1; } inline ull mul(ull a, ull b) const { //* __uint128_t ans = __uint128_t(a) * b; /*/ // without __uint128_t ull a31 = a >> 31, b31 = b >> 31; a &= mask(31); b &= mask(31); ull x = a * b31 + b * a31; ull ans = (a31 * b31 << 1) + (x >> 30) + ((x & mask(30)) << 31) + a * b; //*/ ans = (ans >> 61) + (ans & mask(61)); if(ans >= mod) ans -= mod; return ans; } RollingHash(const string &s) { ll n = s.size(); hashed.assign(n + 1, 0); power.assign(n + 1, 0); power[0] = 1; rep(n) { power[i + 1] = mul(power[i], base); hashed[i + 1] = mul(hashed[i], base) + s[i]; if(hashed[i + 1] >= mod) hashed[i + 1] -= mod; } } ull get(ll l, ll r) const { ull ret = hashed[r] + mod - mul(hashed[l], power[r - l]); if(ret >= mod) ret -= mod; return ret; } ull connect(ull h1, ll h2, ll h2len) const { ull ret = mul(h1, power[h2len]) + h2; if(ret >= mod) ret -= mod; return ret; } void connect(const string &s){ ll n = hashed.size() - 1, m = s.size(); hashed.resize(n + m + 1); power.resize(n + m + 1); rep(i, n, n + m) { power[i + 1] = mul(power[i], base); hashed[i + 1] = mul(hashed[i], base) + s[i - n]; if(hashed[i + 1] >= mod) hashed[i + 1] -= mod; } } ll LCP(const RollingHash &b, ll l1, ll r1, ll l2, ll r2) { ll len = min(r1 - l1, r2 - l2); ll low = -1, high = len + 1; while(high - low > 1) { ll mid = (low + high) / 2; if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid; else high = mid; } return low; } }; signed main(){ STR(s); RollingHash rh(s); LL(m); ll ans=0; rep(m){ STR(t); RollingHash rh2(t); rep(i,t.size(),s.size()+1)ans+=rh.get(i-t.size(),i)==rh2.get(0,t.size()); } out(ans); }