Submission #1655108
Source Code Expand
#include<bits/stdc++.h>
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;
#define xx first
#define yy second
template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))
#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof(x.end())i=x.begin();i!=x.end();++i)
struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int &x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char &x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char *x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf &x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf &x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint &x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull &x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char *x){while(*x)P(*x++);RT}
I Fw&OP()(const char *x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;
const int N=407,M=1007;
int n,s[N][4];
ull h[N],v[N];
inline ull cal(int*s)
{
ull r=0,t;
fo0(i,4)
{
t=0;
fo0(j,4)t=t*M+s[i+j&3];
repr(r,t);
}
return r;
}
inline ull cal(int a,int b,int c,int d)
{
int t[4]={a,b,c,d};
return cal(t);
}
struct hash_table
{
static const int N=997;
ull a[N];int b[N],c[N];
inline int getpos(ull x)
{
int y=x%N;
for(;a[y]&&a[y]!=x;++y==N?y=0:0);
return y;
}
inline void insert(ull x)
{
int t=getpos(x);
if(a[t]!=x)
{
a[t]=x;
if(x%(M*M)==x/(M*M))
c[t]=x%((ll)M*M*M)==x/M?4:2;
else c[t]=1;
}
b[t]++;
//out,x,' ',t,' ',b[t],' ',c[t],'\n';
}
inline int dec(ull x)
{
int t=getpos(x);
return a[t]==x?c[t]*b[t]--:0;
}
inline void back(ull x)
{
int t=getpos(x);
if(a[t]==x)b[t]++;
}
}f;
int main()
{
in,n;
fo0(i,n)fo0(j,4)s[i][j]=(int)in+1;
fo0(i,n)f.insert(h[i]=cal(s[i]));
ll ans=0;
fo0(i,n)
{
f.dec(h[i]);
fo0(j,i)
{
f.dec(h[j]);
fo0(k,4)
{
ll ta=1;
fo0(l,4)
{
v[l]=cal(s[j][-l+1&3],s[j][-l&3],s[i][k+l+1&3],s[i][k+l&3]);
ta*=f.dec(v[l]);
//if(!ta)break;
}
ans+=ta;
//out,i,' ',j,' ',k,' ',ta,'\n';
fo0(l,4)f.back(v[l]);
}
f.back(h[j]);
}
f.back(h[i]);
}
out,ans/3,'\n';
}
Submission Info
Submission Time |
|
Task |
E - Building Cubes with AtCoDeer |
User |
mcfx |
Language |
C++14 (GCC 5.4.1) |
Score |
900 |
Code Size |
4567 Byte |
Status |
AC |
Exec Time |
64 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
900 / 900 |
Status |
|
|
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 |
44 ms |
256 KB |
1_004.txt |
AC |
4 ms |
256 KB |
1_005.txt |
AC |
44 ms |
256 KB |
1_006.txt |
AC |
32 ms |
256 KB |
1_007.txt |
AC |
44 ms |
256 KB |
1_008.txt |
AC |
39 ms |
256 KB |
1_009.txt |
AC |
46 ms |
256 KB |
1_010.txt |
AC |
8 ms |
256 KB |
1_011.txt |
AC |
64 ms |
256 KB |
1_012.txt |
AC |
1 ms |
256 KB |
1_013.txt |
AC |
60 ms |
256 KB |
1_014.txt |
AC |
2 ms |
256 KB |
1_015.txt |
AC |
60 ms |
256 KB |
1_016.txt |
AC |
14 ms |
256 KB |
1_017.txt |
AC |
59 ms |
256 KB |
1_018.txt |
AC |
57 ms |
256 KB |
1_019.txt |
AC |
59 ms |
256 KB |