Submission #1675294

---

Source Code Expand

#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;

typedef long long LL;
typedef pair <int, int> pii;

inline int Read()
{
	int x = 0, f = 1, c = getchar();
	for (; !isdigit(c); c = getchar())
		if (c == '-')
			f = -1;
	for (;  isdigit(c); c = getchar())
		x = x * 10 + c - '0';
	return x * f;
}

const int MAXN = 405;

LL ans, ways, f[MAXN], tmp[4];
map <LL, int> cnt;
int n, a[MAXN][4];

inline LL Get(int a, int b, int c, int d)
{
	int e[4] = {a, b, c, d};
	LL ret = 1LL << 60;
	for (int i = 0; i < 4; i ++)
	{
		LL cur = 0;
		for (int j = 0; j < 4; j ++)
			cur = cur << 10 | e[i + j & 3];
		ret = min(ret, cur);
	}
	return ret;
}

inline int Get(LL x)
{
	if (x >> 20 == (x & (1 << 20) - 1))
	{
		if (x >> 30 == (x & (1 << 10) - 1))
			return 4;
		return 2;
	}
	return 1;
}

int main()
{
#ifdef wxh010910
	freopen("data.in", "r", stdin);
#endif
	n = Read();
	for (int i = 1; i <= n; i ++)
	{
		for (int j = 0; j < 4; j ++)
			a[i][j] = Read();
		cnt[f[i] = Get(a[i][0], a[i][1], a[i][2], a[i][3])] ++;
	}
	for (int i = 1; i <= n; i ++)
	{
		cnt[f[i]] --;
		for (int j = i + 1; j <= n; j ++)
		{
			cnt[f[j]] --;
			for (int k = 0; k < 4; k ++)
			{
				ways = 1;
				for (int l = 0; l < 4; l ++)
				{
					tmp[l] = Get(a[i][l + 1 & 3], a[i][l], a[j][k - l + 5 & 3], a[j][k - l + 4 & 3]);
					if (!cnt[tmp[l]])
						tmp[l] = -1, ways = 0;
					else
						ways *= cnt[tmp[l]] * Get(tmp[l]), cnt[tmp[l]] --;
				}
				ans += ways;
				for (int l = 0; l < 4; l ++)
					if (~tmp[l])
						cnt[tmp[l]] ++;
			}
			cnt[f[j]] ++;
		}
		cnt[f[i]] ++;
	}
	return printf("%lld\n", ans / 3), 0;
}

Submission Info

Judge Result