Submission #72715251

---

Source Code Expand

#include <bits/stdc++.h>

//#include <atcoder/all>
using namespace std;

#define lli long long int
#define REP(i, s, n) for (lli i = s; i < n; i++)
#define INF (1LL << 62)
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #VariableName
#define LOG1(x)                                                                \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y)                                                             \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl;
#define LOG3(x, y, z)                                                          \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \
         << TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z)                                                       \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z        \
         << endl;
#define LOG5(w, x, y, z, a)                                                    \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \
         << TO_STRING(a) << "=" << a << endl;
#define LOG6(w, x, y, z, a, b)                                                 \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \
         << TO_STRING(a) << "=" << a << " " << TO_STRING(b) << "=" << b        \
         << endl;

#define overload6(a, b, c, d, e, f, g, ...) g
#define LOG(...)                                                               \
  overload6(__VA_ARGS__, LOG6, LOG5, LOG4, LOG3, LOG2, LOG1)(__VA_ARGS__)

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

mt19937 engine;
std::chrono::system_clock::time_point start, endTime;

#define DEBUG 0

lli gcd(lli a, lli b) {
  if (a == 0)
    return b;
  if (b == 0)
    return a;
  if (a % b == 0) {
    return b;
  } else {
    return gcd(b, a % b);
  }
}
lli lcm(lli a, lli b) { return a * b / gcd(a, b); }

void solve() {
  //  write your code here

  lli N, Q;
  cin >> N >> Q;

  vector<lli> X(N), Y(N);

  REP(i, 0, N) { cin >> X[i] >> Y[i]; }

  vector<pair<long double, int>> V(N);

  REP(i, 0, N) {
    lli nowGcd = gcd(abs(Y[i]), abs(X[i]));
    V[i] = {atan2l(Y[i] / nowGcd, X[i] / nowGcd), i};
  }

  //同じものはまとめ上げる、どうやってやるかは最大公約数で割ればよい

  map<pair<int, int>, set<int>> cnts;

  REP(i, 0, N) {
    lli nowGcd = gcd(abs(X[i]), abs(Y[i]));
    cnts[{X[i] / nowGcd, Y[i] / nowGcd}].insert(i);
  }

  SORT(V);

  vector<pair<int, int>> V2;

  int nowIndex = 0;

  set<int> visitedRealIndex;
  REP(i, 0, N) {
    int realIndex = V[i].second;
    int realX = X[realIndex];
    int realY = Y[realIndex];
    LOG(realIndex, realX, realY);
    if (visitedRealIndex.find(realIndex) != visitedRealIndex.end()) {
      break;
    }
    int nowGcd = gcd(abs(realX), abs(realY));
    for (auto realIndex2 : cnts[{realX / nowGcd, realY / nowGcd}]) {
      V2.push_back({nowIndex, realIndex2});
      visitedRealIndex.insert(realIndex2);
      i++;
    }
    nowIndex += cnts[{realX / nowGcd, realY / nowGcd}].size();
    i--;
  }

  map<lli, lli> backRealIndexToV2Index;
  REP(i, 0, N) { backRealIndexToV2Index[V2[i].second] = V2[i].first; }

  while (Q--) {
    lli a, b;
    cin >> a >> b;
    a--;
    b--;

    lli aV2Index = backRealIndexToV2Index[a];
    lli bV2Index = backRealIndexToV2Index[b];

    lli realAX = X[a];
    lli realAY = Y[a];
    lli aGcd = gcd(abs(realAX), abs(realAY));
    lli aCnts = cnts[{realAX / aGcd, realAY / aGcd}].size();

    lli realBX = X[b];
    lli realBY = Y[b];
    lli bGcd = gcd(abs(realBX), abs(realBY));
    lli bCnts = cnts[{realBX / bGcd, realBY / bGcd}].size();
    LOG(aV2Index, bV2Index);

    if (aV2Index < bV2Index) {
      aV2Index += N;
    }
    cout << aV2Index - bV2Index + aCnts << endl;
  }
}

// Generated by 2.13.0 https://github.com/kyuridenamida/atcoder-tools  (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
  // Failed to predict input format

  lli N = 1;
  // cin >> N;
  while (N--)
    solve();

  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function 'void solve()':
./Main.cpp:149:9: warning: unused variable 'bCnts' [-Wunused-variable]
  149 |     lli bCnts = cnts[{realBX / bGcd, realBY / bGcd}].size();
      |         ^~~~~

Judge Result