#include <bits/stdc++.h>
using namespace std;
int x [30][30]; int y [30][30]; int z [30][30]; int q [30][30];
int xy [30][30][30]; int yz [30][30][30]; int zq [30][30][30]; int qx [30][30][30];
int xyzq [30][30][30][30];
int main(){
int n; cin >> n; long long int ans=0;
for (int i=0; i<n; i++){
char a1,b1,c1,d1; cin >> a1 >> b1 >> c1 >> d1;
int a=a1-'A', b=b1-'A', c=d1-'A', d=c1-'A';
ans+=x[a][b]+y[b][c]+z[c][d]+q[d][a];
//cout << ans << " " << zq[a][c][d] << endl;
if (a==c){
ans-=(xy[a][b][c]+zq[a][d][c]);
}
//cout << ans << endl;
if (b==d){
ans-=(yz[b][c][d]+qx[d][a][b]);
}
//cout << ans << endl;
if (a==c && b==d){
ans+=xyzq [a][b][c][d];
}
x[d][c]++; y [a][d]++; z [b][a]++; q [c][b]++;
xy[d][a][d]++; zq[b][a][b]++;
yz[a][b][a]++; qx[c][b][c]++;
xyzq [c][b][d][a]++;
//cout << ans << endl;
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
460 KB |
Output is correct |
3 |
Incorrect |
0 ms |
588 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
460 KB |
Output is correct |
3 |
Incorrect |
0 ms |
588 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
129 ms |
3148 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Incorrect |
18 ms |
3144 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
4 |
Incorrect |
0 ms |
588 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |