# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
469971 | rainboy | Lozinke (COCI17_lozinke) | C11 | 27 ms | 8128 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <string.h>
#define N 20000
#define L 10
#define N_ (2 + N * L)
#define A 26
int main() {
static char ss[N][L + 1], used[N_];
static int ll[N], tt[N_][A], kk[N_];
int n, n_, h, h_, i, t, ans;
scanf("%d", &n);
n_ = 2;
for (i = 0; i < n; i++) {
scanf("%s", ss[i]), ll[i] = strlen(ss[i]);
for (h = 0, t = 1; h < ll[i]; h++) {
int a = ss[i][h] - 'a';
if (!tt[t][a])
tt[t][a] = n_++;
t = tt[t][a];
}
kk[t]++;
}
ans = 0;
for (i = 0; i < n; i++) {
for (h = 0; h < ll[i]; h++)
for (h_ = h, t = 1; h_ < ll[i]; h_++) {
t = tt[t][ss[i][h_] - 'a'];
if (!used[t])
ans += kk[t], used[t] = 1;
}
for (h = 0; h < ll[i]; h++)
for (h_ = h, t = 1; h_ < ll[i]; h_++) {
t = tt[t][ss[i][h_] - 'a'];
used[t] = 0;
}
}
ans -= n;
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |