Submission #2716903

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, c[666][4], z;
ll F(ll a, ll b, ll c, ll d) {
	return a << 30 | b << 20 | c << 10 | d;
}
map<ll, ll> g;
void A(ll x, ll v) {
	for (int i = 0; i < 4; i++) {
		g[x] += v;
		x = (x >> 10) | (x & 1023) << 30;
	}
}
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 4; j++) {
			cin >> c[i][j];
		}
		A(F(c[i][0], c[i][1], c[i][2], c[i][3]), 1);
	}
	for (int i = 0; i < n; i++) {
		A(F(c[i][0], c[i][1], c[i][2], c[i][3]), -1);
		for (int j = i + 1; j < n; j++) {
			A(F(c[j][0], c[j][1], c[j][2], c[j][3]), -1);
			for (int k = 0; k < 4; k++) {
				ll r = 1;
				for (int l = 0; l < 4; l++) {
					ll u = F(c[j][(k - l + 1) & 3], c[j][(k - l) & 3], c[i][(l + 1) & 3], c[i][l & 3]);
					r *= g[u];
					A(u, -1);
				}
				for (int l = 0; l < 4; l++) {
					ll u = F(c[j][(k - l + 1) & 3], c[j][(k - l) & 3], c[i][(l + 1) & 3], c[i][l & 3]);
					A(u, 1);
				}
				z += r;
			}
			A(F(c[j][0], c[j][1], c[j][2], c[j][3]), 1);
		}
	}
	cout << z << endl;
	return 0;
}

Submission Info

Judge Result