# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
554686 | 2022-04-29T07:38:21 Z | new_acc | Lozinke (COCI17_lozinke) | C++14 | 123 ms | 41316 KB |
#include<bits/stdc++.h> #define fi first #define se second #define pitem item* using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef vector<ll> vl; const int N=1e6+10; const int SS=1<<19; const int INFi=2e9; const ll INFl=1e13; const ll mod2=998244353; const ll mod=1e9+7; const ll mod3=1000696969; const ll p=70032301; const ull p2=913; const int L=20; int t[N]; string s[N]; unordered_map<ll,int> m; unordered_map<ll,bool> m2; void solve(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>s[i]; ll akth=0; for(int j=0;j<s[i].size();j++) akth=(akth*p+s[i][j])%mod; m[akth]++; } ll res=0; for(int i=1;i<=n;i++){ for(int j=0;j<s[i].size();j++){ ll akth=0; for(int k=j;k<s[i].size();k++){ akth=(akth*p+s[i][k])%mod; if(m2[akth]) continue; res+=m[akth]; m2[akth]=1; } } m2.clear(); res--; } cout<<res<<"\n"; } int main(){ ios_base::sync_with_stdio(0),cin.tie(0); solve(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 15 ms | 31624 KB | Output is correct |
2 | Correct | 15 ms | 31640 KB | Output is correct |
3 | Correct | 16 ms | 31648 KB | Output is correct |
4 | Correct | 16 ms | 31672 KB | Output is correct |
5 | Correct | 20 ms | 31828 KB | Output is correct |
6 | Correct | 19 ms | 31788 KB | Output is correct |
7 | Correct | 20 ms | 32216 KB | Output is correct |
8 | Correct | 24 ms | 32712 KB | Output is correct |
9 | Correct | 37 ms | 32768 KB | Output is correct |
10 | Correct | 58 ms | 36392 KB | Output is correct |
11 | Correct | 51 ms | 33956 KB | Output is correct |
12 | Incorrect | 123 ms | 41176 KB | Output isn't correct |
13 | Correct | 73 ms | 32916 KB | Output is correct |
14 | Incorrect | 94 ms | 41280 KB | Output isn't correct |
15 | Incorrect | 118 ms | 41316 KB | Output isn't correct |
16 | Correct | 75 ms | 31916 KB | Output is correct |
17 | Correct | 43 ms | 31828 KB | Output is correct |
18 | Correct | 36 ms | 31796 KB | Output is correct |
19 | Correct | 77 ms | 36472 KB | Output is correct |
20 | Correct | 50 ms | 31828 KB | Output is correct |