#include <cfloat>
#include <iostream>
#include <math.h>

using namespace std;

struct Vector2d {
  double x, y;
  Vector2d(double a, double b) : x(a), y(b) {}
  Vector2d() : x(.0), y(.0) {}
  Vector2d operator+(Vector2d v) const { return Vector2d(v.x + x, v.y + y); }
  Vector2d operator-(Vector2d v) const { return Vector2d(x - v.x, y - v.y); }
  Vector2d operator-(double a) const { return Vector2d(x - a, y - a); }
  Vector2d operator+(double a) const { return Vector2d(x + a, y + a); }
  Vector2d operator/(double a) const { return Vector2d(x / a, y / a); }
  Vector2d operator*(double a) const { return Vector2d(x * a, y * a); }
  Vector2d operator+=(const Vector2d &v) {
    *this = *this + v;
    return *this;
  }
  double norm() { return sqrt(x * x + y * y); }
  double dot(Vector2d v) { return x * v.x + y * v.y; }
  void reset() {
    x = 0;
    y = 0;
  }
};

struct Sidewalk{
  int row, col;
  double length, width;
  Sidewalk(int r, int c, double l, double w) : row(r), col(c), length(l), width(w) {}
};

struct Cell{
  // TODO: cell stores information such as next neighbor
};

// Numer of pedestrians
// $n_p$
const int n_p = 100;

// Number of iterations
// $n_{iter}$
const int n_iter = 100;

// TODO: Change this
// $\tau$
const double tau = 0.12345;

// F_i is the current position resp. direction vector of pedestrian p in time i?
void compute_acceleration_term(Vector2d *F_i, Vector2d curr, Vector2d next) {
  // get curr pos --> probably no needed, can be read in F_i

  // get next pos --> call shortest path --> how to encode map?

  // get desired velocity
  // desired speed * desired direction

  // get actual velocity
  // actual speed * actual direction

  // TODO: how to get next node?

  // acceleration * desired speed
  double v_desired = 0.0;

  double v_actual = 0.0;

  double res = (1 / tau) * (v_desired - v_actual);


}

Vector2d get_next_node(Vector2d curr_pos, Vector2d map[]) {
  // dummy element
  return Vector2d(curr_pos.x + 1.0, curr_pos.y + 1.0);
}

// return the direction between two nodes along the shortest path
Vector2d get_direction(Vector2d curr_pos, Vector2d next_pos) {
  double x, y, x1, x2, y1, y2;
  
  x1 = curr_pos.x;
  x2 = next_pos.x;
  y1 = curr_pos.y;
  y2 = next_pos.y;

  x = (x2 - x1) / abs(x2 - x1);
  y = (y2 - y1) / abs(y2 - y1);

  return Vector2d(x, y);
}


void compute_repulsive_effects_from_pedestrians(Vector2d *F_i) {

}

void compute_repulsive_effects_from_borders(Vector2d *F_i) {

}

// Return an array of doubles
double *w(Vector2d e, Vector2d f) {

  // TODO:
  // $cos(60\degree)$
  // if (e * f > f.norm() * (0.5)) {
  // }
  // return 0;
}

int main() {

  // ! DONT TOUCH

  // $\vec{v}^0_i$
  // Velocity at iteration $t$ for pedestrian $i$
  double v[n_iter][n_p];

  // $\vec{r}^0_i$
  // Intended destination at iteration $t$ for pedestrian $i$
  Vector2d r[n_iter][n_p];

  // $\vec{e}_i$
  // Desired direction to the next way point at iteration $t$ for pedestrian $i$
  Vector2d e[n_iter][n_p];

  // $v_i^{max}$
  // Maximum allowed speed for pedestrian $i$
  double v_max[n_p];

  // $v_i^{0}$
  // Desired speed for pedestrian $i$
  double v_0[n_p];

  // $\vec{F}_i$
  // Total social force for pedestrian $i$
  Vector2d F[n_p][n_p];

  // $\vec{r}_0$
  // Desired destination of pedestrian $n_p$
  Vector2d r_0[n_p];

  for (int t = 0; t < n_iter; t++) {
    for (int i = 0; i < n_p; i++) {
      for (int itr = 0; itr < n_p; itr++) {
        F[i][itr].reset();
      }
      compute_acceleration_term(F[i]);
      compute_repulsive_effects_from_pedestrians(F[i]);
      compute_repulsive_effects_from_borders(F[i]);

      // TODO: Update $\vec{w}_i$

      // TODO: Update $\vec{v}_i^{t+1}$

      // TODO: pdate $\vec{r}_i^{t+1}$
    }
  }

  return 0;
}