結果

問題 No.430 文字列検索
ユーザー torus711torus711
提出日時 2016-10-02 22:56:39
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 297 ms / 2,000 ms
コード長 3,581 bytes
コンパイル時間 978 ms
コンパイル使用メモリ 113,952 KB
実行使用メモリ 26,236 KB
最終ジャッジ日時 2023-08-15 17:22:47
合計ジャッジ時間 2,866 ms
ジャッジサーバーID
(参考情報)
judge15 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 297 ms
26,236 KB
testcase_02 AC 29 ms
4,376 KB
testcase_03 AC 31 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 261 ms
25,728 KB
testcase_09 AC 3 ms
4,376 KB
testcase_10 AC 13 ms
5,812 KB
testcase_11 AC 81 ms
7,312 KB
testcase_12 AC 78 ms
7,492 KB
testcase_13 AC 81 ms
7,756 KB
testcase_14 AC 64 ms
5,640 KB
testcase_15 AC 55 ms
4,916 KB
testcase_16 AC 32 ms
4,380 KB
testcase_17 AC 31 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using SS = stringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end()

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

void rollingHash( const string &S, const int l, map< ULL, int > &results, const int param = 0 )
{
// 	using ULL = unsigned long long;

	const ULL B = vector<ULL>( { 1000000007, 999999937, 100000007 } )[ param ];

	const int len_s = S.size();

	ULL t = 1;
	for ( int i = 0; i < l; ++i )
	{
		t *= B;
	}

	ULL hash_s = 0;
	for ( int i = 0; i < l; ++i )
	{
		hash_s = hash_s * B + S[i];
	}
	++results[ hash_s ];

	for ( int i = 0; i + l < len_s; ++i )
	{
		hash_s = hash_s * B + S[ i + l ] - S[i] * t;
		++results[ hash_s ];
	}

	return;
}

ULL h( const string &S )
{
	const ULL B = vector<ULL>( { 1000000007, 999999937, 100000007 } )[ 1 ];

	const int l = SZ( S );

	ULL t = 1;
	for ( int i = 0; i < l; ++i )
	{
		t *= B;
	}

	ULL hash_s = 0;
	for ( int i = 0; i < l; ++i )
	{
		hash_s = hash_s * B + S[i];
	}

	return hash_s;
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;
	
	string S;
	cin >> S;

	int M;
	cin >> M;

	VS C( M );
	cin >> C;

	map< ULL, int > counts;
	REP( i, 1, 11 )
	{
		rollingHash( S, i, counts, 1 );
	}

	LL res = 0;
	FOR( s, C )
	{
		res += counts[ h( s ) ];
		DUMP( counts[ h( s ) ] );
	}
	cout << res << endl;

	return 0;
}
0