| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 74551 | ZZangZZang | Lozinke (COCI17_lozinke) | C++17 | 682 ms | 17172 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 <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>
#include <functional>
#include <string>
#include <set>
#include <map>
 
typedef long long ll;
using namespace std;
 
ll n, sol = 0;
string s[20001];
map<string, ll> ms;
 
int main()
{
	scanf("%lld", &n);
	for(ll i=0; i<n; i++)
	{
		char str[20]; scanf("%s", str);
		s[i] = string(str);
        if(ms.find(s[i]) == ms.end()) ms.insert(make_pair(s[i], 1));
        else ms[s[i]]++;
	}
	for(ll k=0; k<n; k++)
	{
		set<string> l;
		vector<string> v;
		for(ll i=0; i<s[k].size(); i++)
		{
			string tmp;
			for(ll j=i; j<s[k].size(); j++)
			{
				tmp += s[k][j];
				if(l.find(tmp) == l.end()) l.insert(tmp), v.push_back(tmp);
			}
		}
		for(ll i=0; i<v.size(); i++)
		{
			if(v[i] == s[k]) sol += (ll)(ms[v[i]] - 1);
			else sol += (ll)(ms[v[i]]);
		}
	}
	printf("%lld", sol);
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
