Submission #518362

#	Time	Username	Problem	Language	Result	Execution time	Memory
518362		drkarlicio2107	Cards (LMIO19_korteles)	C++14	0 / 100	139 ms	3148 KiB

korteles

#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 [d][c][b][a]++;
		//cout << ans << endl;
	}
	cout << ans;
}

• Subtask 1: 0 / 16
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 19
• Subtask 5: 0 / 25