# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315208 | Kesatria_Komodo | Lozinke (COCI17_lozinke) | C++17 | 312 ms | 15548 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>
using namespace std;
int main(){
int N , ans = 0;
unordered_map<string , int> mp;
cin >> N;
string arr[N];
for (int i = 0 ; i < N ; i++)
cin >> arr[i] , ++mp[arr[i]];
for (int i = 0 ; i < N ; i++){
unordered_map<string , bool> computed;
for (int k = 0 ; k < arr[i].size() ; k++){
string now = "";
for (int l = k ; l < arr[i].size() ; l++){
now.push_back(arr[i][l]);
bool &it = computed[now];
if (it)
continue;
it = 1 , ans += mp[now];
}
}
}
cout << ans - N << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |