oj.uz

Submission #57915

# Submission time Handle Problem Language Result Execution time Memory
57915 2018-07-16T13:54:38 Z Benq Lozinke (COCI17_lozinke) C++14
45 / 100
 1000 ms 25172 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

string A[20000];
int N, ans;

template<int MX> struct tri {
    int trie[MX][26], nex = 0; // easily changed to character
    int sz[MX];
    bool done[MX];
    vi oc;
    
    tri() {
        memset(trie,0,sizeof trie);
    }
    
    void ins(string x, int a = 1) { // insert or delete
        int cur = 0; 
        for (char c: x) {
            int t = c-'a';
            if (!trie[cur][t]) trie[cur][t] = ++nex;
            cur = trie[cur][t];
        }
        sz[cur] += a;
    }
    
    void solve(string x) {
        int cur = 0;
        for (char c: x) {
            int t = c-'a';
            if (!trie[cur][t]) break;
            cur = trie[cur][t];
            if (!done[cur]) {
                done[cur] = 1; oc.pb(cur);
                ans += sz[cur];
            }
        }
    }
};

tri<200005> t;

void test(string x) {
    F0R(i,sz(x)) t.solve(x.substr(i,sz(x)-i));
    for (int i: t.oc) t.done[i] = 0;
    ans --;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N;
    F0R(i,N) {
        cin >> A[i];
        t.ins(A[i]);
    }
    F0R(i,N) test(A[i]);
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
45.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 21392 KB Output is correct
2 Correct 21 ms 21392 KB Output is correct
3 Correct 23 ms 21600 KB Output is correct
4 Correct 23 ms 21600 KB Output is correct
5 Correct 24 ms 21928 KB Output is correct
6 Correct 49 ms 22028 KB Output is correct
7 Correct 39 ms 22028 KB Output is correct
8 Correct 50 ms 22124 KB Output is correct
9 Correct 800 ms 23176 KB Output is correct
10 Execution timed out 1080 ms 23360 KB Time limit exceeded
11 Execution timed out 1084 ms 23360 KB Time limit exceeded
12 Execution timed out 1081 ms 23816 KB Time limit exceeded
13 Execution timed out 1086 ms 24796 KB Time limit exceeded
14 Execution timed out 1087 ms 24796 KB Time limit exceeded
15 Execution timed out 1074 ms 24796 KB Time limit exceeded
16 Execution timed out 1069 ms 25172 KB Time limit exceeded
17 Execution timed out 1086 ms 25172 KB Time limit exceeded
18 Execution timed out 1087 ms 25172 KB Time limit exceeded
19 Execution timed out 1076 ms 25172 KB Time limit exceeded
20 Execution timed out 1086 ms 25172 KB Time limit exceeded