Submission #244962

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
244962	2020-07-05T10:07:07 Z	ne4eHbKa	Rima (COCI17_rima)	C++17	126 / 140	792 ms	77244 KB

rima

//{ <defines>
#include <bits/stdc++.h>
using namespace std;

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}

int md = 998244353;

inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}

int m_bpow(ll A, ll b) {
    int a = A % md;
    ll ans = 1;
    for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
        (ans *= ans) %= md;
        if(p & b)
            (ans *= a) %= md;
    }
    re ans;
}

//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 2e5 + 5;

struct b {
    map<char, b*> nx {};
    int f {};
    bool z {};
    void add(const string &s, int i = 0) {
        if(i == sz(s)) {
            z = true;
            return;
        }
        if(nx.find(s[i]) == nx.end())
            nx[s[i]] = new b();
        nx[s[i]]->add(s, i + 1);
    }
    void count() {
        int c = 0;
        for(const auto &i : nx) {
            i.sd->count();
            if(!i.sd->z) continue;
            ++f;
            umax(c, i.sd->f);
        }
        f += c;
        umax(f, 1);
    }
    int ans() {
        int res = 0;
        if(z) umax(res, f);
        int u {}, d {}, cnt {};
        for(const auto &i : nx) {
            if(!i.sd->z) continue;
            ++cnt;
            const int &s = i.sd->f;
            if(s > u) {
                d = u;
                u = s;
            } ef(s > d) {
                d = s;
            }
        }
        if(cnt > 1) umax(res, cnt - 1 + d + u);
        for(const auto &i : nx) umax(res, i.sd->ans());
        return res;
    }
};

void solve() {
    int n; cin >> n;
    b t {};
    fo(n) {
        string f; cin >> f;
        reverse(bnd(f));
        t.add(f);
    }
    t.count();
    cout << t.ans() << endl;
}

int main() {
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    for(int test = 1; test <= tests; ++test) {
		cerr << "case #" << test << endl;
        solve();
        cerr << endl;
    }
#else
//    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    solve();
#endif
    return 0;
}

Compilation message

rima.cpp: In function 'int m_bpow(ll, ll)':
rima.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
     for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
                       ~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1

126.0 / 140.0

#	Verdict	Execution time	Memory	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	Incorrect	792 ms	77244 KB	Output isn't correct
5	Correct	28 ms	760 KB	Output is correct
6	Correct	73 ms	47208 KB	Output is correct
7	Correct	73 ms	47092 KB	Output is correct
8	Correct	64 ms	47024 KB	Output is correct
9	Correct	112 ms	48928 KB	Output is correct
10	Correct	64 ms	47064 KB	Output is correct