Submission #1287672

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287672		canhnam357	Pairs (IOI07_pairs)	C++20	30 / 100	14 ms	584 KiB

pairs

#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
void solve1() {
    int n, d, m;
    cin >> n >> d >> m;
    vector<int> a(n);
    for (int &i : a) cin >> i;
    sort(all(a));
    long long ans = 0;
    for (int l = 0, r = 0; r < n; r++) {
        while (a[r] - a[l] > d) l++;
        ans += r - l;
    }
    cout << ans;
}
void solve2() {
    
}
void solve3() {
    
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int type;
    cin >> type;
    if (type == 1) solve1();
    else if (type == 2) solve2();
    else solve3();   
    return 0;
}

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