#include <iostream>
#include <vector>
#include <list>
#include <eigen3/Eigen/Dense>

#include "pcg-cpp/include/pcg_random.hpp"
#include "randutils/randutils.hpp"

using Rng = randutils::random_generator<pcg32>;

template<int D> using Vector = Eigen::Matrix<int, D, 1>;
template<int D> using Matrix = Eigen::Matrix<int, D, D>;

int iPow(int x, unsigned p) {
  if (p == 0) return 1;
  if (p == 1) return x;

  int tmp = iPow(x, p / 2);
  if (p % 2 == 0) return tmp * tmp;
  else return x * tmp * tmp;
}

unsigned mod(signed a, unsigned b) {
  return ((a %= b) < 0) ? a + b : a;
}

template<unsigned D> class State {
  public:
    Vector<D> σ;

    State(unsigned a, signed b) : σ(Vector<D>::Zero()) {
      σ[a] = b;
    }

    State() : σ(Vector<D>::Zero()) {}

    bool isEmpty() const {
      return σ.squaredNorm() == 0;
    }

    void remove() {
      σ = Vector<D>::Zero();
    }

    State<D> apply(const Matrix<D>& m) const {
      return {m * σ};
    }
};

template<unsigned D> State<D> randomState(Rng& r) {
  return State<D>(r.uniform((unsigned)0, D - 1), r.pick({-1, 1}));
}

template<unsigned D> class HalfEdge;

template<unsigned D> class Vertex {
  public:
    Vector<D> position;
    State<D> state;
    std::vector<HalfEdge<D>> adjacentEdges;
    bool marked;

    bool isEmpty() const {
      return state.isEmpty();
    }
};

template<unsigned D> class HalfEdge {
  public:
    Vertex<D>& neighbor;
    Vector<D> Δx;

    HalfEdge(Vertex<D>& n, const Vector<D>& d) : neighbor(n), Δx(d) {}
};

