Submission #1109435

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1109435	2024-11-06T17:23:07 Z	mingga	Rima (COCI17_rima)	C++17	70 / 140	285 ms	137352 KB

rima

#include "bits/stdc++.h"

using namespace std;

#define ln "\n"
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
// #define int long long
const int MOD = 1e9 + 7;
const int inf = 2e9;
const int N = 3e6 + 7;

struct Trie {
    struct Node {
        Node * child[26];
        int cnt;
        Node() {
            for(int i = 0; i < 26; i++) child[i] = NULL;
            cnt = 0;
        }
    };
    int ans;
    Node* root;
    Trie(){
        root = new Node();
    };
    void add(string s) {
        Node * p = root;
        for(char c: s) {
            int i = c - 'a';
            if(p->child[i] == NULL) p->child[i] = new Node();
            p = p->child[i];
        }
        p->cnt = 1;
    }
    int dfs(Node * p) {
        int ans1 = 0, ans2 = 0;
        int sus = p->cnt;
        int cnt = 0;
        for(int i = 0; i < 26; i++) {
            if(p->child[i] == NULL) continue;
            Node * v = p->child[i];
            int x = dfs(v);
            if(v->cnt) cnt++;
            if(x >= ans1) {
                ans2 = ans1;
                ans1 = x;
            } else if(x > ans2) {
                ans2 = x;
            }
        }
        if(sus) {
            sus += cnt;
            if(ans1) sus = sus - 1 + ans1;
        }
        int cur = ans1 + ans2 + cnt;
        if(ans1) cur--;
        if(ans2) cur--;
        ans = max(ans, cur);
        return sus;
    }
} tri;

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
   // if(fopen("rima.inp", "r")) {
   //     freopen("rima.inp", "r", stdin);
   // }
    int n; cin >> n;
    for(int i = 1; i <= n; i++) {
        string s; cin >> s;
        reverse(all(s));
        tri.add(s);
    }
    tri.dfs(tri.root);
    cout << tri.ans;
}

Subtask #1

70.0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	532 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	285 ms	137352 KB	Output is correct
5	Correct	13 ms	3920 KB	Output is correct
6	Incorrect	89 ms	81040 KB	Output isn't correct
7	Incorrect	83 ms	80684 KB	Output isn't correct
8	Incorrect	83 ms	80456 KB	Output isn't correct
9	Incorrect	102 ms	85992 KB	Output isn't correct
10	Incorrect	84 ms	80380 KB	Output isn't correct