# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116820 | souhhcong | Lozinke (COCI17_lozinke) | C++14 | 308 ms | 15580 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 <iostream>
#include <unordered_map>
#include <string>
#include <unordered_set>
using namespace std;
const int N = 2e4+5;
int n, cnt = 0;
string s[N];
unordered_map<string,int> mp;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> s[i];
mp[s[i]]++;
}
// cout << s[0].substr(0,1) << endl;
for (int i = 0; i < n; i++)
{
unordered_set<string> Set;
for (int j = 0; j < s[i].size(); j++)
{
for (int k = j+1; k <= s[i].size(); k++)
{
string tmp = s[i].substr(j,k-j);
Set.insert(tmp);
}
}
for (auto x: Set)
{
cnt += mp[x];
}
}
cout << cnt-n;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |