結果
問題 | No.430 文字列検索 |
ユーザー | is_eri23 |
提出日時 | 2016-10-08 16:30:27 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 367 ms / 2,000 ms |
コード長 | 3,100 bytes |
コンパイル時間 | 1,429 ms |
コンパイル使用メモリ | 166,980 KB |
実行使用メモリ | 383,400 KB |
最終ジャッジ日時 | 2024-11-10 00:10:09 |
合計ジャッジ時間 | 3,244 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 367 ms
383,400 KB |
testcase_02 | AC | 4 ms
5,248 KB |
testcase_03 | AC | 4 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 1 ms
5,248 KB |
testcase_08 | AC | 348 ms
383,188 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 36 ms
41,340 KB |
testcase_11 | AC | 82 ms
67,368 KB |
testcase_12 | AC | 81 ms
67,348 KB |
testcase_13 | AC | 81 ms
67,624 KB |
testcase_14 | AC | 46 ms
40,360 KB |
testcase_15 | AC | 28 ms
25,448 KB |
testcase_16 | AC | 6 ms
5,248 KB |
testcase_17 | AC | 4 ms
5,248 KB |
ソースコード
#include <bits/stdc++.h>#define EPS 1e-9#define INF 1070000000LL#define MOD 1000000007LL#define fir first#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)#define numa(x,a) for(auto x: a)#define ite iterator#define mp make_pair#define rep(i,n) rep2(i,0,n)#define rep2(i,m,n) for(int i=m;i<(n);i++)#define pb push_back#define pf push_front#define sec second#define sz(x) ((int)(x).size())#define ALL( c ) (c).begin(), (c).end()#define gcd(a,b) __gcd(a,b)#define mem(x,n) memset(x,n,sizeof(x))#define endl "\n"using namespace std;template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t);deploy<POS + 1, TUPLE, Ts...>(os, t); }template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e <<(--remain == 0 ? "}" : ", "); return os; }template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain== 0 ? "}" : ", "); return os; }template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }using ll = long long;class Trie {private:vector <vector <int> > nodes;vector <int> cnt;public:Trie(){nodes.emplace_back(vector <int> (256));cnt.emplace_back(0);}void add(const string &&s) {int cur = 0;for (auto &c: s) {int ni = nodes[cur][c];if (ni == 0) {nodes.emplace_back(vector <int> (256));cnt.emplace_back(0);nodes[cur][c] = sz(nodes) - 1;}cur = nodes[cur][c];cnt[cur] += 1;}}int query(const string &&s) {int cur = 0;for (auto &c: s) {int ni = nodes[cur][c];if (ni == 0) {return 0;}cur = nodes[cur][c];}return cnt[cur];}};int main(){cin.tie(0);ios_base::sync_with_stdio(0);static Trie tr;string S;cin >> S;for (int i = 0; i < sz(S) - 10; i++) {tr.add(std::move(S.substr(i,10)));}for (int j = max(0,sz(S)-10); j < sz(S); j++) {tr.add(std::move(S.substr(j)));}int M;cin >> M;ll ans = 0;while(M--) {string S;cin >> S;ans += tr.query(std::move(S));}cout << ans << endl;return 0;}