Submission #631125

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
631125	2022-08-17T17:35:35 Z	Soul234	Rima (COCI17_rima)	C++14	140 / 140	238 ms	115344 KB

rima

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

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;

struct Nod {
    int nxt[26], cntend, dp;
} NodeID;

int N, ans = 0;
V<Nod> tr = {NodeID};

void ins(const str&s) {
    int cur = 0;
    R0F(i,sz(s)) {
        int c = s[i]-'a';
        if(!tr[cur].nxt[c]) {
            tr[cur].nxt[c] = sz(tr);
            tr.pb(NodeID);
        }
        cur = tr[cur].nxt[c];
    }
    tr[cur].cntend++;
}

void dfs(int u) {
    int mx1 = 0, mx2 = 0, c1 = 0, c2 = 0, tot = 0;
    F0R(i,26) if(tr[u].nxt[i]) {
        int v = tr[u].nxt[i];
        dfs(v);
        tot += tr[v].cntend;
        if(mx1 < tr[v].dp) {
            mx2 = mx1;
            c2 = c1;
            mx1 = tr[v].dp;
            c1 = v;
        }
        else if(ckmax(mx2, tr[v].dp)) c2 = v;
    }
    if(tr[u].cntend) tr[u].dp = mx1 + tot - tr[c1].cntend + tr[u].cntend;
    ckmax(ans, mx1 + mx2 + tot - tr[c1].cntend - tr[c2].cntend + tr[u].cntend);
}

void solve() {
    cin >> N;
    F0R(i, N) {
        str s; cin >> s;
        ins(s);
    }
    dfs(0);
    cout << ans << nl;
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

rima.cpp: In function 'void setIO(std::string)':
rima.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
rima.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

140.0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	238 ms	115344 KB	Output is correct
5	Correct	15 ms	888 KB	Output is correct
6	Correct	72 ms	58108 KB	Output is correct
7	Correct	65 ms	58308 KB	Output is correct
8	Correct	63 ms	58124 KB	Output is correct
9	Correct	80 ms	58932 KB	Output is correct
10	Correct	65 ms	58148 KB	Output is correct