제출 #453208

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
453208		prvocislo	Pairs (IOI07_pairs)	C++17	60 / 100	504 ms	22120 KiB

pairs

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
typedef long long ll;
using namespace std;

const int maxn = 1.5e5 + 5;
vector<int> st[maxn * 2];
void upd(int x, int y)
{
    for (x += maxn; x > 0; x >>= 1) st[x].push_back(y);
}
int query1d(int y1, int y2, int vr) { return upper_bound(st[vr].begin(), st[vr].end(), y2) - lower_bound(st[vr].begin(), st[vr].end(), y1); }
int query(int x1, int y1, int x2, int y2)
{
    x1 = max(x1, 0), x2 = min(x2, maxn - 1);
    int ans = 0;
    for (x1 += maxn, x2 += maxn + 1; x1 < x2; x1 >>= 1, x2 >>= 1)
    {
        if (x1 & 1) ans += query1d(y1, y2, x1++);
        if (x2 & 1) ans += query1d(y1, y2, --x2);
    }
    return ans;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int b, n, d, m;
    cin >> b >> n >> d >> m;
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++)
    {
        if (b == 1) cin >> y[i];
        else
        {
            int x1, y1; cin >> x1 >> y1;
            x[i] = x1 + y1, y[i] = x1 - y1;
        }
        upd(x[i], y[i]);
    }
    for (int i = 0; i < maxn * 2; i++) sort(st[i].begin(), st[i].end());
    ll ans = 0;
    for (int i = 0; i < n; i++)
    {
        ans += query(x[i] - d, y[i] - d, x[i] + d, y[i] + d);
    }
    cout << (ans - n) / 2 << "\n";
    return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 6 / 6
• Subtask 4: 6 / 6
• Subtask 5: 6 / 6
• Subtask 6: 7 / 7
• Subtask 7: 7 / 7
• Subtask 8: 8 / 8
• Subtask 9: 8 / 8
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10
• Subtask 12: 0 / 10
• Subtask 13: 0 / 10