Submission #9903143


Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n, k; cin >> n >> k;
    vector<int> a(n);
    for (auto &ai: a) cin >> ai;
    long long cnt = 0;
    for (int mid = 0; mid < n; mid++) {
        int left = lower_bound(begin(a), end(a), a[mid] - k) - begin(a);
        int right = upper_bound(begin(a), end(a), a[mid] + k) - begin(a) - 1;
        cnt += (right - mid) * (mid - left);
        cnt -= (right - mid) * ((right - mid) - 1) / 2;
    }
    cout << cnt << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 徒歩圏内
User kyuna
Language C++14 (GCC 5.4.1)
Score 0
Code Size 559 Byte
Status WA
Exec Time 51 ms
Memory 768 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 4
AC × 13
WA × 3
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Case Name Status Exec Time Memory
01.txt AC 49 ms 640 KB
02.txt AC 51 ms 768 KB
03.txt WA 45 ms 640 KB
04.txt AC 49 ms 640 KB
05.txt AC 49 ms 640 KB
06.txt WA 46 ms 640 KB
07.txt AC 38 ms 640 KB
08.txt AC 37 ms 640 KB
09.txt AC 1 ms 256 KB
10.txt WA 47 ms 640 KB
11.txt AC 49 ms 640 KB
12.txt AC 46 ms 640 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB
sample-04.txt AC 1 ms 256 KB