#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//uniform_int_distribution<int>(1000,10000)(rng)
int nextL[1000000][26],tot=1;
void addWord()
{
int cur=1;
string s;
cin>>s;
sort(s.begin(), s.end());
for (auto c : s)
{
if (!nextL[cur][c-'a'])
{
++tot;
nextL[cur][c-'a']=tot;
}
cur=nextL[cur][c-'a'];
}
return;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
cin>>n;
while (n--)
addWord();
cout<<tot;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
3 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
4 |
Incorrect |
6 ms |
1152 KB |
Output isn't correct |
5 |
Incorrect |
12 ms |
7936 KB |
Output isn't correct |
6 |
Incorrect |
30 ms |
24568 KB |
Output isn't correct |
7 |
Incorrect |
45 ms |
38516 KB |
Output isn't correct |
8 |
Incorrect |
51 ms |
45048 KB |
Output isn't correct |
9 |
Incorrect |
49 ms |
40944 KB |
Output isn't correct |
10 |
Incorrect |
48 ms |
41080 KB |
Output isn't correct |