# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
80271 | luciocf | Lozinke (COCI17_lozinke) | C++14 | 599 ms | 17008 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 <bits/stdc++.h>
using namespace std;
const int maxn = 2e4+10;
string num[maxn];
map<string, int> mapa, mapa2;
int main(void)
{
ios::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> num[i];
mapa2.clear();
for (int ini = 0; ini < num[i].size(); ini++)
{
string aux = "";
for (int fim = ini; fim < num[i].size(); fim++)
{
aux += num[i][fim];
mapa2[aux]++;
if (mapa2[aux] == 1) mapa[aux]++;
}
}
}
long long ans = 0LL;
for (int i = 1; i <= n; i++)
ans += ((long long)mapa[num[i]]-1LL);
cout << ans << "\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |