oj.uz

답안 #96811

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96811 2019-02-12T08:40:38 Z tieunhi Rima (COCI17_rima) C++14
56 / 140
 472 ms 137564 KB 
#include <bits/stdc++.h>
#define FOR(i, u, v) for (int i = u; i <= v; i++)
#define FORD(i, v, u) for (int i = v; i >= u; i--)
#define ll long long
#define pii pair<int, int>
#define PB push_back
#define mp make_pair
#define F first
#define S second
#define N 3000005
#define BASE 37
#define mod 1000000007
#define mid (r + l)/2

using namespace std;

int n, dp[N], res;

struct Trie
{
    Trie *child[26];
    int cnt, dp;
    Trie()
    {
        FOR(i, 0, 25) child[i] = NULL;
        cnt = 0, dp = 0;
    }
}t;

void DFS(Trie *u)
{
    int cnt1 = 0, vmax = 0;
    FOR(c, 0, 25)
    {
        if (u->child[c] == NULL) continue;

        Trie *v = u->child[c];
        DFS(v);

        if (v->cnt == 0) continue;
        else if (v->cnt == 1)
        {
            cnt1++;
            vmax = max(vmax, v->dp);
        }
        else u->dp += (v->dp + v->cnt);
    }
    u->dp += (cnt1 + vmax);
    res = max(res, u->dp);
}
int main()
{
    ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
    //freopen("INP.TXT", "r", stdin);
    //freopen("OUT.TXT", "w", stdout);
    cin >> n;
    FOR(i, 1, n)
    {
        string s; cin >> s;
        Trie *p = &t;
    	FORD(i, s.size()-1, 0)
    	{
        	int c = s[i] - 'a';
        	if (p->child[c] == NULL) p->child[c] = new Trie();
        	p = p->child[c];
    	}
    	p->cnt++;
    }
    DFS(&t);
    cout <<res;
}

Subtask #1
56.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 Incorrect 472 ms 137564 KB Output isn't correct
5 Correct 41 ms 3908 KB Output is correct
6 Incorrect 115 ms 86360 KB Output isn't correct
7 Incorrect 106 ms 85968 KB Output isn't correct
8 Incorrect 100 ms 85632 KB Output isn't correct
9 Incorrect 126 ms 91552 KB Output isn't correct
10 Incorrect 112 ms 85844 KB Output isn't correct