#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef pair<db,db> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
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; }
int pct(int x) { return __builtin_popcount(x); }
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x))
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0
int fstTrue(function<bool(int)> f, int lo, int hi) {
hi ++; assert(lo <= hi); // assuming f is increasing
while (lo < hi) { // find first index such that f is true
int mid = (lo+hi)/2;
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) {
stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
str res = ""; F0R(i,SZ) res += char('0'+b[i]);
return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
return "("+ts(p.f)+", "+ts(p.s)+")"; }
// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) {
pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) {
pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << ts(h); if (sizeof...(t)) cerr << ", ";
DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
unsyncIO();
// cin.exceptions(cin.failbit);
// throws exception when do smth illegal
// ex. try to read letter into int
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
/**
* Description: Hash map with the same API as unordered\_map, but \tilde 3x faster.
* Initial capacity must be a power of 2 if provided.
* Source: KACTL
* Usage: ht<int,int> h({},{},{},{},{1<<16});
*/
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
struct chash { /// use most bits rather than just the lowest ones
const uint64_t C = ll(2e18*PI)+71; // large odd number
const int RANDOM = rng();
ll operator()(ll x) const {
return __builtin_bswap64((x^RANDOM)*C); }
};
template<class K,class V> using ht = gp_hash_table<K,V,chash>;
template<class K,class V> V get(ht<K,V>& u, K x) {
auto it = u.find(x); return it == end(u) ? 0 : it->s; }
/**
* Description: Polynomial hash for substrings with two bases.
* Source:
* KACTL
* https://codeforces.com/contest/1207/submission/59309672
* Verification:
* USACO Dec 17 Plat 1
* CF Check Transcription
*/
typedef array<int,2> T; // bases not too close to ends
uniform_int_distribution<int> BDIST(0.1*MOD,0.9*MOD);
const T base = {BDIST(rng),BDIST(rng)};
/// const T ibase = {(int)inv(mi(base[0])),(int)inv(mi(base[1]))};
T operator+(T l, T r) {
F0R(i,2) if ((l[i] += r[i]) >= MOD) l[i] -= MOD;
return l; }
T operator-(T l, T r) {
F0R(i,2) if ((l[i] -= r[i]) < 0) l[i] += MOD;
return l; }
T operator*(T l, T r) {
F0R(i,2) l[i] = (ll)l[i]*r[i]%MOD;
return l; }
T makeT(char c) { return {c,c}; }
vector<T> pows = {{1,1}};
struct HashRange {
str S; vector<T> cum = {{0,0}};
void add(char c) { S += c; cum.pb(base*cum.bk+makeT(c)); }
void add(str s) { trav(c,s) add(c); }
void extend(int len) { while (sz(pows) <= len) pows.pb(base*pows.bk); }
T hash(int l, int r) { int len = r+1-l; extend(len);
return cum[r+1]-pows[len]*cum[l]; }
/**int lcp(HashRange& b) { return first_true([&](int x) {
return cum[x] != b.cum[x]; },0,min(sz(S),sz(b.S)))-1; }*/
};
/// HashRange H; H.add("ababab"); F0R(i,6) FOR(j,i,6) ps(i,j,H.hash(i,j));
const int mx = 20005;
ht<ll, int> strs;
str orig[mx];
int main() {
setIO();
int N;
cin >> N;
for(int i = 1; i <= N; i++){
cin >> orig[i];
HashRange hr;
hr.add(orig[i]);
T val = hr.hash(0, sz(orig[i])-1);
strs[ll(val[0])*MOD+val[1]]++;
}
//ps(strs);
int ans = 0;
for(int i = 1; i <= N; i++){
HashRange hr;
hr.add(orig[i]);
ht<ll, int> substrs;
for(int j = 0; j < sz(orig[i]); j++){
for(int k = j; k < sz(orig[i]); k++){
T val = hr.hash(j, k);
ll nval = ll(val[0])*MOD+val[1];
substrs[nval];
}
}
for(auto u: substrs){
ans+=strs[u.f];
}
ans--;
}
ps(ans);
// you should actually read the stuff at the bottom
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
*/
Compilation message
lozinke.cpp: In function 'void setIn(std::__cxx11::string)':
lozinke.cpp:128:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~
lozinke.cpp: In function 'void setOut(std::__cxx11::string)':
lozinke.cpp:129:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
1024 KB |
Output is correct |
| 2 |
Correct |
5 ms |
1024 KB |
Output is correct |
| 3 |
Correct |
6 ms |
1032 KB |
Output is correct |
| 4 |
Correct |
6 ms |
1152 KB |
Output is correct |
| 5 |
Correct |
9 ms |
1728 KB |
Output is correct |
| 6 |
Correct |
12 ms |
1600 KB |
Output is correct |
| 7 |
Correct |
14 ms |
2300 KB |
Output is correct |
| 8 |
Correct |
18 ms |
3448 KB |
Output is correct |
| 9 |
Correct |
44 ms |
3448 KB |
Output is correct |
| 10 |
Correct |
70 ms |
10472 KB |
Output is correct |
| 11 |
Correct |
63 ms |
5876 KB |
Output is correct |
| 12 |
Correct |
129 ms |
19756 KB |
Output is correct |
| 13 |
Correct |
108 ms |
3576 KB |
Output is correct |
| 14 |
Correct |
107 ms |
19672 KB |
Output is correct |
| 15 |
Correct |
145 ms |
19800 KB |
Output is correct |
| 16 |
Correct |
141 ms |
1416 KB |
Output is correct |
| 17 |
Correct |
63 ms |
1152 KB |
Output is correct |
| 18 |
Correct |
59 ms |
1152 KB |
Output is correct |
| 19 |
Correct |
105 ms |
10472 KB |
Output is correct |
| 20 |
Correct |
81 ms |
1400 KB |
Output is correct |
