oj.uz

답안 #520666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
520666 2022-01-30T16:37:08 Z HaYoungJoon Rima (COCI17_rima) C++14
56 / 140
 292 ms 160384 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxsize = 3*1e5;
int trie[3000001][26], timer = 0;
int dp[3000001], n, res = 0;
string a[500001];
vector<int> adj[3000001];

void addString(string s) {
    int cur = 0;
    for (char c: s) {
        int val = c - 'a';
        if (!trie[cur][val]) {
            adj[cur].emplace_back(++timer);
            trie[cur][val] = timer;
        }
        cur = trie[cur][val];
    }
    dp[cur]++;
}

void DFS(int u) {
    int maxnhanh = 0;
    for (int v: adj[u]) {
        DFS(v);
        maxnhanh = max(maxnhanh,dp[v]);
    }
    res = max(dp[u],res);
    if (dp[u] && maxnhanh) {
        for (int v: adj[u]) dp[u] += (dp[v] > 0);
        dp[u] += maxnhanh - 1;
        res = max(dp[u],res);
    }
    if (maxnhanh) {
        int total = 0;
        for (int v: adj[u]) total += (dp[v] > 0);
        total += maxnhanh - 1;
        res = max(res,total);

    }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        reverse(a[i].begin(),a[i].end());
    }
    for (int i = 1; i <= n; i++) addString(a[i]);
    DFS(0);
    cout << res;
    return 0;
}

Subtask #1
56.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 86384 KB Output is correct
2 Correct 39 ms 86528 KB Output is correct
3 Correct 40 ms 86340 KB Output is correct
4 Incorrect 292 ms 160384 KB Output isn't correct
5 Correct 60 ms 89924 KB Output is correct
6 Incorrect 96 ms 150736 KB Output isn't correct
7 Incorrect 98 ms 150540 KB Output isn't correct
8 Incorrect 94 ms 150376 KB Output isn't correct
9 Incorrect 112 ms 154700 KB Output isn't correct
10 Incorrect 94 ms 150412 KB Output isn't correct