#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define yes "YES"
#define no "NO"
#define bigg INT_MAX
#define debug(x) cout<<(#x)<<" = " <<x<<endl;
#define all(x) x.begin(),x.end()
#define sz size()
#define nn '\n'
#define mms(x,y) memset(x,y,sizeof(x))
#define forr(i,j,n) for (int i=j; i<n; i++)
#define forn(i,j,n) for (int i=j; i>n; i--)
#define fi first
#define se second
#define la "LA"
#define cinn(x,y) for(int i=0; i<y; i++) cin>>x[i];
#define pii pair<int,int>
signed main()
{
// #ifndef LOCAL
// freopen("helpcross.in","r",stdin);
// freopen("helpcross.out","w", stdout);
// #endif
fast
int n;
cin>>n;
string a[n];
unordered_map<string,int> m;
unordered_map<string,bool> b;
forr(i,0,n)
{
cin>>a[i];
m[a[i]]++;
b[a[i]]=1;
}
int ans=0;
forr(k,0,n)
{
string s=a[k];
int w=s.sz;
unordered_map<string,bool> cb=b;
forr(j,0,w)
{
string cur="";
forr(i,j,w)
{
cur+=s[i];
//cout<<k<<' '<<cur<<endl;
if (cb[cur]) ans+=m[cur];
cb[cur]=0;
}
// cout<<k<<' '<<cur<<endl;
}
}
cout<<ans-n;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
8 ms |
348 KB |
Output is correct |
5 |
Correct |
53 ms |
660 KB |
Output is correct |
6 |
Correct |
120 ms |
600 KB |
Output is correct |
7 |
Correct |
175 ms |
860 KB |
Output is correct |
8 |
Correct |
173 ms |
808 KB |
Output is correct |
9 |
Execution timed out |
1039 ms |
1896 KB |
Time limit exceeded |
10 |
Execution timed out |
1077 ms |
2140 KB |
Time limit exceeded |
11 |
Execution timed out |
1041 ms |
2904 KB |
Time limit exceeded |
12 |
Execution timed out |
1018 ms |
2904 KB |
Time limit exceeded |
13 |
Execution timed out |
1034 ms |
4024 KB |
Time limit exceeded |
14 |
Execution timed out |
1002 ms |
4532 KB |
Time limit exceeded |
15 |
Execution timed out |
1050 ms |
4024 KB |
Time limit exceeded |
16 |
Execution timed out |
1062 ms |
1368 KB |
Time limit exceeded |
17 |
Correct |
62 ms |
1052 KB |
Output is correct |
18 |
Correct |
45 ms |
856 KB |
Output is correct |
19 |
Execution timed out |
1049 ms |
3764 KB |
Time limit exceeded |
20 |
Execution timed out |
1036 ms |
1372 KB |
Time limit exceeded |