| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 732949 | vjudge1 | Trener (COCI20_trener) | C++17 | 80 ms | 844 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 MOD 1000000007
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
const int p2=29;
int p[1505];
int add(int x,int y){
return ((x+y)%MOD+MOD)%MOD;
}
int mul(int x,int y){
return (x*y)%MOD;
}
int fp(int a,int b){
if(b==0)return 1;
int t=fp(a,b/2);
t=(t*t)%MOD;
if(b%2)return (t*a)%MOD;
return t;
}
int32_t main(){
srand(time(NULL));
fast;
p[0]=1;
for(int i=1;i<=1500;i++)p[i]=mul(p[i-1],p2);
int n,m;
cin>>n>>m;
map<int,int>mp;
for(int i=0;i<n;i++){
map<int,int>mp2;
for(int j=0;j<m;j++){
string s;
cin>>s;
int a=0;
for(int k=0;k<s.size()-1;k++){
a=add(a,mul(s[k]-'a'+1,p[k]));
}
int b;
if(i!=0)b=add(mul(s.back()-'a'+1,p[i-1]),mul(fp(p2,MOD-2),add(a,-(s[0]-'a'+1))));
int c=add(a,mul(s.back()-'a'+1,p[i]));
if(i==0){
mp2[c]++;
mp2[c]%=MOD;
continue;
}
mp2[c]=add(mp2[c],add(mp[a],mp[b]));
if(a==b){
mp2[c]=add(mp2[c],-mp[a]);
}
}
mp.clear();
mp=mp2;
}
int ans=0;
for(auto i:mp)ans=add(ans,i.ss);
cout<<ans<<endl;
}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... | ||||
