Problem p00826 (C++) — buggy submission, verdict: Memory Limit Exceeded

#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define pi M_PI
#define inf 1 << 30
#define eps (1e-7)
#define MAX 20000
#define equals(a, b) (fabs((a) - (b)) < eps)
using namespace std;

class Point {
public:
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}

  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double k) { return Point(x * k, y * k); }
  Point operator/(double k) { return Point(x / k, y / k); }
  bool operator<(Point p) const { return (x != p.x ? x < p.x : y < p.y); }
  bool operator==(Point p) const {
    return fabs(x - p.x) < eps && fabs(y - p.y) < eps;
  }

  double abs() { return sqrt(norm()); }
  double norm() { return (x * x + y * y); }
};
typedef Point Vector;
typedef vector<Point> Polygon;

class Segment {
public:
  Point p1, p2;
  Segment(Point p1 = Point(), Point p2 = Point()) : p1(p1), p2(p2) {}
};
typedef Segment Line;

double norm(Vector a) { return (a.x * a.x + a.y * a.y); }
double abs(Vector a) { return sqrt(norm(a)); }
double dot(Vector a, Vector b) { return (a.x * b.x + a.y * b.y); }
double cross(Vector a, Vector b) { return (a.x * b.y - a.y * b.x); }

int ccw(Point p0, Point p1, Point p2) {
  Vector a = p1 - p0;
  Vector b = p2 - p0;
  if (cross(a, b) > eps)
    return 1;
  if (cross(a, b) < -eps)
    return -1;
  if (dot(a, b) < -eps)
    return 2;
  if (a.norm() < b.norm())
    return -2;
  return 0;
}

bool intersect(Point p1, Point p2, Point p3, Point p4) {
  return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
          ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}

bool intersect(Segment s1, Segment s2) {
  return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}

Point getCrossPointLL(Line a, Line b) {
  double A = cross(a.p2 - a.p1, b.p2 - b.p1);
  double B = cross(a.p2 - a.p1, a.p2 - b.p1);
  if (abs(A) < eps || abs(B) < eps)
    return b.p1;
  return b.p1 + (b.p2 - b.p1) * (B / A);
}

int contains(Polygon g, Point p) {
  int n = g.size();
  bool x = false;
  for (int i = 0; i < n; i++) {
    Vector a = g[i] - p, b = g[(i + 1) % n] - p;
    if (abs(cross(a, b)) < eps && dot(a, b) < eps)
      return 1;
    if (a.y > b.y)
      swap(a, b);
    if (a.y < eps && eps < b.y && cross(a, b) > eps)
      x = !x;
  }
  if (x)
    return 2;
  return 0;
}

typedef vector<vector<int>> Graph;

Graph SegmentArrangement(vector<Segment> v, vector<Point> &ps) {
  for (int i = 0; i < v.size(); i++) {
    ps.push_back(v[i].p1);
    ps.push_back(v[i].p2);
    for (int j = i + 1; j < v.size(); j++) {
      if (intersect(v[i], v[j]))
        ps.push_back(getCrossPointLL(v[i], v[j]));
    }
  }
  sort(ps.begin(), ps.end());
  ps.erase(unique(ps.begin(), ps.end()), ps.end());
  Graph g(ps.size());
  for (int i = 0; i < v.size(); i++) {
    vector<pair<double, int>> list;
    for (int j = 0; j < ps.size(); j++)
      if (ccw(v[i].p1, v[i].p2, ps[j]) == 0)
        list.push_back(mp(norm(v[i].p1 - ps[j]), j));
    sort(list.begin(), list.end());
    for (int j = 0; j < list.size() - 1; j++) {
      int a = list[j].s, b = list[j + 1].s;
      g[a].push_back(b);
      g[b].push_back(a);
    }
  }
  return g;
}

Graph e;
Polygon p;
vector<Point> vp;
int start = -1;

double getAngle(Vector a, Vector b) {
  double tmp = dot(a, b) / (abs(a) * abs(b));
  if (tmp < -1.0)
    tmp = -1.0;
  if (1.0 < tmp)
    tmp = 1.0;
  double r = acos(tmp) * 180.0 / pi;
  if (cross(a, b) < -eps)
    r = 360.0 - r;
  return r;
}

void rec(int now, int before) {
  if (now == start)
    return;
  pair<double, int> pdi(inf, -1);
  for (int i = 0; i < e[now].size(); i++) {
    int next = e[now][i];
    double ang = getAngle(vp[before] - vp[now], vp[next] - vp[now]);
    if (next == before)
      ang = 361;
    pdi = min(pdi, mp(ang, next));
  }
  p.push_back(vp[now]);
  rec(pdi.s, now);
  return;
}

int main() {
  int n;

  while (1) {
    cin >> n;
    if (n == 0)
      break;
    vector<Segment> v;
    for (int i = 0; i < n; i++) {
      int a, b, c, d;
      cin >> a >> b >> c >> d;
      v.push_back(Segment(Point(a, b), Point(c, d)));
    }
    vp.clear();
    e = SegmentArrangement(v, vp);
    Point s(inf, inf);
    for (int i = 0; i < vp.size(); i++)
      s = min(s, vp[i]);
    for (int i = 0; i < vp.size(); i++)
      if (vp[i] == s)
        start = i;
    string ans = "no";
    for (int i = 0; i < e[start].size(); i++) {
      p.clear();
      p.push_back(vp[start]);
      rec(e[start][i], start);
      if (contains(p, Point(0, 0)) == 2)
        ans = "yes";
    }
    cout << ans << endl;
  }
  return 0;
}

