답안 #520667

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
520667	2022-01-30T16:44:35 Z	HaYoungJoon	Rima (COCI17_rima)	C++14	56 / 140	273 ms	160572 KB

rima

#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 maxnhanh1 = 0, maxnhanh2 = 0;
    for (int v: adj[u]) {
        DFS(v);
        if (dp[v] > maxnhanh1) {
            maxnhanh2 = maxnhanh1;
            maxnhanh1 = dp[v];
        } else maxnhanh2 = max(maxnhanh2,dp[v]);
    }
    res = max(res,maxnhanh1 + maxnhanh2);
    res = max(dp[u],res);
    if (dp[u] && maxnhanh1) {
        for (int v: adj[u]) dp[u] += (dp[v] > 0);
        dp[u] += maxnhanh1 - 1;
        res = max(dp[u],res);
    }
    if (maxnhanh1) {
        int total = 0;
        for (int v: adj[u]) total += (dp[v] > 0);
        total += maxnhanh1 - 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	42 ms	86468 KB	Output is correct
2	Correct	40 ms	86340 KB	Output is correct
3	Correct	40 ms	86340 KB	Output is correct
4	Incorrect	273 ms	160572 KB	Output isn't correct
5	Correct	59 ms	89964 KB	Output is correct
6	Incorrect	88 ms	150736 KB	Output isn't correct
7	Incorrect	89 ms	150592 KB	Output isn't correct
8	Incorrect	87 ms	150356 KB	Output isn't correct
9	Incorrect	115 ms	154716 KB	Output isn't correct
10	Incorrect	93 ms	150384 KB	Output isn't correct