# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
572219 | AGE | Ispit (COCI19_ispit) | C++14 | 0 ms | 0 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>
#define int long long
#define F first
#define S second
#define pb push_back
using namespace std;
const int N=1e6,M=2e3,mod=1e16+31,ppp=1e9+7;
int hashh[505][505],cnt[505][505][27],ans[505][505];
string s[505];
int mult(int x,int y){
return ((x%mod)*(y%mod))%mod;
}
int minuss(int x,int y){
return ((x%mod)-(y%mod)+mod)%mod;
}
int summ(int x,int y){
return((x%mod)+(y%mod))%mod;
}
void compute_hash(string s,int index){
const int pp=1e9+7;
int p_pow=1;
hashh[index][0]=(s[0]-'a')+1;
for(int i=1;i<s.size();i++){
p_pow=mult(p_pow,pp);
hashh[index][i]=summ(hashh[index][i-1],mult((s[i]-'a')+1,p_pow));
}
}
pair<int,int> compute_hash2(int start,int num,int anss,int intial){
for(int i=0;i<num;i++){
start=mult(start,ppp);
anss=summ(anss,mult(intial,start));
}
return {anss,start};
}
main()
{
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>s[i];
for(int i=0;i<n-m+1;i++){
for(int j=0;j<n;j++){
for(int k=i;k<i+m;k++){
cnt[i][j][s[j][k]-'a']++;
}
}
}
for(int i=0;i<n;i++){
compute_hash(s[i],i);
}
for(int i=0;i<n-m+1;i++){
for(int k=0;k<n;k++){
int anss=0,start=1;
for(int j=0;j<26;j++){
pair<int,int> p;
p=compute_hash2(start,cnt[i][k][j],anss,j+1);
anss=p.F;
start=p.S;
}
ans[i][k]=anss;
}
for(int j=0;j<n;j++){
for(int k=j+1;k<n;k++){
if((i==0||hashh[j][i-1]==hashh[k][i-1])&&((i==n-m)||(i==n-m-1)(hashh[j][n-1]-hashh[j][i+m-1]==hashh[j][n-1]-hashh[j][i+m-1]))&&(ans[i][j]==ans[i][k])){
cout<<"DA"<<endl;
exit(0);
}
}
}
}
cout<<"NE"<<endl;
return 0;
}
/*
4 2
abcd
acbd
unee
asds
*/