Submission #2703226

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int N;
vi a[400];
ll ans = 0;
unordered_map<ll,int> u;

ll hsh(vi v) {
    return v[0]+1000LL*v[1]+1000000LL*v[2]+1000000000LL*v[3];
}

vi rot(vi a, int b) {
    rotate(a.begin(),a.begin()+b,a.end());
    return a;
}

ll minRot(vi a) {
    ll z = 1e12;
    F0R(i,4) z = min(z,hsh(rot(a,i)));
    return z;
}

void ad(int x, int ind) {
    F0R(i,4) u[hsh(rot(a[x],i))] += ind;
}

void tri(int x, int y) {
    F0R(i,4) {
        vi t1 = a[x]; 
        vi t2 = rot(a[y],i); reverse(all(t2));
        
        ll num = 1;
        vl p;
        
        F0R(j,4) {
            vi z = {t2[j],t2[(j+1)%4],t1[(j+1)%4],t1[j]};
            ll Z = hsh(z);
            ll tnum = u[Z];
            for (auto a: p) if (a == Z) tnum --;
            num *= tnum;
            F0R(i,4) p.pb(hsh(rot(z,i)));
        }
        ans += num;
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N;
    F0R(i,N) {
        a[i].resize(4);
        F0R(j,4) cin >> a[i][j];
        ad(i,1);
    }
    F0R(i,N) {
        ad(i,-1);
        FOR(j,i+1,N) {
            ad(j,-1);
            tri(i,j);
            ad(j,1);
        }
    }
    cout << ans;
}

// read the question correctly (is y a vowel? what are the exact constraints?)
// look out for SPECIAL CASES (n=1?) and overflow (ll vs int?) ARRAY OUT OF BOUNDSS

Submission Info

Judge Result