提出 #72726790

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

using LL = long long;

#define int long long

const int N = 2e5 + 1;
const int M = 998244353;
const double PI = acos(-1.0);
void solve()
{
    int n, q;
    cin >> n >> q;
    vector<array<int, 3>> a(n + 1);
    vector<double> ang(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i][0] >> a[i][1];
        a[i][2] = i;
        ang[i] = atan2(a[i][1], a[i][0]);
    }
    vector<double> sangl;
    sangl = ang;
    sort(sangl.begin() + 1, sangl.end());
    int size = sangl.size();
    for (int i = 1; i < size; i++)
    {
        sangl.push_back(sangl[i] + 2 * PI);
    }

    vector<int> pre(n + 1);

    while (q--)
    {
        int x, y;
        cin >> x >> y;
        double stat = ang[x];
        double ed = ang[y];
        if (stat < ed)
            stat += 2 * PI;
        auto l = lower_bound(sangl.begin() + 1, sangl.end(), ed) - sangl.begin();
        auto r = upper_bound(sangl.begin() + 1, sangl.end(), stat) - sangl.begin();
        cout << r - l << "\n";
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    //   cin >> T;

    while (T--)
        solve();

    return 0;
}

提出情報

ジャッジ結果