# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
116806 | 2019-06-14T01:21:39 Z | HungAnhGoldIBO2020 | Lozinke (COCI17_lozinke) | C++11 | 752 ms | 3932 KB |
#include<iostream> #include<set> #define hash hash1 #define int long long using namespace std; const int N=2e4+2; const int base=79; const int mod=1e9+7; string s[N]; long long hash1[N][12],mul[12]; multiset<int> lis[12],lis1[12]; signed main(){ int n,i,j,k,l; long long ans=0,cac; cin>>n; string t; mul[0]=1; for(i=1;i<=10;i++){ mul[i]=(mul[i-1]*base)%mod; } for(i=1;i<=n;i++){ cin>>s[i]; t=s[i]; for(j=0;j<t.size();j++){ hash1[i][j+1]=(hash[i][j]*base+(int)(t[j]-'a'+1)); } lis[t.size()].insert(hash[i][t.size()]); } for(i=1;i<=n;i++){ for(j=1;j<=s[i].size();j++){ for(k=j;k<=s[i].size();k++){ if(j==1&&k==s[i].size()){ ans--; } cac=((hash[i][k]-hash[i][j-1]*mul[k-j+1])%mod+mod)%mod; if(!lis1[k-j+1].count(cac)){ lis1[k-j+1].insert(cac); } else{ continue; } ans+=lis[k-j+1].count(cac); } } for(j=1;j<=10;j++){ lis1[j].clear(); } } cout<<ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 1016 KB | Output isn't correct |
2 | Correct | 3 ms | 896 KB | Output is correct |
3 | Incorrect | 3 ms | 1024 KB | Output isn't correct |
4 | Correct | 3 ms | 1024 KB | Output is correct |
5 | Incorrect | 6 ms | 1024 KB | Output isn't correct |
6 | Incorrect | 8 ms | 1152 KB | Output isn't correct |
7 | Incorrect | 11 ms | 1280 KB | Output isn't correct |
8 | Incorrect | 9 ms | 1280 KB | Output isn't correct |
9 | Incorrect | 172 ms | 2432 KB | Output isn't correct |
10 | Incorrect | 36 ms | 2304 KB | Output isn't correct |
11 | Incorrect | 349 ms | 3196 KB | Output isn't correct |
12 | Incorrect | 53 ms | 3072 KB | Output isn't correct |
13 | Incorrect | 61 ms | 3840 KB | Output isn't correct |
14 | Incorrect | 218 ms | 3840 KB | Output isn't correct |
15 | Incorrect | 74 ms | 3840 KB | Output isn't correct |
16 | Incorrect | 66 ms | 3840 KB | Output isn't correct |
17 | Incorrect | 37 ms | 3832 KB | Output isn't correct |
18 | Incorrect | 30 ms | 3840 KB | Output isn't correct |
19 | Incorrect | 98 ms | 3932 KB | Output isn't correct |
20 | Incorrect | 752 ms | 3932 KB | Output isn't correct |