Submission #1514734

---

Source Code Expand

#include <map>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int N; vector<int> a[409]; map<vector<int>, int> d;
long long perm(int n, int k) {
	long long ret = 1;
	for (int i = n; i > n - k; i--) ret *= i;
	return ret;
}
vector<int> univec(vector<int> v) {
	vector<int> ret = v;
	for (int i = 0; i < 3; i++) {
		v.push_back(v[0]);
		v.erase(v.begin());
		ret = min(ret, v);
	}
	return ret;
}
int main() {
	cin >> N;
	for (int i = 0; i < N; i++) {
		a[i].resize(4);
		for (int j = 0; j < 4; j++) cin >> a[i][j];
		a[i] = univec(a[i]);
		d[a[i]]++;
	}
	long long ret = 0;
	for (int i = 0; i < N; i++) {
		d[a[i]]--;
		for (int j = i + 1; j < N; j++) {
			d[a[j]]--;
			for (int ri = 0; ri < 4; ri++) {
				a[i].push_back(a[i][0]); a[i].erase(a[i].begin());
				for (int rj = 0; rj < 4; rj++) {
					a[j].push_back(a[j][0]); a[j].erase(a[j].begin());
					map<vector<int>, int> e;
					e[univec({ a[j][1], a[j][0], a[i][1], a[i][0] })]++;
					e[univec({ a[j][0], a[j][3], a[i][2], a[i][1] })]++;
					e[univec({ a[j][3], a[j][2], a[i][3], a[i][2] })]++;
					e[univec({ a[j][2], a[j][1], a[i][0], a[i][3] })]++;
					long long res = 1;
					for (pair<vector<int>, int> k : e) {
						res *= perm(d[k.first], k.second);
						if (d[k.first] == 0) d.erase(k.first);
						if (k.first[0] == k.first[1] && k.first[1] == k.first[2] && k.first[2] == k.first[3]) {
							for (int l = 0; l < k.second; l++) res *= 4;
						}
						else if (k.first[0] == k.first[2] && k.first[1] == k.first[3]) {
							for (int l = 0; l < k.second; l++) res *= 2;
						}
					}
					ret += res;
				}
			}
			d[a[j]]++;
		}
	}
	cout << ret / 4 << endl;
	return 0;
}

Submission Info

Judge Result