Submission #1294193

#	Time	Username	Problem	Language	Result	Execution time	Memory
1294193		avighna	Pairs (IOI07_pairs)	C++20	30 / 100	14 ms	588 KiB

pairs

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

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

  int b;
  cin >> b;
  if (b == 1) {
    int n, d, m;
    cin >> n >> d >> m;
    vector<int> a(n);
    for (int &i : a) {
      cin >> i;
    }
    sort(a.begin(), a.end());
    int64_t ans = 0;
    for (int i = 0, j = 0; i < n; ++i) {
      while (j < n && a[j] - a[i] <= d) {
        j++;
      }
      ans += j - i - 1;
    }
    cout << ans << '\n';
    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