Submission #1502061
Source Code Expand
// This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template<typename T> void get_int(T &x)
{
char t=getchar();
bool neg=false;
x=0;
for(; (t>'9'||t<'0')&&t!='-'; t=getchar());
if(t=='-')neg=true,t=getchar();
for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0';
if(neg)x=-x;
}
template<typename T> void print_int(T x)
{
if(x<0)putchar('-'),x=-x;
short a[20]= {},sz=0;
while(x>0)a[sz++]=x%10,x/=10;
if(sz==0)putchar('0');
for(int i=sz-1; i>=0; i--)putchar('0'+a[i]);
}
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define get1(a) get_int(a)
#define get2(a,b) get1(a),get1(b)
#define get3(a,b,c) get1(a),get2(b,c)
#define printendl(a) print_int(a),puts("")
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
const int inf=0x3f3f3f3f;
const LL Linf=1ll<<61;
const double pi=acos(-1.0);
map<pii,int> cnt[1111][1111];
struct tile
{
int c[4];
tile(int a1,int a2,int a3,int a4){c[0]=a1;c[1]=a2;c[2]=a3;c[3]=a4;}
tile(){}
void add(int x){for(int i=0;i<4;i++)cnt[c[i]][c[i+1&3]][mp(c[i+2&3],c[i+3&3])]+=x;}
int getnum(){return cnt[c[0]][c[1]][mp(c[2],c[3])];}
tile rev()
{
tile ret;for(int i=0;i<4;i++)ret.c[i]=c[i^3];
return ret;
}
tile rotate(int x)
{
tile ret;for(int i=0;i<4;i++)ret.c[i+x&3]=c[i];
return ret;
}
tile print(){printf("tile %d %d %d %d\n",c[0],c[1],c[2],c[3]);}
}a[411],tmp[4];
LL getnum(const tile up,const tile down)
{
LL ret=1;
for(int i=0;i<4;i++)
{
tile cur(up.c[i+1&3],up.c[i],down.c[i],down.c[i+1&3]);
// cur.print();printf("num= %d\n",cur.getnum());
ret*=cur.getnum();
cur.add(-1);
}
for(int i=0;i<4;i++)
{
tile cur(up.c[i+1&3],up.c[i],down.c[i],down.c[i+1&3]);
cur.add(1);
}
return ret;
}
int n;
int main()
{
get1(n);
for(int i=1;i<=n;i++)
{
for(int j=0;j<4;j++)
get1(a[i].c[j]);
a[i].add(1);
}
LL ans=0;
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)
{
if(i==j)continue;
for(int k=0;k<4;k++)
{
a[i].add(-1);a[j].add(-1);
ans+=getnum(a[i],a[j].rev().rotate(k));
a[i].add(1);a[j].add(1);
}
}
printendl(ans/6);
return 0;
}
Submission Info
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 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 |
23 ms |
58112 KB |
0_001.txt |
AC |
22 ms |
58112 KB |
0_002.txt |
AC |
22 ms |
58112 KB |
1_003.txt |
AC |
197 ms |
58112 KB |
1_004.txt |
AC |
34 ms |
58112 KB |
1_005.txt |
AC |
280 ms |
58112 KB |
1_006.txt |
AC |
200 ms |
58112 KB |
1_007.txt |
AC |
386 ms |
58112 KB |
1_008.txt |
AC |
361 ms |
58112 KB |
1_009.txt |
AC |
810 ms |
58112 KB |
1_010.txt |
AC |
142 ms |
58112 KB |
1_011.txt |
AC |
1673 ms |
58752 KB |
1_012.txt |
AC |
31 ms |
58496 KB |
1_013.txt |
TLE |
4219 ms |
313600 KB |
1_014.txt |
AC |
45 ms |
61312 KB |
1_015.txt |
TLE |
4141 ms |
376960 KB |
1_016.txt |
AC |
867 ms |
145920 KB |
1_017.txt |
TLE |
4166 ms |
377344 KB |
1_018.txt |
TLE |
4224 ms |
376960 KB |
1_019.txt |
TLE |
4223 ms |
371328 KB |