Submission #1366304

#TimeUsernameProblemLanguageResultExecution timeMemory
1366304kunzaZa183Pairs (IOI07_pairs)C++20
24 / 100
368 ms550868 KiB
#include <bits/stdc++.h>
using namespace std;
int main() {
  int b, n, d, m;
  cin >> b >> n >> d >> m;
  if (b == 1) {
    vector<int> qs(m + d + 1), vi(n);
    set<int> si;
    for (auto &a : vi) {
      cin >> a;
      qs[a]++;
      si.insert(a);
    }

    for (int i = 1; i <= m + d; i++) {
      qs[i] += qs[i - 1];
    }

    long long tot = 0;
    for (auto a : si) {
      long long x = qs[a] - qs[a - 1];
      tot += x * (qs[a + d] - qs[a]) + x * (x - 1) / 2;

      // cout << tot << "\n";
    }
    cout << tot << "\n";
  }
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...