| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 98907 |
2019-02-27T10:56:31 Z |
cfalas |
Lozinke (COCI17_lozinke) |
C++14 |
|
1000 ms |
56612 KB |
/*
COCI 17-lozinke
Idea: Hash each password
Create a new string consisting of all passwords, joined by { (ie pass1{pass2)
Make a sliding window for every size of string from 1 to 10
Calculate hash of sliding window. If it matches any of the hashes from the passwords, add the connection to a set that have all connections, in order to avoid duplicates (ie pass1=aaa, pass2=aa, aa fits in aaa 2 times)
Count answer
Subtract n from the answer, since each password matches itself
Status 70%
TLE in 4/20 testcases
WA in 2/20 testcases
______ _ _____
| ____/\ | | /\ / ____|
| |__ / \ | | / \ | (___
| __/ /\ \ | | / /\ \ \___ \
| | / ____ \| |____ / ____ \ ____) |
|_|/_/ \_\______/_/ \_\_____/
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000
#define MOD 1000000007
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef pair<ii, ll> iii;
typedef vector<ii> vii;
#define F first
#define S second
#define mp make_pair
#define endl '\n'
#define priority_queue pq
ll modpow(ll x, ll y){
if(y==0)
return 1;
if(y==1)
return x%MOD;
ll z = modpow(x, y/2);
z = (z*z)%MOD;
if(y%2==1)
z = z*x;
return z%MOD;
}
int main(){
ll n;
cin>>n;
string a[n];
string b = "";
for(ll i=0;i<n;i++){
cin>>a[i];
b+=a[i];
b+="{";
}
map<ll, ll> hashes;
vector<set<ll> > ans;
ans.assign(n+1, set<ll>());
for(ll i=0;i<n;i++){
ll hash = 0;
for(ll j=0;j<a[i].size();j++)
hash = (hash*29) % MOD + (a[i][j] - 'a'+1);
//cout<<hash<<endl;
hashes[hash] ++;
}
for(ll siz=1;siz<=10;siz++){
//cout<<siz<<": -------------\n";
ll strcnt = 0;
ll cnt=0;
ll currhash = 0;
while(cnt<siz){
currhash = currhash * 29 + (b[cnt] - 'a' + 1);
currhash = currhash%MOD;
if(b[cnt]=='{')
strcnt++;
cnt++;
}
for(ll i=cnt;i<b.size();i++){
//cout<<strcnt<<" "<<currhash<<endl;
if(hashes[currhash]){
ans[strcnt].insert(currhash);
}
currhash -= modpow(29, siz - 1)*(b[i-siz] - 'a' + 1);
if(currhash<0){
currhash += ((-currhash) / MOD + 1)*MOD;
}
currhash*=29;
currhash%=MOD;
currhash += (b[i] - 'a' + 1);
if(b[i]=='{')
strcnt++;
}
if(hashes[currhash]){
ans[strcnt].insert(currhash);
}
}
ll anss=0;
for(ll i=0;i<=n;i++){
for(set<ll>::iterator it=ans[i].begin();it!=ans[i].end();it++){
anss += hashes[(*it)];
}
}
cout<<anss-n<<endl;
}
Compilation message
lozinke.cpp: In function 'int main()':
lozinke.cpp:74:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(ll j=0;j<a[i].size();j++)
~^~~~~~~~~~~~
lozinke.cpp:91:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(ll i=cnt;i<b.size();i++){
~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
3 ms |
384 KB |
Output is correct |
| 3 |
Correct |
4 ms |
640 KB |
Output is correct |
| 4 |
Correct |
10 ms |
1280 KB |
Output is correct |
| 5 |
Correct |
27 ms |
3192 KB |
Output is correct |
| 6 |
Correct |
40 ms |
3576 KB |
Output is correct |
| 7 |
Correct |
79 ms |
6360 KB |
Output is correct |
| 8 |
Correct |
101 ms |
7468 KB |
Output is correct |
| 9 |
Correct |
415 ms |
23316 KB |
Output is correct |
| 10 |
Incorrect |
758 ms |
31556 KB |
Output isn't correct |
| 11 |
Incorrect |
835 ms |
37976 KB |
Output isn't correct |
| 12 |
Execution timed out |
1086 ms |
46156 KB |
Time limit exceeded |
| 13 |
Correct |
686 ms |
21872 KB |
Output is correct |
| 14 |
Execution timed out |
1051 ms |
56612 KB |
Time limit exceeded |
| 15 |
Execution timed out |
1031 ms |
48796 KB |
Time limit exceeded |
| 16 |
Correct |
212 ms |
4616 KB |
Output is correct |
| 17 |
Correct |
73 ms |
3080 KB |
Output is correct |
| 18 |
Correct |
75 ms |
4900 KB |
Output is correct |
| 19 |
Execution timed out |
1068 ms |
50612 KB |
Time limit exceeded |
| 20 |
Correct |
249 ms |
15880 KB |
Output is correct |
