Submission #1366629

#	Time	Username	Problem	Language	Result	Execution time	Memory
1366629		kunzaZa183	Pairs (IOI07_pairs)	C++20	30 / 100	67 ms	6464 KiB

pairs

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
     tree_order_statistics_node_update>
    ti;
const int mn = 75e6 + 2;
int qs[mn] = {};
int main() {
  int b, n, d, m;
  cin >> b >> n >> d >> m;
  if (b == 1) {
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      ti.insert({x, i});
    }

    long long ans = 0;
    for (auto a : ti) {
      ans += ti.order_of_key(make_pair(a.first + d, n)) -
             ti.order_of_key({a.first, a.second + 1});
    }

    cout << ans << "\n";
  }
}

• 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