Submission #55060761

---

Source Code Expand

#include <bits/stdc++.h>
#define endl '\n'
#define int long long

using namespace std;
using i64 = long long;

const int N = 2e5 + 5;
int n, t;
int a[N];
string s;
vector<int> x, y; // 逆行 顺行

signed main() {
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> n >> t >> s, s = " " + s;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        if (s[i] == '0') {
            x.push_back(a[i]);
        } else {
            y.push_back(a[i]);
        }
    }
    sort(x.begin(), x.end()), sort(y.begin(), y.end());
    i64 ans = 0;
    for (auto i : x) {
        int l = lower_bound(y.begin(), y.end(), i - 2 * t) - y.begin();
        int r = upper_bound(y.begin(), y.end(), i) - y.begin();
        ans += r - l;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result