Submission #1521450

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using Square = array<int, 4>;

map<Square, ll> memo;

const Square indices[] = {{1,0,1,0},{2,1,0,3},{3,2,3,2},{0,3,2,1}};

void normalize(Square& s) {
	set<Square> tmp;
	for (int i = 0; i < 4; i++) {
		tmp.insert(s);
		rotate(s.begin(), s.begin() + 1, s.end());
	}
	s = *tmp.begin();
}

int pattern(Square& s) {
	if (s[0] == s[2] && s[1] == s[3]) {
		if (s[0] == s[1]) return 4;
		else return 2;
	}
	return 1;
}

ll solve(const Square& s1, const Square& s2) {
	ll res = 1;
	int used = -1;
	for (int i = 0; i < 4; i++) {
		Square tmp = {s1[indices[i][0]], s1[indices[i][1]], s2[indices[i][2]], s2[indices[i][3]]};
		normalize(tmp);
		if (memo.find(tmp) == memo.end() || memo[tmp] == 0) {
			res = 0;
			break;
		}
		res *= memo[tmp] * pattern(tmp);
		memo[tmp]--;
		used++;
	}

	for (int i = 0; i <= used; i++) {
		Square tmp = {s1[indices[i][0]], s1[indices[i][1]], s2[indices[i][2]], s2[indices[i][3]]};
		normalize(tmp);
		memo[tmp]++;	
	}
	return res;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	vector<Square> c(n);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 4; j++) {
			cin >> c[i][j];
		}
		normalize(c[i]);
		memo[c[i]]++;
	}

	ll ans = 0;
	for (int i = 0; i < n; i++) {
		memo[c[i]]--;
		for (int j = 0; j < i; j++) {
			memo[c[j]]--;
			for (int k = 0; k < 4; k++) {
				ans += solve(c[i], c[j]);
				rotate(c[j].begin(), c[j].begin() + 1, c[j].end());
			}
			memo[c[j]]++;
		}
		memo[c[i]]++;	
	}
	cout << ans / 3 << endl;
	return 0;
}

Submission Info

Judge Result