Submission #823555

#TimeUsernameProblemLanguageResultExecution timeMemory
823555VMaksimoski008Lozinke (COCI17_lozinke)C++14
100 / 100
207 ms17776 KiB
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int32_t main() {
    setIO();

    int n;
    cin >> n;
    unordered_map<string, int> occ, imp_occ;
    set<string> imp;

    for(int i=0; i<n; i++) {
        string str;
        cin >> str;
        set<string> s;
        imp.insert(str);
        imp_occ[str]++;

        for(int j=0; j<sz(str); j++) {
            string curr = "";
            for(int k=j; k<sz(str); k++) {
                curr += str[k];
                s.insert(curr);
            }
        }

        for(const string &x : s)
            occ[x]++;
    }

    ll ans = 0;
    for(auto &x : occ) {
        if(imp.count(x.first))
            ans += (x.second - 1) * imp_occ[x.first];
    }
    cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...