#include <bits/stdc++.h>
using namespace std;
#define int int64_t //be careful about this
#define pr pair
#define ar array
#define f first
#define s second
#define vt vector
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define SZ(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem(a,b) memset(a, b, sizeof(a))
template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x;}
template<class H, class... T> void rd(H& h, T&... t) { rd(h); rd(t...);}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a);}
template<class T> bool ckmin(T& a, const T b) { return b < a ? a = b, 1 : 0;}
template<class T> bool ckmax(T& a, const T b) { return a < b ? a = b, 1 : 0;}
template<typename T>
void __p(T a) {
cout<<a;
}
template<typename T, typename F>
void __p(pair<T, F> a) {
cout<<"{";
__p(a.first);
cout<<",";
__p(a.second);
cout<<"}\n";
}
template<typename T>
void __p(std::vector<T> a) {
cout<<"{";
for(auto it=a.begin(); it<a.end(); it++)
__p(*it),cout<<",}\n"[it+1==a.end()];
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
__p(a1);
__p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cout<<name<<" : ";
__p(arg1);
cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
int bracket=0,i=0;
for(;; i++)
if(names[i]==','&&bracket==0)
break;
else if(names[i]=='(')
bracket++;
else if(names[i]==')')
bracket--;
const char *comma=names+i;
cout.write(names,comma-names)<<" : ";
__p(arg1);
cout<<" | ";
__f(comma+1,args...);
}
#define trace(...) cout<<"Line:"<<__LINE__<<" ", __f(#__VA_ARGS__, __VA_ARGS__)
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0);
cout.precision(20); cout << fixed;
if(SZ(s)){
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
}
/*/--------------------------------------------------look below-----------------------------------------------------------------------------------/*/
signed main(){
setIO();
int n;
rd(n);
vt<string> s(n);
rd(s);
map<string,int> mp;
for(auto str : s){
set<string> st;
for(int len = 1; len <= SZ(str); ++len)
for(int i = 0; i + len <= SZ(str); ++i)
st.insert(str.substr(i,len));
for(auto s_ : st)
++mp[s_];
}
int ans = -n;
for(auto str : s)
ans += mp[str];
cout << ans;
return 0;
}
// tips to avoid bugs.
/*
* be careful of whats happening you dont want a continue statement to miss imp line of code.
* be careful when to update what since it might be needed in next segment of code.
* dont get stuck on one idea.
* dont use too much space bar so that code is written quickly as possible.
*/
Compilation message
lozinke.cpp: In function 'void setIO(std::string)':
lozinke.cpp:81:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
81 | freopen((s+".in").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
lozinke.cpp:82:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
82 | freopen((s+".out").c_str(),"w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
2 ms |
332 KB |
Output is correct |
| 5 |
Correct |
7 ms |
700 KB |
Output is correct |
| 6 |
Correct |
12 ms |
716 KB |
Output is correct |
| 7 |
Correct |
18 ms |
1344 KB |
Output is correct |
| 8 |
Correct |
28 ms |
2228 KB |
Output is correct |
| 9 |
Correct |
68 ms |
2300 KB |
Output is correct |
| 10 |
Correct |
157 ms |
7344 KB |
Output is correct |
| 11 |
Correct |
112 ms |
4132 KB |
Output is correct |
| 12 |
Correct |
321 ms |
16436 KB |
Output is correct |
| 13 |
Correct |
192 ms |
2664 KB |
Output is correct |
| 14 |
Correct |
239 ms |
14812 KB |
Output is correct |
| 15 |
Correct |
401 ms |
16356 KB |
Output is correct |
| 16 |
Correct |
208 ms |
1028 KB |
Output is correct |
| 17 |
Correct |
56 ms |
844 KB |
Output is correct |
| 18 |
Correct |
40 ms |
844 KB |
Output is correct |
| 19 |
Correct |
242 ms |
8556 KB |
Output is correct |
| 20 |
Correct |
103 ms |
1044 KB |
Output is correct |
