oj.uz

Submission #968664

# Submission time Handle Problem Language Result Execution time Memory
968664 2024-04-23T19:55:50 Z RandomUser Lozinke (COCI17_lozinke) C++17
100 / 100
 269 ms 17856 KB 
#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;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 5 ms 860 KB Output is correct
6 Correct 8 ms 856 KB Output is correct
7 Correct 11 ms 1624 KB Output is correct
8 Correct 17 ms 2484 KB Output is correct
9 Correct 41 ms 2996 KB Output is correct
10 Correct 90 ms 8668 KB Output is correct
11 Correct 68 ms 5292 KB Output is correct
12 Correct 240 ms 17352 KB Output is correct
13 Correct 123 ms 4268 KB Output is correct
14 Correct 154 ms 17856 KB Output is correct
15 Correct 269 ms 17676 KB Output is correct
16 Correct 122 ms 860 KB Output is correct
17 Correct 45 ms 604 KB Output is correct
18 Correct 31 ms 600 KB Output is correct
19 Correct 128 ms 9908 KB Output is correct
20 Correct 64 ms 888 KB Output is correct