Submission #259921

#	Time	Username	Problem	Language	Result	Execution time	Memory
259921		thecodingwizard	Pairs (IOI07_pairs)	C++11	6 / 100	167 ms	6256 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>;

int b, n, d, m; 

int main() {
    cin >> b >> n >> d >> m;
    if (b == 1) {
        Tree<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());
        for (int x : nums) {
            ans += TS.order_of_key(x+1)-TS.order_of_key(x-d);
            TS.insert(x);
        }
        cout << ans << endl;
    } else if (b == 2) {

    } else {

    }
    return 0;
}

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