template<unsigned D> class System {
  public:
    const unsigned L;
    unsigned N;
    std::vector<Vertex<D>> vertices;

    unsigned vectorToIndex(const Vector<D>& x) const {
      unsigned i = 0;
      for (unsigned d = 0; d < D; d++) {
        i += x[d] * iPow(L, d);
      }
      return i;
    }

    Vector<D> indexToVector(unsigned i) const {
      Vector<D> x;
      for (unsigned d = 0; d < D; d++) {
        x[d] = (i / iPow(L, d)) % L;
      }
      return x;
    }

    System(unsigned L) : L(L), N(0), vertices(iPow(L, D)) {
      for (unsigned i = 0; i < iPow(L, D); i++) {
        vertices[i].position = indexToVector(i);
        vertices[i].adjacentEdges.reserve(2 * D);
      }

      for (unsigned d = 0; d < D; d++) {
        Vector<D> Δx = Vector<D>::Zero();
        Δx[d] = 1;
        for (signed i = 0; i < iPow(L, D); i++) {
          unsigned j = iPow(L, d + 1) * (i / iPow(L, d + 1)) + mod(i + iPow(L, d), pow(L, d + 1));
          vertices[i].adjacentEdges.push_back(HalfEdge<D>(vertices[j], Δx));
          vertices[j].adjacentEdges.push_back(HalfEdge<D>(vertices[i], -Δx));
        }
      }
    }

    std::list<std::reference_wrapper<Vertex<D>>> overlaps(Vertex<D>& v, const State<D>& s, bool excludeSelf = false) {
      std::list<std::reference_wrapper<Vertex<D>>> o;

      if (s.isEmpty()) {
        return o;
      }

      if (!v.isEmpty() && !excludeSelf) {
        o.push_back(v);
      }

      for (const HalfEdge<D>& e : v.adjacentEdges) {
        if (!e.neighbor.isEmpty()) {
          if (s.σ.dot(e.Δx) == 1 || e.neighbor.state.σ.dot(e.Δx) == -1) {
            o.push_back(e.neighbor);
          } 
        }
      }

      return o;
    }

    bool tryInsertion(Vertex<D>& v, const State<D>& s) {
      if (overlaps(v, s).empty()) {
        v.state = s;
        N++;
        return true;
      } else {
        return false;
      }
    }

    bool tryDeletion(Vertex<D>& v) {
      if (v.isEmpty()) {
        return false;
      } else {
        v.state.remove();
        N--;
        return true;
      }
    }

    bool tryRandomMove(Rng& r) {
      Vertex<D>& v = r.pick(vertices);
      State<D> oldState = v.state;
      if (!tryDeletion(v)) {
        return false;
      }

      if (0.2 > r.uniform(0.0, 1.0)) {
        if (tryInsertion(v, randomState<D>(r))) {
          return true;
        }
      } else {
        if (tryInsertion(r.pick(v.adjacentEdges).neighbor, randomState<D>(r))) {
          return true;
        }
      }
      v.state = oldState;
      N++;
      return false;
    }

    bool trySwap(Vertex<D>& v1, Vertex<D>& v2) {
      if (overlaps(v1, v2.state, true).size() == 0 && overlaps(v2, v1.state, true).size() == 0) {
        std::swap(v1.state, v2.state);
        return true;
      } else {
        return false;
      }
    }

    bool tryRandomSwap(Rng& r) {
      Vertex<D>& v1 = r.pick(vertices);
      Vertex<D>& v2 = r.pick(vertices);

      return trySwap(v1, v2);
    }

    void setGroundState() {
      N = 0;

      for (Vertex<D>& v : vertices) {
        unsigned a = 0;
        for (unsigned d = 0; d < D; d++) {
          a += (d + 1) * v.position(d);
        }
        a %= 2 * D + 1;

        v.state.σ = Vector<D>::Zero();

        if (0 < a && a <= D) {
          v.state.σ(a - 1) = -1;
          N++;
        } else if (D < a) {
          v.state.σ(2 * D - a) = 1;
          N++;
        }
      }
    }

    bool compatible() {
      for (Vertex<D>& v : vertices) {
        if (overlaps(v, v.state, true).size() > 0) {
          return false;
        }
      }

      return true;
    }

    double density() const {
      return N / pow(L, D);
    }

    unsigned maxOccupation() const {
//      return (2 * D * iPow(L, D)) / (2 * D + 1);
      return iPow(L, D);
    }

    void sweepGrandCanonical(double z, Rng& r) {
      for (unsigned i = 0; i < iPow(L, D); i++) {
        if (0.5 < r.uniform(0.0, 1.0)) {
          double pIns = maxOccupation() * z / (N + 1);

          if (pIns > r.uniform(0.0, 1.0)) {
            while (true) {
              Vertex<D>& v = r.pick(vertices);
              if (v.isEmpty()) {
                tryInsertion(v, randomState<D>(r));
                break;
              }
            }
          }
        } else {

          double pDel = N / (z * maxOccupation());

          if (pDel > r.uniform(0.0, 1.0)) {
            tryDeletion(r.pick(vertices));
          }
        }

        tryRandomMove(r);
        tryRandomSwap(r);
      }
    }

    void sweepLocal(double z, Rng& r) {
      for (unsigned i = 0; i < iPow(L, D); i++) {
        tryRandomMove(r);
      }
    }

    void sweepSwap(double z, Rng& r) {
      for (unsigned i = 0; i < iPow(L, D); i++) {
        tryRandomSwap(r);
      }
    }

    void flipCluster(const Matrix<D>& R, Vertex<D>& v0, Rng& r, bool dry = false) {
      std::list<std::reference_wrapper<Vertex<D>>> q = {v0};

      while (!q.empty()) {
        Vertex<D>& v = q.front();
        q.pop_front();

        Vector<D> xNew = R * v.position;
        State<D> sNew = v.state.apply(R);

        for (Vertex<D>& vn : overlaps(vertices[vectorToIndex(xNew)], sNew)) {
          if (!vn.marked) {
            vn.marked = true;
            q.push_back(vn);
          }
        }
      }
    }
};

template<unsigned D> Vector<D> randomVector(unsigned L, Rng& r) {
  Vector<D> x;
  for (unsigned i = 0; i < D; i++) {
    x[i] = r.uniform((unsigned)0, L - 1);
  }
  return x;
}

int main() {
  const unsigned D = 3;
  unsigned L = 28;
  unsigned Nmin = 2e2;
  unsigned Nmax = 2e5;
  double Tmin = 0.04;
  double Tmax = 0.2;
  double δT = 0.02;

  System<D> s(L);

  Rng r;

  for (unsigned N = Nmin; N <= Nmax; N *= 10) {
    s.setGroundState();
    for (double T = Tmin; T < Tmax; T *= 1 + δT) {
      double z = exp(1 / T);

      for (unsigned n = 0; n < N; n++) {
        s.sweepGrandCanonical(z, r);
      }

      std::cout << L << " " << T << " " << N << " " << δT << " " << 1 / s.density() << std::endl;
    }

    for (double T = Tmax; T > Tmin; T /= 1 + δT) {
      double z = exp(1 / T);

      for (unsigned n = 0; n < N; n++) {
        s.sweepGrandCanonical(z, r);
      }

      std::cout << L << " " << T << " " << N << " " << δT << " " << 1 / s.density() << std::endl;
    }
  }

  return 0;
}