結果
| 問題 |
No.430 文字列検索
|
| コンテスト | |
| ユーザー |
 hotman78
|
| 提出日時 | 2019-12-28 16:01:54 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 9 ms / 2,000 ms |
| コード長 | 7,531 bytes |
| コンパイル時間 | 3,554 ms |
| コンパイル使用メモリ | 215,592 KB |
| 実行使用メモリ | 8,576 KB |
| 最終ジャッジ日時 | 2024-11-10 00:39:49 |
| 合計ジャッジ時間 | 4,241 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 14 |
コンパイルメッセージ
main.cpp:93:19: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
93 | inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
| ^~~~
main.cpp:93:33: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
93 | inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
| ^~~~
main.cpp:94:19: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
94 | inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
| ^~~~
main.cpp:94:33: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
94 | inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
| ^~~~
ソースコード
#pragma GCC optimize("Ofast","unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
using namespace std::chrono;
using namespace::std;
//struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
__attribute__((constructor))
void init(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(15);
}
// random_device rd;
// mt19937 mt(rd());
// #include <boost/numeric/interval.hpp>
// #include <boost/numeric/interval/io.hpp>
// #include <boost/intrusive/rbtree.hpp>
// #include <boost/dynamic_bitset.hpp>
// #include <boost/geometry.hpp>
// #include <boost/geometry/geometries/linestring.hpp>
// #include <boost/geometry/geometries/polygon.hpp>
// #include <boost/geometry/geometries/point_xy.hpp>
// #include <boost/math/tools/minima.hpp>
// using boost::math::tools::brent_find_minima;
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
// #include <boost/unordered_map.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
template<typename T=long long>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T=long long>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T=long long>using pqueue =__gnu_pbds::priority_queue<T, less<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector<double>>> dmat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
typedef vector<vector<vector<string>>> smat3;
template<typename T>using Vec=vector<T>;
template<typename T>using Mat=vector<vector<T>>;
template<typename T>using Mat3=vector<vector<vector<T>>>;
template<typename T>using Mat4=vector<vector<vector<vector<T>>>>;
template<typename S,typename T>using pvec=vector<pair<S,T>>;
template<typename S,typename T>using pmat=vector<vector<pair<S,T>>>;
template<typename S,typename T>using pmat3=vector<vector<vector<pair<S,T>>>>;
template<typename S,typename T>using pmat4=vector<vector<vector<vector<pair<S,T>>>>>;
template<typename... T>using tvec=vector<tuple<T...>>;
template<typename... T>using tmat=vector<vector<tuple<T...>>>;
template<typename... T>using tmat3=vector<vector<vector<tuple<T...>>>>;
template<typename... T>using tmat4=vector<vector<vector<vector<tuple<T...>>>>>;
#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)
#define irep(i) for(lint i = 0;; i++)
#define irepi(i,n) for(lint i = (n);; i++)
#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)
#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)
#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)
#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)
#define all(x) (x).begin(),(x).end()
#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))
//#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];
#define SUM(v) accumulate(all(v),0LL)
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define LINF 9223372036854775807LL
#define MOD 998244353LL
//#define MOD 1000000007LL
#define endl "\n"
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(int i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(int i=0;i<t.size();i++)output(t[i]);}
auto call=[](auto f,auto... args){return f(f,args...);};
template<typename T=lint>T in(){return *istream_iterator<T>(cin);}
template<typename T=lint>inline T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T=lint>inline T lcm(T a,T b){return a/gcd(a,b)*b;}
template<typename T>inline T minq(T a,T b){return min(a,b);}
template<typename T>inline T maxq(T a,T b){return max(a,b);}
inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={-1,1,0,0,1,1,-1,-1};
const vector<lint> dy={0,0,-1,1,1,-1,1,-1};
class AhoCorasick{
struct node;
using np=node*;
constexpr static int num=26;
constexpr static char base='A';
struct node{
np ch[num];
np link=nullptr;
int val=0;
node(){
rep(i,num)ch[i]=nullptr;
}
};
np root=new node();
np root_par=new node();
public:
AhoCorasick(){
root->link=root_par;
rep(i,num)root_par->ch[i]=root;
}
void insert(string v){
np t=root;
int idx=0;
while(idx<(lint)v.size()){
if(!t->ch[v[idx]-base])t->ch[v[idx]-base]=new node();
t=t->ch[v[idx]-base];
idx++;
}
t->val++;
}
void build(){
built=1;
queue<np>que;
que.push(root);
while(!que.empty()){
np t=que.front();
que.pop();
rep(i,num){
if(!t->ch[i])continue;
if(t==root){
t->ch[i]->link=t;
}else{
np s=t->link;
while(!s->ch[i]){
s=s->link;
}
t->ch[i]->link=s->ch[i];
}
que.push(t->ch[i]);
}
}
}
bool built=0;
int count(string v){
if(!built){build();built=1;}
np t=root;
int idx=0;
int res=0;
while(idx<(int)v.size()){
while(!t->ch[v[idx]-base]){
if(t==root){
idx++;
if(idx==(int)v.size())return res;
}else{
t=t->link;
}
}
t=t->ch[v[idx++]-base];
auto s=t;
while(s!=root){
res+=s->val;
s=s->link;
}
}
return res;
}
int find_first(string v){
if(!built){build();built=1;}
np t=root;
int idx=0;
int res=0;
while(idx<(lint)v.size()){
while(!t->ch[v[idx]-base]){
if(t==root){
res++;
idx++;
if(idx==(lint)v.size())return -1;
}else{
res++;
t=t->link;
}
}
t=t->ch[v[idx++]-base];
if(t->val>0)return res;
}
return -1;
}
};
int main(){
string s;
cin>>s;
lint q;
cin>>q;
AhoCorasick aho;
rep(i,q){
string t;
cin>>t;
aho.insert(t);
}
cout<<aho.count(s)<<endl;
}