# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50301 | computerbox | Lozinke (COCI17_lozinke) | C++14 | 2 ms | 508 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.
//ID:computerbox --> Hajiyev Huseyn
#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define _CRT_SECURE_NO_WARNINGS
//#include <boost/multiprecision/cpp_int.hpp>
//using boost::multiprecision::cpp_int;
#define FAST_READ ios_base::sync_with_stdio(0);/*cin.tie(0); cout.tie(0);*/
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);
#define ll long long
#define debt(x,y)cout<<"#x = "<<(x)<<" and "<<"#y = "<<(y)<<endl;
#define deb(x)cout<<"#x = "<<(x)<<endl;
#define COUT(n, a) cout<< fixed << setprecision(a) << n<<endl
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define arr(a,n) for(ll i=1;i<=n;i++) cout<<a[i]<<" "; cout << "\n";
#define vecc(a,n) for(ll i=0;i<n;i++) cout<<a[i]<<" "; cout << "\n";
#define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl
#define DTIME(ccc) __begin = clock(); ccc; cerr<<"Time of work = "<<(clock()-__begin)/CLOCKS_PER_SEC<<endl;
#define MAXN 2000100
using namespace std;
set<ll>leaf[2000100];
ll trie[27][MAXN];
ll sz;
void add_string(string stroka,ll index)
{
ll v=0;
for(ll i=0;i<stroka.size();i++)
{
if(trie[stroka[i]-'a'][v]==0)
{
trie[stroka[i]-'a'][v]=sz++;
}
v=trie[stroka[i]-'a'][v];
leaf[v].insert(index);
}
}
ll find(string stroka)
{
ll v=0;
ll ans=0;
for(ll i=0;i<stroka.size();i++)
{
v=trie[stroka[i]-'a'][v];
}
ans=leaf[v].size();
return ans-1;
}
ll n;
vector<string>nuj;
string stroka;
string abc;
int main(){
FAST_READ;
cin.tie(0);
cin>>n;
sz=1;
for(ll i=1;i<=n;i++)
{
cin>>stroka;
string neww="";
for(ll j=0;j<(ll)stroka.size();j++)
{
neww="";
for(ll jj=j;jj<(ll)stroka.size();jj++)
{
neww+=stroka[jj];
//debt(neww,j);
add_string(neww,i);
}
}
nuj.pb(stroka);
}
ll cnt=0;
for(ll i=0;i<nuj.size();i++)
{
ll ans=find(nuj[i]);
//deb(ans);
cnt=cnt+ans;
}
cout<<cnt<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |