# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078716 | khactrung1912 | Lozinke (COCI17_lozinke) | C++14 | 16 ms | 18780 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 <bits/stdc++.h>
#define pii pair<int, int>
#define fi first
#define se second
#define N 100005
#define quick ios_base :: sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
int n, a[N], ans;
string s[N];
struct node
{
node* child[26];
int dem;
};
node* u1 = new node();
void Add(string s)
{
node* u = u1;
for (int i = 0 ; i < s.size();i++)
{
int k = s[i] - 'a';
if (u -> child[k] == NULL)
u -> child[k] = new node();
u = u -> child[k];
u -> dem++;
}
}
int getTrie(string s)
{
node* u = u1;
for (int i = 0 ; i < s.size(); i++)
{
int k = s[i] - 'a';
u = u -> child[k];
if (i == s.size() - 1) return (u -> dem) - 1;
}
}
int main()
{
quick;
// freopen("PASS.inp", "r", stdin);
// freopen("PASS.out", "w", stdout);
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> s[i];
Add(s[i]);
}
for (int i = 1; i <= n; i++)
{
ans += getTrie(s[i]);
}
cout << ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |