oj.uz

답안 #107984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107984 2019-04-26T12:50:54 Z Frankenween Lozinke (COCI17_lozinke) C++17
85 / 100
 495 ms 13560 KB 
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#define ull unsigned long long
#define pll pair<ll, ll>
#define mp make_pair
#define ll long long
#define pb push_back
#define deb(x) cout << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define ld long double
const ll mod = (ll)998244353;
const ll BASE = 47;
const ll inf = (ll)1e18;
const long double e = 2.718281828459;
const long double pi = 3.141592653;
const ld EPS = 1e-9;


using namespace std;


template <class T>
istream& operator>>(istream &in, vector<T> &arr) {
    for (T &cnt : arr) {
        in >> cnt;
    }
    return in;
};


void solve() {
    ll n;
    cin >> n;
    map<ll, ll> cnt;
    vector<string> arr(n);
    cin >> arr;
    for (int i = 0; i < n; i++) {
        ll h = 0;
        for (auto c : arr[i]) {
            h = (h * BASE + c - 'a' + 1) % mod;
        }
        cnt[h]++;
    }
    ll answer = 0;
    for (auto &s : arr) {
        set<ll> d;
        for (int i = 0; i < s.size(); i++) {
            ll h = 0;
            for (int j = i; j < s.size(); j++) {
                h = (h * BASE + s[j] - 'a' + 1) % mod;
                d.insert(h);
            }
        }
        for (auto i : d) {
            answer += cnt[i];
        }
        answer--;
    }
    cout << answer;
}


int main() {
#ifndef LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#else
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cout.precision(30);
    ll seed = time(0);
    //cerr << "Seed: " << seed << "\n";
    srand(seed);
    solve();
    return 0;
}

Compilation message

lozinke.cpp: In function 'void solve()':
lozinke.cpp:50:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < s.size(); i++) {
                         ~~^~~~~~~~~~
lozinke.cpp:52:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int j = i; j < s.size(); j++) {
                             ~~^~~~~~~~~~

Subtask #1
85.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 9 ms 768 KB Output is correct
6 Correct 10 ms 740 KB Output is correct
7 Correct 14 ms 1280 KB Output is correct
8 Correct 38 ms 2040 KB Output is correct
9 Correct 63 ms 2168 KB Output is correct
10 Incorrect 176 ms 6320 KB Output isn't correct
11 Correct 95 ms 3704 KB Output is correct
12 Incorrect 495 ms 13560 KB Output isn't correct
13 Correct 129 ms 2552 KB Output is correct
14 Correct 327 ms 12344 KB Output is correct
15 Correct 480 ms 13480 KB Output is correct
16 Correct 116 ms 1272 KB Output is correct
17 Correct 25 ms 1152 KB Output is correct
18 Correct 26 ms 1152 KB Output is correct
19 Incorrect 263 ms 7296 KB Output isn't correct
20 Correct 63 ms 1280 KB Output is correct