제출 #1284932

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284932		zxzuam	Pairs (IOI07_pairs)	C++20	30 / 100	17 ms	1100 KiB

pairs

#include <bits/stdc++.h>
//#define int long long
using ll = int64_t;
using namespace std;
constexpr int maxn = 2E5;
void orz() {
    ll B, N, D, M;
    cin >> B >> N >> D >> M;
    vector <ll> A(N + 1);
    for(int i = 1; i <= N; ++i) {
        cin >> A[i];
    }
    sort(A.begin() + 1, A.end());
    ll ans = 0;
    for(int i = 1; i <= N; i++) {
        ans += (upper_bound(A.begin(), A.end(), A[i] + D) - A.begin() - 1 - i);
    }
    cout << ans;
}
int32_t main() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    //freopen("promote.in", "r", stdin);
    //freopen("promote.out", "w", stdout);
    int T = 1;
    //cin >> T;
    while(T--) orz();
    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