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

#include <algorithm>
#include <complex>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define rRep(i, a, b) for (ll i = b - 1; i >= a; i--)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N)                                                      \\
  sort(A, A + N,                                                               \\
       [](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define debug(v)                                                               \\
  cout << #v << ":";                                                           \\
  for (auto x : v) {                                                           \\
    cout << x << ' ';                                                          \\
  }                                                                            \\
  cout << endl;
#define endl '\\n'
int ctoi(const char c) {
  if ('0' <= c && c <= '9')
    return (c - '0');
  return -1;
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll MOD = 1000000007;
constexpr ll INF = 1000000011;
constexpr ll MOD2 = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-8;
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &&x : v)
    is >> x;
  return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first;
  is >> p.second;
  return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
  os << p.first << ' ' << p.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i) {
    if (i != begin(v))
      os << ' ';
    os << *i;
  }
  return os;
}

ll N;
ll A, B;
map<pair<ll, ll>, ll> M, C;

ll cme;

ll modpow(ll b, ll e, ll m) { // bのe乗のmod m を返す
  if (e == 0)
    return 1;
  cme = modpow(b, e / 2, m);
  cme = (cme * cme) % m;
  if (e % 2 == 1)
    cme = (cme * b) % m;
  return cme;
}

ll R, L, Q;

int main() {
  cin >> N;
  rep(i, N) {
    ll A, B;
    cin >> A >> B;
    if (A == 0 && B == 0) {
      Q++;
      continue;
    } else if (A == 0) {
      L++;
      continue;
    } else if (B == 0) {
      R++;
      continue;
    }
    // 約分して分子を正にする
    ll K = gcd(abs(A), abs(B));
    if (A < 0) {
      A *= -1;
      B *= -1;
    }
    A /= K;
    B /= K;
    M[mp(A, B)]++;
  }
  ll ANS = 1;
  for (auto P : M) {
    if (C[P.fr] == 1) {
      continue;
    }
    ll S = P.fr.fr;
    ll T = P.fr.sc;
    if (T < 0) {
      S *= -1;
      T *= -1;
    }
    S *= -1;
    ll X =
        (modpow(2, M[P.fr], MOD) + modpow(2, M[mp(T, S)], MOD) - 1 + MOD) % MOD;
    ANS = (ANS * X) % MOD;
    C[P.fr] = 1;
    C[mp(T, S)] = 1;
  }
  ll X = (modpow(2, R, MOD) + modpow(2, L, MOD) - 1 + MOD) % MOD;
  ANS *= X;
  ANS %= MOD;
  ANS = (ANS + Q - 1 + MOD) % MOD;
  cout << ANS << endl;
}


Error: 0

Fixed submission:

#include <algorithm>
#include <complex>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define rRep(i, a, b) for (ll i = b - 1; i >= a; i--)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N)                                                      \\
  sort(A, A + N,                                                               \\
       [](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define debug(v)                                                               \\
  cout << #v << ":";                                                           \\
  for (auto x : v) {                                                           \\
    cout << x << ' ';                                                          \\
  }                                                                            \\
  cout << endl;
#define endl '\\n'
int ctoi(const char c) {
  if ('0' <= c && c <= '9')
    return (c - '0');
  return -1;
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
// constexpr ll MOD=1000000007;
constexpr ll INF = 1000000011;
constexpr ll MOD = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-8;
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &&x : v)
    is >> x;
  return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first;
  is >> p.second;
  return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
  os << p.first << ' ' << p.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i) {
    if (i != begin(v))
      os << ' ';
    os << *i;
  }
  return os;
}

ll N;
ll A, B;
map<pair<ll, ll>, ll> M, C;

ll cme;

ll modpow(ll b, ll e, ll m) { // bのe乗のmod m を返す
  if (e == 0)
    return 1;
  cme = modpow(b, e / 2, m);
  cme = (cme * cme) % m;
  if (e % 2 == 1)
    cme = (cme * b) % m;
  return cme;
}

int main() {
  cin >> N;
  rep(i, N) {
    cin >> A >> B;
    ll K = gcd(abs(A), abs(B));
    if (A < 0) {
      A *= -1;
      B *= -1;
    }
    A /= K;
    B /= K;
    M[mp(A, B)]++;
    C[mp(A, B)] = 0;
    if (B < 0) {
      A *= -1;
      B *= -1;
    }
    A *= -1;
    C[mp(B, A)] = 0;
  }
  ll ANS = 1;
  for (auto P : M) {
    if (C[P.fr] == 1) {
      continue;
    }
    ll S = P.fr.fr;
    ll T = P.fr.sc;
    if (T < 0) {
      S *= -1;
      T *= -1;
    }
    S *= -1;
    ll X =
        (modpow(2, M[P.fr], MOD) + modpow(2, M[mp(T, S)], MOD) - 1 + MOD) % MOD;
    ANS *= X;
    ANS %= MOD;
    C[P.fr] = 1;
    C[mp(T, S)] = 1;
  }
  ANS = (ANS - 1 + MOD) % MOD;
  cout << ANS << endl;
}