Problem p02679 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>

using namespace std;
#define int long long

#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()

template <typename T> void DEBUG(T e) {
  if (DEBUG_OUT == false)
    return;
  std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
  if (DEBUG_OUT == false)
    return;
  for (const auto &e : v) {
    std::cout << e << " ";
  }
  std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
  if (DEBUG_OUT == false)
    return;
  for (const auto &v : vv) {
    DEBUG(v);
  }
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
  if (DEBUG_OUT == false)
    return;
  DEBUG(d);
  DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
  if (flg) {
    cout << hoge << endl;
    abort();
  }
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}
// SOLVE

struct mint {
  int x; // typedef long long int;
  mint(int x = 0) : x((x % MOD + MOD) % MOD) {}
  mint &operator+=(const mint a) {
    if ((x += a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += MOD - a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(int t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime MOD
  mint inv() const { return pow(MOD - 2); }
  mint &operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
};

const int MAX = 510000;

long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}

int COM(int n, int k) {
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int PERM(int n, int k) {
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[n - k] % MOD) % MOD;
}

int MCOM(int n, int k) {
  // n個のものから重複を許してr個選ぶ。
  // Choose R from N types of things, allowing for duplication.
  return COM(n + k - 1, k);
}
// solve

int gcd(int a, int b) {
  if (a % b == 0) {
    return (b);
  } else {
    return (gcd(b, a % b));
  }
}

void solve(void) {
  int N;
  cin >> N;
  // vector<pair<int,int> > vp;
  map<pair<int, int>, int> mp;
  int ZA = 0, ZB = 0;
  int ZC = 0;
  for (int i = 0; i < N; i++) {
    int A, B;
    cin >> A >> B;
    if (A == 0 && B == 0) {
      ZC++;
      continue;
    }
    if (A == 0 && B != 0) {
      ZA++;
      continue;
    }
    if (A != 0 && B == 0) {
      ZB++;
      continue;
    }
    int G = 1;
    G = gcd(abs(A), abs(B));

    if (A < 0 && B < 0)
      A *= -1, B *= -1;
    else if (A < 0 && B > 0)
      A *= -1, B *= -1;
    mp[make_pair(A / G, B / G)]++;
  }

  mint ANS = 1;
  for (auto &&x : mp) {
    mint C = 1;
    if (x.second == 0)
      continue;
    int cp1, cp2;
    cp1 = x.first.second;
    cp2 = x.first.first * -1;
    if (cp1 < 0 && cp2 < 0)
      cp1 *= -1, cp2 *= -1;
    int p1 = x.second;
    int p2 = mp[make_pair(cp1, cp2)];
    mint c1 = 0, c2 = 0;
    if (p1 > 0) {
      mint t = 2;
      c1 = t.pow(p1).x - 1;
    }
    if (p2 > 0) {
      mint t = 2;
      c2 = t.pow(p2).x - 1;
    }
    C += c1 + c2;

    // DEBUG(C,x.first.first,x.first.second,"C",
    // mp[make_pair(cp1,cp2)],cp1,cp2,"\\n");
    ANS *= C;
    mp[x.first] = 0;
    mp[make_pair(cp1, cp2)] = 0;
  }
  mint Z1 = 0, Z2 = 0;
  if (ZA > 0) {
    mint d = 2;
    Z1 = d.pow(ZA) - 1;
  }
  if (ZB > 0) {
    mint d = 2;
    Z2 = d.pow(ZB) - 1;
  }
  ANS *= 1 + Z1.x + Z2.x;

  ANS += ZC;
  ANS -= 1;
  cout << ANS.x << endl;

  return;
}

int32_t main(int32_t argc, const char *argv[]) {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cout << std::fixed;
  std::cout << std::setprecision(11);
  solve();

  return 0;
}


Error: 0

Fixed submission:

#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>

using namespace std;
#define int long long

#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()

template <typename T> void DEBUG(T e) {
  if (DEBUG_OUT == false)
    return;
  std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
  if (DEBUG_OUT == false)
    return;
  for (const auto &e : v) {
    std::cout << e << " ";
  }
  std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
  if (DEBUG_OUT == false)
    return;
  for (const auto &v : vv) {
    DEBUG(v);
  }
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
  if (DEBUG_OUT == false)
    return;
  DEBUG(d);
  DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
  if (flg) {
    cout << hoge << endl;
    abort();
  }
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}
// SOLVE

struct mint {
  int x; // typedef long long int;
  mint(int x = 0) : x((x % MOD + MOD) % MOD) {}
  mint &operator+=(const mint a) {
    if ((x += a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += MOD - a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(int t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime MOD
  mint inv() const { return pow(MOD - 2); }
  mint &operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
};

const int MAX = 510000;

long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}

int COM(int n, int k) {
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int PERM(int n, int k) {
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[n - k] % MOD) % MOD;
}

int MCOM(int n, int k) {
  // n個のものから重複を許してr個選ぶ。
  // Choose R from N types of things, allowing for duplication.
  return COM(n + k - 1, k);
}
// solve

int gcd(int a, int b) {
  if (a % b == 0) {
    return (b);
  } else {
    return (gcd(b, a % b));
  }
}

void solve(void) {
  int N;
  cin >> N;
  // vector<pair<int,int> > vp;
  map<pair<int, int>, int> mp;
  int ZA = 0, ZB = 0;
  for (int i = 0; i < N; i++) {
    int A, B;
    cin >> A >> B;
    int G = 1;
    if (A != 0 || B != 0)
      G = gcd(abs(A), abs(B));

    if (A == 0 && B != 0) {
      ZA++;
      continue;
    }
    if (A != 0 && B == 0) {
      ZB++;
      continue;
    }
    if (A == 0 && B == 0)
      continue;

    if (A < 0 && B < 0)
      A *= -1, B *= -1;
    else if (A < 0 && B > 0)
      A *= -1, B *= -1;
    mp[make_pair(A / G, B / G)]++;
  }

  mint ANS = 1;
  for (auto &&x : mp) {
    int C = 1;
    if (x.second == 0)
      continue;
    int cp1, cp2;
    cp1 = x.first.second;
    cp2 = x.first.first * -1;
    if (cp1 < 0 && cp2 < 0)
      cp1 *= -1, cp2 *= -1;
    int p1 = x.second;
    int p2 = mp[make_pair(cp1, cp2)];
    int c1 = 0, c2 = 0;
    if (p1 > 0) {
      mint t = 2;
      c1 = t.pow(p1).x - 1;
    }
    if (p2 > 0) {
      mint t = 2;
      c2 = t.pow(p2).x - 1;
    }
    C += c1 + c2;

    // DEBUG(C,x.first.first,x.first.second,"C",
    // mp[make_pair(cp1,cp2)],cp1,cp2,"\\n");
    ANS *= C;
    mp[x.first] = 0;
    mp[make_pair(cp1, cp2)] = 0;
  }
  ANS *= (pow(2, ZA) - 1 + pow(2, ZB));
  cout << ANS.x - 1 << endl;

  return;
}

int32_t main(int32_t argc, const char *argv[]) {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cout << std::fixed;
  std::cout << std::setprecision(11);
  solve();

  return 0;
}