Submission #13328400


Source Code Expand

Copy
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int64 gcd(int64 a, int64 b) {
  while (b) {
    int64 c = a;
    a = b;
    b = c % b;
  }
  return a;
}

int main() {
  int n;
  scanf("%d", &n);
  vector<int64> a(n), b(n);
  map<pair<int64, int64>, int> cnt;
  for (int i = 0; i < n; ++i) {
    scanf("%lld%lld", &a[i], &b[i]);
    if (a[i] || b[i]) {
      int64 d = abs(gcd(a[i], b[i]));
      a[i] /= d;
      b[i] /= d;
      if (a[i] < 0 || (a[i] == 0 && b[i] < 0)) {
        a[i] = -a[i];
        b[i] = -b[i];
      }
    }
    cnt[{a[i], b[i]}]++;
  }
  vector<int> p2(n + 1, 1);
  for (int i = 1; i <= n; ++i) p2[i] = p2[i - 1] * 2 % MOD;
  int64 ret = 1;
  for (auto& [k, v] : cnt) {
    auto [x, y] = k;
    if (x == 0 && y == 0) continue;
    if (cnt[k] == 0) continue;
    int64 x2 = y, y2 = -x;
    if (x2 < 0 || (x2 == 0 && y2 < 0)) {
      x2 = -x2;
      y2 = -y2;
    }
    int64 cur = p2[cnt[{x, y}]] + p2[cnt[{x2, y2}]] - 1;
    cnt[{x2, y2}] = 0;
    ret = ret * cur % MOD;
    if (ret < 0) ret += MOD;
    // trace(x, y, x2, y2, cur);
  }
  ret = (ret + MOD - 1) % MOD;
  ret = (ret + cnt[{0, 0}]) % MOD;
  printf("%lld\n", ret);
  return 0;
}

Submission Info

Submission Time
Task E - ∙ (Bullet)
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 500
Code Size 3618 Byte
Status AC
Exec Time 499 ms
Memory 31496 KB

Compile Error

./Main.cpp:77:11: warning: unused variable 'INF' [-Wunused-const-variable]
const int INF = 1 << 29;
          ^
1 warning generated.

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 23
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sub1_11.txt, sub1_12.txt, sub1_13.txt, sub1_14.txt, sub1_15.txt, sub1_16.txt, sub1_17.txt, sub1_18.txt, sub1_19.txt, sub1_20.txt, sub1_21.txt
Case Name Status Exec Time Memory
sample_01.txt AC 8 ms 3208 KB
sample_02.txt AC 2 ms 3024 KB
sub1_01.txt AC 499 ms 31496 KB
sub1_02.txt AC 2 ms 3220 KB
sub1_03.txt AC 2 ms 3088 KB
sub1_04.txt AC 2 ms 3064 KB
sub1_05.txt AC 2 ms 3096 KB
sub1_06.txt AC 2 ms 3048 KB
sub1_07.txt AC 2 ms 3028 KB
sub1_08.txt AC 3 ms 3084 KB
sub1_09.txt AC 2 ms 3228 KB
sub1_10.txt AC 2 ms 3232 KB
sub1_11.txt AC 46 ms 4408 KB
sub1_12.txt AC 101 ms 6456 KB
sub1_13.txt AC 142 ms 7784 KB
sub1_14.txt AC 86 ms 6684 KB
sub1_15.txt AC 21 ms 3664 KB
sub1_16.txt AC 89 ms 6080 KB
sub1_17.txt AC 51 ms 4572 KB
sub1_18.txt AC 74 ms 6456 KB
sub1_19.txt AC 38 ms 7292 KB
sub1_20.txt AC 130 ms 16752 KB
sub1_21.txt AC 30 ms 6616 KB