#include <bits/stdc++.h>
using namespace std;
const int N = 2e4 + 5;
string a[N];
bool check(string &x, string &y){
int l = 0, r = 0;
int n = x.size(), m = y.size();
while (l < n && r < m){
if (x[l] == y[r]){
l++;
r++;
}
else r++;
}
return l == n;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n; cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
int ans = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (i != j) ans += check(a[j], a[i]);
cout << ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
860 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
860 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
860 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
860 KB |
Output isn't correct |
5 |
Incorrect |
18 ms |
856 KB |
Output isn't correct |
6 |
Incorrect |
52 ms |
860 KB |
Output isn't correct |
7 |
Incorrect |
50 ms |
856 KB |
Output isn't correct |
8 |
Incorrect |
41 ms |
860 KB |
Output isn't correct |
9 |
Execution timed out |
1043 ms |
860 KB |
Time limit exceeded |
10 |
Execution timed out |
1076 ms |
860 KB |
Time limit exceeded |
11 |
Execution timed out |
1041 ms |
856 KB |
Time limit exceeded |
12 |
Execution timed out |
1068 ms |
860 KB |
Time limit exceeded |
13 |
Execution timed out |
1075 ms |
860 KB |
Time limit exceeded |
14 |
Execution timed out |
1078 ms |
860 KB |
Time limit exceeded |
15 |
Execution timed out |
1057 ms |
860 KB |
Time limit exceeded |
16 |
Execution timed out |
1026 ms |
856 KB |
Time limit exceeded |
17 |
Execution timed out |
1052 ms |
856 KB |
Time limit exceeded |
18 |
Execution timed out |
1055 ms |
860 KB |
Time limit exceeded |
19 |
Execution timed out |
1066 ms |
860 KB |
Time limit exceeded |
20 |
Execution timed out |
1031 ms |
860 KB |
Time limit exceeded |