Submission #1653580

---

Source Code Expand

#include<bits/stdc++.h>
#define ll long long
#define inf 1000000000000000000ll
#define N 409
using namespace std;

int n,a[N][4]; ll ans,sum,p[N],q[4];
struct hsh{
	int tot,fst[20000003],sz[N],tp[N],nxt[N]; ll pnt[N];
	void ins(ll x,int y){
		int i,z=x%20000003;
		for (i=fst[z]; i; i=nxt[i]) if (pnt[i]==x){
			sz[i]+=y; return;
		}
		pnt[++tot]=x; sz[tot]=y;
		if ((x>>20)==(x&(1<<20)-1))
			tp[tot]=((x>>30)==(x&(1<<10)-1)?4:2);
		else tp[tot]=1;
		nxt[tot]=fst[z]; fst[z]=tot;
	}
	void solve(ll &x){
		int i,z=x%20000003;
		for (i=fst[z]; i; i=nxt[i]) if (pnt[i]==x){
			sum*=tp[i]*(sz[i]--);
			return;
		}
		x=-1; sum=0;
	}
}hsh;
ll calc(int x1,int x2,int x3,int x4){
	int num[4]={x1,x2,x3,x4},i,j; ll tmp,mn=inf;
	for (i=0; i<4; i++){
		for (j=0,tmp=0; j<4; j++) tmp=tmp<<10|num[(i+j)&3];
		mn=min(mn,tmp);
	}
	return mn;
}
int main(){
	scanf("%d",&n);
	int i,j,k,l;
	for (i=1; i<=n; i++){
		for (j=0; j<4; j++) scanf("%d",&a[i][j]);
		p[i]=calc(a[i][0],a[i][1],a[i][2],a[i][3]);
		hsh.ins(p[i],1);
	}
	for (i=1; i<n; i++){
		hsh.ins(p[i],-1);
		for (j=i+1; j<=n; j++){
			hsh.ins(p[j],-1);
			for (k=0; k<4; k++){
				for (l=0,sum=1; l<4; l++){
					q[l]=calc(a[i][(l+1)&3],a[i][l],a[j][(k-l+5)&3],a[j][(k-l+4)&3]);
					hsh.solve(q[l]);
				}
				ans+=sum;
				for (l=0; l<4; l++) if (q[l]!=-1) hsh.ins(q[l],1);
			}
			hsh.ins(p[j],1);
		}
		hsh.ins(p[i],1);
	}
	printf("%lld\n",ans/3);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:39:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:42:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   for (j=0; j<4; j++) scanf("%d",&a[i][j]);
                                           ^

Judge Result