# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116825 | Licht | Lozinke (COCI17_lozinke) | C++14 | 480 ms | 16608 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;
#define int long long
#define vt vector
#define pb push_back
#define pob pop_back
#define vi vt<int>
#define vvi vt<vi>
#define vii vt<ii>
#define vvii vt<vii>
typedef long long ll;
#define For(i,a,b) for(int i = a; i < b; i++)
#define foR(i,a,b) for(int i = a; i <= b; i++)
#define roF(i,a,b) for(int i = a - 1; i >= b; i--)
#define Rof(i,a,b) for(int i = a; i >= b; i--)
vector<string> v;
map<string,int> dx;
map<string,bool> dc;
bool cmp(string a, string b){
return a.size() < b.size();
}
signed main (){
/*
freopen(".inp","r",stdin);
freopen(".out","w",stdout);
*/
int n, coun = 0; cin >> n;
string t;
For(i,0,n){
cin >> t;
v.pb(t);
}
sort(v.begin(),v.end(),cmp);
For(i,0,n){
// cout << v[i] << "\n";
dc.clear();
//nc
For(j,0,v[i].size()){
string temp;
For(k,j,v[i].size()){
temp += v[i][k];
if((!dc[temp]) && dx[temp]){
dc[temp] = true;
coun+=dx[temp];
}
}
}
coun+=dx[v[i]];
dx[v[i]]++;
// cout << coun << "\n";
}
cout << coun;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |