oj.uz

Submission #234391

# Submission time Handle Problem Language Result Execution time Memory
234391 2020-05-24T06:52:44 Z kartel Lozinke (COCI17_lozinke) C++14
85 / 100
 453 ms 16248 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

string s[N];
ll i, n, ans, j, hsh, p[N], l, r;
map <ll, ll> mp;
map <string, ll> mk;

ll mult(ll x, ll y) {return (x * y) % M;}
ll sm(ll x, ll y) {return (x + y) % M;}

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;

    p[0] = 1;
    for (i = 1; i <= n; i++) p[i] = mult(p[i - 1], 29);

    for (i = 1; i <= n; i++)
    {
        cin >> s[i];

        hsh = 0;

        for (j = 0; j < sz(s[i]); j++)
                hsh = sm(hsh, mult(s[i][j] - 'a' + 1, p[j]));

        mp[hsh]++;
    }

    for (i = 1; i <= n; i++)
    {
        mk.clear();

//        int cur = 0;

        for (l = 0; l < sz(s[i]); l++)
        {
            hsh = 0;

            string t = "";

            for (r = l; r < sz(s[i]); r++)
            {
                t += s[i][r];

                hsh = sm(hsh, mult(s[i][r] - 'a' + 1, p[r - l]));
                if (mk[t]) continue;

                mk[t] = 1;

//                cur += mp[hsh];
                ans += mp[hsh];
            }
        }

//        cout << cur - 1 << el;

    }

    cout << ans - n;
}

Subtask #1
85.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3456 KB Output is correct
2 Correct 6 ms 3456 KB Output is correct
3 Correct 7 ms 3456 KB Output is correct
4 Correct 7 ms 3584 KB Output is correct
5 Correct 18 ms 3840 KB Output is correct
6 Correct 21 ms 3832 KB Output is correct
7 Correct 24 ms 4352 KB Output is correct
8 Correct 37 ms 5016 KB Output is correct
9 Correct 86 ms 4972 KB Output is correct
10 Correct 192 ms 9184 KB Output is correct
11 Correct 139 ms 6372 KB Output is correct
12 Incorrect 453 ms 16248 KB Output isn't correct
13 Correct 270 ms 4984 KB Output is correct
14 Incorrect 306 ms 14840 KB Output isn't correct
15 Incorrect 451 ms 16064 KB Output isn't correct
16 Correct 273 ms 3840 KB Output is correct
17 Correct 76 ms 3712 KB Output is correct
18 Correct 57 ms 3584 KB Output is correct
19 Correct 289 ms 9720 KB Output is correct
20 Correct 137 ms 3836 KB Output is correct