Submission #1824888


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cctype>
#include <map>
#include <algorithm>
using namespace std;
typedef long long lint;
#define cout cerr
#define ni (next_num<int>())
template<class T>inline T next_num(){
	T i=0;char c;
	while(!isdigit(c=getchar())&&c!='-');
	bool flag=c=='-';
	flag?c=getchar():0;
	while(i=i*10-'0'+c,isdigit(c=getchar()));
	return flag?-i:i;
}
template<class T1,class T2>inline void apmax(T1 &a,const T2 &b){if(a<b)a=b;}
template<class T1,class T2>inline void apmin(T1 &a,const T2 &b){if(b<a)a=b;}
const int N=410;
struct Tile{
	const static int D=4;
	int a[D];
	inline bool cmp(int x,int y){
		for(int i=0;i<D;(++x)%=D,(++y)%=D,i++){
			if(a[x]!=a[y])return a[x]<a[y];
		}
		return false;
	}
	inline bool equal(int x,int y){
		for(int i=0;i<D;(++x)%=D,(++y)%=D,i++){
			if(a[x]!=a[y])return false;
		}
		return true;
	}
	inline void sani(){
		int j=0;
		for(int i=1;i<D;i++){
			if(cmp(i,j)){
				j=i;
			}
		}
		int b[D];
		memcpy(b,a,D<<2);
		for(int i=0;i<D;i++,(++j)%=D){
			a[i]=b[j];
		}
	}
	inline int getloop(){
		int cnt=0;
		for(int i=0;i<D;i++){
			cnt+=equal(0,i);
		}
		return cnt;
	}
	inline friend bool operator < (const Tile &a,const Tile &b){
		for(int i=0;i<D;i++){
			if(a.a[i]!=b.a[i])return a.a[i]<b.a[i];
		}
		return false;
	}
	inline friend bool operator == (const Tile &a,const Tile &b){
		for(int i=0;i<D;i++){
			if(a.a[i]!=b.a[i])return false;
		}
		return true;
	}
}tile[N];
map<Tile,int>m;
int main(){
	int n=ni;
	for(int i=1;i<=n;i++){
		tile[i]=(Tile){ni,ni,ni,ni};
		tile[i].sani();
		m[tile[i]]++;
	}
	lint ans=0;
	for(int i=1;i<=n;i++){
		m[tile[i]]--;
		int *a=tile[i].a;
		for(int j=i+1;j<=n;j++){
			int *b=tile[j].a;
			m[tile[j]]--;
			for(int d=0;d<4;d++){
				Tile t[4];
				for(int e=0;e<4;e++){
					t[e]=(Tile){a[e+1],a[e],b[(d+4-e)&3],b[(d+3-e)&3]};
					t[e].sani();
				}
				sort(t,t+4);
				lint tmp=1;
				int cnt[4];
				for(int e=0;e<4;e++){
					if(e&&t[e]==t[e-1]){
						cnt[e]=cnt[e-1]-1;
					}else{
						cnt[e]=m[t[e]];
					}
					tmp*=cnt[e]*t[e].getloop();
				}
				ans+=tmp;
			}
			m[tile[j]]++;
		}
	}
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Submission Time
Task E - Building Cubes with AtCoDeer
User sshockwave
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2288 Byte
Status WA
Exec Time 810 ms
Memory 82048 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 3
AC × 10
WA × 10
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt AC 77 ms 256 KB
1_004.txt AC 7 ms 256 KB
1_005.txt WA 71 ms 256 KB
1_006.txt WA 49 ms 256 KB
1_007.txt WA 90 ms 256 KB
1_008.txt WA 80 ms 256 KB
1_009.txt WA 131 ms 256 KB
1_010.txt WA 21 ms 256 KB
1_011.txt WA 193 ms 384 KB
1_012.txt AC 2 ms 384 KB
1_013.txt AC 810 ms 68608 KB
1_014.txt AC 5 ms 1024 KB
1_015.txt AC 748 ms 82048 KB
1_016.txt AC 148 ms 22144 KB
1_017.txt WA 770 ms 80128 KB
1_018.txt WA 783 ms 80000 KB
1_019.txt WA 775 ms 79104 KB