#define USECHRONO
#undef HAVE_MPI

#include "eval.hpp"
#include <cassert>
#include <climits>
#include <cstdlib>
#include <stack>
#include <unistd.h>

#include <algorithm>
using namespace aed;
using namespace std;

//---:---<*>---:---<*>- COMIENZA CODIGO FUNCION --:---<*>---:---<*>---:---<*>
// COMPLETAR DNI y NOMBRE AQUI:
// Nombre:Fontana Juan Pablo
int DNI=42002929;

void compute_invariants(map<int,set<int>> &G,vector<int> &Z){
  //inicializo el vector de invalencias
  auto itM=G.begin();
  while(itM!=G.end()){
    Z.push_back(1);
    ++itM;
  }
 
  //armar ztmp como ztmp[i]=suma de sus vecinos
  for(int i=0;i<6;i++){
    vector<int> ztmp;
    ztmp.clear();
    itM=G.begin();
    while(itM!=G.end()){
      int r=0;
      set<int> aux=itM->second;
      set<int>::iterator itAux=aux.begin();
      while(itAux!=aux.end()){
        r+=(Z[*itAux])*(Z[*itAux])*(Z[*itAux]);
        ++itAux;
      }
      r=r%1000;
      ztmp.push_back(r);
      ++itM;
    }
    Z=ztmp;
  }
  sort(Z.begin(),Z.end());
}
//---:---<*>---:---<*>---:---<*>---:---<*>---:---<*>
bool isomorph(map<int,set<int>> &G1,map<int,set<int>> &G2) {
  vector<int> Z1;
  vector<int> Z2;
  compute_invariants(G1,Z1);
  compute_invariants(G2,Z2);
  return(Z1==Z2);
}

int main() {
  Eval ev;
  int vrbs = 0;
  ev.eval<1>(isomorph,vrbs);
  return 0;
}