oj.uz

답안 #245703

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245703 2020-07-07T08:11:34 Z Vimmer Rima (COCI17_rima) C++14
140 / 140
 355 ms 80848 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 3000001
#define M ll(998244353)
#define inf 1e9 + 1e9


using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int nxt[N][26], id = 1, kl[N], ans = 0;

void add(int v, string &s, int i)
{
    if (i == sz(s)) {kl[v]++; return;}

    int c = s[i] - 'a';

    if (nxt[v][c] == 0) nxt[v][c] = ++id;

    add(nxt[v][c], s, i + 1);
}

int dfs(int v)
{
   int sum = 0;

   vector <int> vr; vr.clear();

   for(int i = 0; i < 26; i++)
   {
       int it = nxt[v][i];

       if (it == 0) continue;

       int sm = dfs(it);

       if (kl[it] == 1) vr.pb(sm);

       sum += kl[it];
   }

   sort(vr.rbegin(), vr.rend());

   int smr = 0;

   for (int i = 0; i < min(2, sz(vr)); i++) smr += vr[i];

   ans = max(ans, kl[v] + smr + sum);

   return (sz(vr) == 0 ? 0 : vr[0]) + sum;
}
int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    vector <string> g(n);

    for (int i = 0; i < n; i++)
    {
        cin >> g[i];

        string st = "";

        for (int j = sz(g[i]) - 1; j >= 0; j--) st += g[i][j];

        add(1, st, 0);

        g[i] = st;
    }

    dfs(1);

    cout << ans << endl;
}

Subtask #1
140.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 355 ms 80848 KB Output is correct
5 Correct 42 ms 3832 KB Output is correct
6 Correct 67 ms 60040 KB Output is correct
7 Correct 64 ms 59916 KB Output is correct
8 Correct 72 ms 59724 KB Output is correct
9 Correct 108 ms 64204 KB Output is correct
10 Correct 75 ms 60000 KB Output is correct