Submission #888181

#	Time	Username	Problem	Language	Result	Execution time	Memory
888181		Macker	Pairs (IOI07_pairs)	C++17	0 / 100	140 ms	524288 KiB

pairs

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()

class Seg{
    vector<ll> st;
    int len = 1;

public:
    Seg(int n){
        while(len < n) len *= 2;
        st.resize(len * 2, 0);
    }

    void add(int idx, ll val, int i, int s, int e){
        if(idx < s || idx >= e) return;
        if(idx == s && s + 1 == e){
            st[i] += val;
            return;
        }
        add(idx, val, i * 2, s, (s + e) / 2);
        add(idx, val, i * 2 + 1, (s + e) / 2, e);
        st[i] = st[i * 2] + st[i * 2 + 1];
    }
    void add(int idx, ll val){
        add(idx, val, 1, 0, len);
    }

    ll qry(int l, int r, int i, int s, int e){
        if(l >= e || s >= r) return 0;
        if(l <= s && e <= r) return st[i];
        return qry(l, r, i * 2, s, (s + e) / 2) + qry(l, r, i * 2 + 1, (s + e) / 2, e);
    }
    ll qry(int l, int r){
        return qry(l, r, 1, 0, len);
    }
};

vector<int> coords;

int cmpr(int x){
    return lower_bound(all(coords), x) - coords.begin();
}

int main()
{
    int b, n, d, m; cin >> b >> n >> d >> m;
    if(b == 1){
        vector<pair<int, int>> q;
        vector<int> ad;
        Seg st(m + 1);
        for (int i = 0; i < n; i++) {
            int a; cin >> a;
            ad.push_back(a);
            q.push_back({a - d, a + d + 1});
            coords.push_back(a);
            coords.push_back(a - d);
            coords.push_back(a + d + 1);
        }
        sort(all(coords));
        for (auto &i : ad)
            st.add(cmpr(i), 1);
        
        ll res = 0;
        for (auto &[f, t] : q)
            res += st.qry(cmpr(f), cmpr(t)) - 1;
        
        cout << res / 2 << endl;
    }
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 6
• Subtask 3: 0 / 6
• Subtask 4: 0 / 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