oj.uz

답안 #234397

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
234397 2020-05-24T06:58:07 Z kartel Lozinke (COCI17_lozinke) C++14
100 / 100
 539 ms 19180 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 <string, int> mk, mp;

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;
    for (i = 1; i <= n; i++) cin >> s[i];

    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];

                if (mk[t]) continue;

                mk[t] = 1;

                mp[t]++;
            }
        }

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

    }

    for (i = 1; i <= n; i++)
    {
        ans += mp[s[i]];
    }

    cout << ans - n;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 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 19 ms 3968 KB Output is correct
6 Correct 25 ms 3840 KB Output is correct
7 Correct 30 ms 4608 KB Output is correct
8 Correct 46 ms 5368 KB Output is correct
9 Correct 113 ms 5228 KB Output is correct
10 Correct 235 ms 10336 KB Output is correct
11 Correct 178 ms 6904 KB Output is correct
12 Correct 529 ms 19180 KB Output is correct
13 Correct 334 ms 5256 KB Output is correct
14 Correct 374 ms 17528 KB Output is correct
15 Correct 539 ms 19064 KB Output is correct
16 Correct 366 ms 3584 KB Output is correct
17 Correct 77 ms 3456 KB Output is correct
18 Correct 57 ms 3456 KB Output is correct
19 Correct 366 ms 11128 KB Output is correct
20 Correct 178 ms 3704 KB Output is correct