Error: MLE

Fixed submission:

#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define pi M_PI
#define inf 1 << 30
#define eps (1e-5)
#define MAX 10000
#define equals(a, b) (fabs((a) - (b)) < eps)
using namespace std;

class Point {
public:
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}

  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double k) { return Point(x * k, y * k); }
  Point operator/(double k) { return Point(x / k, y / k); }
  bool operator<(Point p) const { return (x != p.x ? x < p.x : y < p.y); }
  bool operator==(Point p) const {
    return fabs(x - p.x) < eps && fabs(y - p.y) < eps;
  }

  double abs() { return sqrt(norm()); }
  double norm() { return (x * x + y * y); }
};
typedef Point Vector;
typedef vector<Point> Polygon;

class Segment {
public:
  Point p1, p2;
  Segment(Point p1 = Point(), Point p2 = Point()) : p1(p1), p2(p2) {}
};
typedef Segment Line;

double norm(Vector a) { return (a.x * a.x + a.y * a.y); }
double abs(Vector a) { return sqrt(norm(a)); }
double dot(Vector a, Vector b) { return (a.x * b.x + a.y * b.y); }
double cross(Vector a, Vector b) { return (a.x * b.y - a.y * b.x); }

int ccw(Point p0, Point p1, Point p2) {
  Vector a = p1 - p0;
  Vector b = p2 - p0;
  if (cross(a, b) > eps)
    return 1;
  if (cross(a, b) < -eps)
    return -1;
  if (dot(a, b) < -eps)
    return 2;
  if (a.norm() < b.norm())
    return -2;
  return 0;
}

bool intersect(Point p1, Point p2, Point p3, Point p4) {
  return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
          ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}

bool intersect(Segment s1, Segment s2) {
  return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}

Point getCrossPointLL(Line a, Line b) {
  double A = cross(a.p2 - a.p1, b.p2 - b.p1);
  double B = cross(a.p2 - a.p1, a.p2 - b.p1);
  if (abs(A) < eps || abs(B) < eps)
    return b.p1;
  return b.p1 + (b.p2 - b.p1) * (B / A);
}

int contains(Polygon g, Point p) {
  int n = g.size();
  bool x = false;
  for (int i = 0; i < n; i++) {
    Vector a = g[i] - p, b = g[(i + 1) % n] - p;
    if (abs(cross(a, b)) < eps && dot(a, b) < eps)
      return 1;
    if (a.y > b.y)
      swap(a, b);
    if (a.y < eps && eps < b.y && cross(a, b) > eps)
      x = !x;
  }
  if (x)
    return 2;
  return 0;
}

typedef vector<vector<int>> Graph;

Graph SegmentArrangement(vector<Segment> v, vector<Point> &ps) {
  for (int i = 0; i < v.size(); i++) {
    ps.push_back(v[i].p1);
    ps.push_back(v[i].p2);
    for (int j = i + 1; j < v.size(); j++) {
      if (intersect(v[i], v[j]))
        ps.push_back(getCrossPointLL(v[i], v[j]));
    }
  }
  sort(ps.begin(), ps.end());
  ps.erase(unique(ps.begin(), ps.end()), ps.end());
  Graph g(ps.size());
  for (int i = 0; i < v.size(); i++) {
    vector<pair<double, int>> list;
    for (int j = 0; j < ps.size(); j++)
      if (ccw(v[i].p1, v[i].p2, ps[j]) == 0)
        list.push_back(mp(norm(v[i].p1 - ps[j]), j));
    sort(list.begin(), list.end());
    for (int j = 0; j < list.size() - 1; j++) {
      int a = list[j].s, b = list[j + 1].s;
      g[a].push_back(b);
      g[b].push_back(a);
    }
  }
  return g;
}

Graph e;
Polygon p;
vector<Point> vp;
int start = -1;

double getAngle(Vector a, Vector b) {
  double tmp = dot(a, b) / (abs(a) * abs(b));
  if (tmp < -1.0)
    tmp = -1.0;
  if (1.0 < tmp)
    tmp = 1.0;
  double r = acos(tmp) * 180.0 / pi;
  if (cross(a, b) < -eps)
    r = 360.0 - r;
  return r;
}

void rec(int now, int before) {
  if (now == start)
    return;
  pair<double, int> pdi(inf, -1);
  for (int i = 0; i < e[now].size(); i++) {
    int next = e[now][i];
    double ang = getAngle(vp[before] - vp[now], vp[next] - vp[now]);
    if (next == before)
      ang = 361;
    pdi = min(pdi, mp(ang, next));
  }
  p.push_back(vp[now]);
  rec(pdi.s, now);
  return;
}

int main() {
  int n;

  while (1) {
    cin >> n;
    if (n == 0)
      break;
    vector<Segment> v;
    for (int i = 0; i < n; i++) {
      int a, b, c, d;
      cin >> a >> b >> c >> d;
      v.push_back(Segment(Point(a, b), Point(c, d)));
    }
    vp.clear();
    e = SegmentArrangement(v, vp);
    Point s(inf, inf);
    for (int i = 0; i < vp.size(); i++)
      s = min(s, vp[i]);
    for (int i = 0; i < vp.size(); i++)
      if (vp[i] == s)
        start = i;
    string ans = "no";
    for (int i = 0; i < e[start].size(); i++) {
      p.clear();
      p.push_back(vp[start]);
      rec(e[start][i], start);
      if (contains(p, Point(0, 0)) == 2)
        ans = "yes";
    }
    cout << ans << endl;
  }
  return 0;
}