Submission #477349

#TimeUsernameProblemLanguageResultExecution timeMemory
477349BTheroCards (LMIO19_korteles)C++17
36 / 100
1094 ms7324 KiB
#include <bits/stdc++.h>

#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

using namespace std;

typedef long long ll;

const int MAXN = (int)5e5 + 5;

array<int, 4> arr[MAXN];
int n;

int encode(char a, char b) {
	return (a - 'A') * 26 + (b - 'A');
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n;

	for (int i = 0; i < n; i++) {
		string x, y;
		cin >> x >> y;
		arr[i][0] = encode(x[0], x[1]);
		arr[i][1] = encode(x[0], y[0]);
		arr[i][2] = encode(x[1], y[1]);
		arr[i][3] = encode(y[0], y[1]);
	}

	ll ans = 0;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < i; j++) {
			bool ok = 0;

			for (int k = 0; k < 4; k++) {
				ok |= (arr[i][k] == arr[j][k]);
			}

			if (ok) ans++;
		}

		reverse(all(arr[i]));
	}

	cout << ans << '\n';
	return 0;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...