# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
570521 | 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=1e9+7;
int hashh[505][505],cnt[][27];
string s[N];
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=31;
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));
}
}
main()
{
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>s[i];
for(int i=0;i<n;i++){
for(int j=i;j<i+m;j++){
for(int k=0;k<n;k++){
cnt[i][s[k][j]-'a']++;
}
}
}
for(int i=0;i<n;i++){
compute_hash(s[i],i);
}
for(int i=0;i<n;i++){
int ok=0;
for(int j=0;j<26;j++){
ok+=(cnt[i][j]/2);
}
if(ok<m)
continue;
for(int j=0;j<n;j++){
for(int k=j+1;j<n;k++){
if(hashh[j][i-1]==hashh[k][i-1]&&hashh[j][n-1]-hashh[j][i+m-1]==hashh[j][n-1]-hashh[j][i+m-1]){
cout<<"DA"<<endl;
exit(0);
}
}
}
}
cout<<"NE"<<endl;
return 0;
}
/*
4 2
abcd
acbd
unee
asds
*/