# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472770 | BidoTeima | Lozinke (COCI17_lozinke) | C++17 | 510 ms | 16380 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.
/// isA AC
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void ACPLS(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
#define tc int tttttt;cin>>tttttt;while(tttttt--)
#define sumrange(l,r,arr) (l==0?arr[r]:arr[r]-arr[l-1])
int main(){
ACPLS();
int n;
cin>>n;
map<string,int>freq{};
string arr[n];
for(int i = 0; i < n; i++){
cin>>arr[i];
string s = arr[i];
map<string,bool>vis{};
for(int j = 0; j < (int)s.size(); j++){
string sub;
for(int k = j; k < (int)s.size(); k++){
sub+=s[k];
if(vis[sub])continue;
vis[sub]=1;
++freq[sub];
}
}
}
int ans=0;
for(int i = 0; i < n; i++){
ans+=freq[arr[i]]-1;
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |