# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147115 | SeekingOblivion | Mate (COCI18_mate) | C++14 | 2023 ms | 28992 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#include<fstream>
#include<queue>
#include<iostream>
#include<algorithm>
#define mod 1000000007
#define fin cin
#define fout cout
using namespace std;
//ifstream fin("date.in");
//ofstream fout("date.out");
char c[2010],a,b;
int q,i,j,n,l,s,v[2010][2010],d[2010][26],sol[2010][26][26],f[26];
int main()
{
fin>>c;
for(i=0;c[i]!=0;i++);n=i;
for(i=n-1;i>=0;i--)
{
for(j=0;j<='z'-'a';j++) d[i][j]=f[j];
f[c[i]-'a']++;
}
for(i=0;i<=n;i++)
{
v[i][0]=1;
for(j=1;j<=i;j++)
{
v[i][j]=v[i-1][j]+v[i-1][j-1];
if(v[i][j]>=mod) v[i][j]-=mod;
}
}
for(s=2;s<=n;s++)
for(i=s-2;i<n;i++)
for(j=0;j<='z'-'a';j++)
{
sol[s][c[i]-'a'][j]+=(1LL*v[i][s-2]*d[i][j])%mod;
if(sol[s][c[i]-'a'][j]>=mod) sol[s][c[i]-'a'][j]-=mod;
}
fin>>q;
for(i=1;i<=q;i++)
{
fin>>l;
fin>>a>>b;
fout<<sol[l][a-'a'][b-'a']<<"\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |