Submission #656495


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,n) for(i=0;i<n;++i)
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define mp make_pair
#define pb push_back
#define fi first
#define sc second

const long mod=1e9+7;
string x,s,t;
long X,S,T;

long dp[1001];
long rec(int now)
{
	if(dp[now]>=0) return dp[now];

	if(now==X) return 1;

	long ret=0;
	if(now+S<=X && x.substr(now,S)==s)
	{
		ret+=rec(now+S);
		ret%=mod;
	}
	if(now+T<=X && x.substr(now,T)==t)
	{
		ret+=rec(now+T);
		ret%=mod;
	}

	return dp[now]=ret;
}

int main()
{
	cin >>x >>s >>t;
	X=x.size();
	S=s.size();
	T=t.size();
	memset(dp,-1,sizeof(dp));
	std::cout << rec(0) << std::endl;
}

Submission Info

Submission Time
Task F - 太鼓ゲーム
User imulan
Language C++11 (GCC 4.8.1)
Score 100
Code Size 765 Byte
Status AC
Exec Time 34 ms
Memory 1320 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 15
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt
Case Name Status Exec Time Memory
sample_01.txt AC 34 ms 1108 KB
sample_02.txt AC 28 ms 1168 KB
sample_03.txt AC 30 ms 1172 KB
subtask1_01.txt AC 30 ms 1172 KB
subtask1_02.txt AC 30 ms 1296 KB
subtask1_03.txt AC 29 ms 1108 KB
subtask1_04.txt AC 30 ms 1320 KB
subtask1_05.txt AC 30 ms 1184 KB
subtask1_06.txt AC 30 ms 1196 KB
subtask1_07.txt AC 30 ms 1196 KB
subtask1_08.txt AC 30 ms 1172 KB
subtask1_09.txt AC 30 ms 1180 KB
subtask1_10.txt AC 30 ms 1196 KB
subtask1_11.txt AC 30 ms 1204 KB
subtask1_12.txt AC 31 ms 1248 KB
subtask1_13.txt AC 31 ms 1124 KB
subtask1_14.txt AC 30 ms 1188 KB
subtask1_15.txt AC 29 ms 1168 KB