Submission #550772

#	Time	Username	Problem	Language	Result	Execution time	Memory
550772		Jomnoi	Pairs (IOI07_pairs)	C++17	30 / 100	22 ms	1492 KiB

pairs

#include <bits/stdc++.h>
#define DEBUG false
using namespace std;

long long solve1(int N, int D, int M) {
    vector <int> X(N + 1);
    for(int i = 1; i <= N; i++) {
        cin >> X[i];
    }

    sort(X.begin() + 1, X.end());

    long long ans = 0;
    for(int l = 1, r = 1; r <= N; r++) {
        while(l < r and X[r] - X[l] > D) {
            l++;
        }
        ans += r - l;
    }
    return ans;
}

long long solve2(int N, int D, int M) {
    vector <int> X(N + 1, 0), Y(N + 1, 0);
    return -1;
}

long long solve3(int N, int D, int M) {
    return -1;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int B, N, D, M;
    cin >> B >> N >> D >> M;
    if(B == 1) {
        cout << solve1(N, D, M);
    }
    else if(B == 2) {
        cout << solve2(N, D, M);
    }
    else if(B == 3) {
        cout << solve3(N, D, M);
    }
    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