제출 #259961

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
259961		thecodingwizard	Pairs (IOI07_pairs)	C++11	60 / 100	171 ms	7936 KiB

pairs

#include <bits/stdc++.h>

using namespace std;

#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>,
     rb_tree_tag, tree_order_statistics_node_update>;
#define ii pair<int, int>
#define f first
#define s second

int b, n, d, m; 

struct FT {
    vector<int> ft;
    int n;
    void init(int _n) {
        n = _n;
        ft.assign(n, 0);
    }
    void upd(int k, int v) {
        while (k <= n) {
            ft[k] += v;
            k += k&-k;
        }
    }
    int qry(int k) {
        k = min(k, n-1);
        if (k <= 0) return 0;
        int sum = 0;
        while (k) {
            sum += ft[k];
            k -= k&-k;
        }
        return sum;
    }
};

int main() {
    cin >> b >> n >> d >> m;
    if (b == 1) {
        Tree<pair<int, int>> TS;
        long long ans = 0;
        vector<int> nums;
        for (int i = 0; i < n; i++) {
            int x; cin >> x;
            nums.push_back(x);
        }
        sort(nums.begin(), nums.end());
        int ct = 0;
        for (int x : nums) {
            ans += ct-TS.order_of_key(make_pair(x-d, 0));
            TS.insert(make_pair(x, ct++));
        }
        cout << ans << endl;
    } else if (b == 2) {
        vector<ii> nums;
        for (int i = 0; i < n; i++) {
            int x, y; cin >> x >> y;
            nums.push_back(make_pair(x-y, x+y));
        }
        sort(nums.begin(), nums.end());
        int l = 0;
        FT ft; ft.init(2*m+1);
        long long ans = 0;
        for (int r = 0; r < n; r++) {
            while (nums[r].f - nums[l].f > d) {
                ft.upd(nums[l].s, -1);
                l++;
            }
            ans += ft.qry(nums[r].s+d) - ft.qry(nums[r].s-d-1);
            ft.upd(nums[r].s, 1);
        }
        cout << ans << endl;
    } else {

    }
    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