# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145036 | Mihnea | Mate (COCI18_mate) | C++14 | 677 ms | 109532 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<iostream>
#include<cstdio>
#include<cstring>
#define MOD 1000000007
using namespace std;
long long I;
long long a[2005][2005],b[2005][30],poz[30][2005],sol[2005][30][30],D[2005][30][30];
char s[2005],X,Y;
int main(){
scanf("%s", (s+1));
int n=strlen((s+1));
a[0][0]=1;
for(int i=1;i<=n;i++){
a[i][0]=a[i][i]=1;
for(int j=1;j<i;j++){
a[i][j]=a[i-1][j-1]+a[i-1][j];
if(a[i][j]>=MOD)
a[i][j]-=MOD;
}
}
for(int i=1;i<=n;i++)
poz[s[i]-'a'][ ++poz[s[i]-'a'][0] ]=i;
for(int i=n;i>=1;i--)
for(int j=0;j<26;j++)
if(s[i]=='a'+j)
b[i][j]=1+b[i+1][j];
else
b[i][j]=b[i+1][j];
for(int i=n;i>=1;i--)
for(int j=0;j<26;j++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |