oj.uz

답안 #244904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244904 2020-07-05T09:02:51 Z NONAME Rima (COCI17_rima) C++14
56 / 140
 380 ms 150496 KB 
#include <bits/stdc++.h>
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;

const int N = 5e5 + 10;

int n, ans = 1;
string s[N];

struct trie {
    trie *nxt[26];
    int cnt, res;

    trie() {
        for (int i = 0; i < 26; ++i)
            nxt[i] = 0;
        cnt = 0;
        res = 0;
    }

    void add(string &t, int p = 0) {
        if (p == int(t.size())) {
            ++cnt;
            return;
        }

        int j = t[p] - 'a';

        if (nxt[j] == 0)
            nxt[j] = new trie();

        nxt[j] -> add(t, p + 1);
    }

    void f() {
        for (int i = 0; i < 26; ++i)
            if (nxt[i] != 0)
                nxt[i] -> f();

        for (int i = 0; i < 26; ++i)
            if (nxt[i] != 0)
                res += (nxt[i] -> res);

        if (!cnt) res = 0;
            else ++res;

        ans = max(ans, res);
    }
} tr;

int main() {
    fast_io;

    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> s[i];
        reverse(s[i].begin(), s[i].end());
        tr.add(s[i]);
    }

    tr.f();

    cout << ans << "\n";
}

Subtask #1
56.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 16128 KB Output is correct
2 Correct 14 ms 16000 KB Output is correct
3 Correct 13 ms 16000 KB Output is correct
4 Incorrect 380 ms 150496 KB Output isn't correct
5 Correct 31 ms 19584 KB Output is correct
6 Incorrect 104 ms 92944 KB Output isn't correct
7 Incorrect 104 ms 92700 KB Output isn't correct
8 Incorrect 101 ms 92500 KB Output isn't correct
9 Incorrect 127 ms 98388 KB Output isn't correct
10 Incorrect 111 ms 92416 KB Output isn't correct