# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223285 | jamielim | Trener (COCI20_trener) | C++14 | 7 ms | 2432 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=1000000007;
string str[20][1505];
map<string,ll> dp;
int main(){
int n,k;
scanf("%d%d",&n,&k);
char temp[55];
for(int i=0;i<n;i++){
for(int j=0;j<=n;j++)str[i][j]='\0';
for(int j=0;j<k;j++){
scanf("%s",temp);
str[i][j]=temp;
}
sort(str[i],str[i]+k);
}
for(int i=0;i<k;i++){
dp[str[0][i]]++;
}
for(int i=1;i<n;i++){
for(int j=0;j<k;j++){
string a,b;
for(int l=0;l<i;l++){
a+=str[i][j][l];
b+=str[i][j][l+1];
}
dp[str[i][j]]+=dp[a];
if(a!=b)dp[str[i][j]]+=dp[b];
dp[str[i][j]]%=MOD;
}
}
long long ans=0;
for(int i=0;i<k;i++){ans+=dp[str[n-1][i]];ans%=MOD;}
printf("%lld",ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |