Submission #483910

#	Time	Username	Problem	Language	Result	Execution time	Memory
483910		blue	Pairs (IOI07_pairs)	C++17	30 / 100	17 ms	1484 KiB

pairs

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

void solve_1()
{
    int N, D, M;
    cin >> N >> D >> M;

    vector<int> A(N);
    for(int i = 0; i < N; i++) cin >> A[i];
    sort(A.begin(), A.end());

    long long ans = 0;

    int j = 0;
    for(int i = 0; i < N; i++)
    {
        while(j+1 < N && A[j+1] - A[i] <= D)
            j++;

        ans += (j-i);
    }

    cout << ans << '\n';
}

void solve_2()
{
    ;
}

void solve_3()
{
    ;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int B;
    cin >> B;

    if(B == 1) solve_1();
    else if(B == 2) solve_2();
    else if(B == 3) solve_3();
}

• 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